#include<bits/stdc++.h>
using namespace std;
bool isPrime(int n)
{
// Corner cases
if (n <= 1)
return false;
if (n <= 3)
return true;
// This is checked so that we can skip
// middle five numbers in below loop
if (n % 2 == 0 || n % 3 == 0)
return false;
for (int i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0)
return false;
return true;
}
// Driver Program to test above function
int main()
{
cout<<"Enter 10 integers :";
int arr[10];
int count=0;
for(int i=0;i<10;i++){
cin>>arr[i];
if(isPrime(arr[i])==true){
cout<<arr[i]<<" ";
}
else if(isPrime(arr[i]==false)){
cout<<"No prime numbers found.";
}
}
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4gCnVzaW5nIG5hbWVzcGFjZSBzdGQ7IAoKYm9vbCBpc1ByaW1lKGludCBuKSAKeyAKCiAgICAvLyBDb3JuZXIgY2FzZXMgCiAgICBpZiAobiA8PSAxKSAKICAgICAgICByZXR1cm4gZmFsc2U7IAogICAgaWYgKG4gPD0gMykgCiAgICAgICAgcmV0dXJuIHRydWU7IAoKIAogICAgLy8gVGhpcyBpcyBjaGVja2VkIHNvIHRoYXQgd2UgY2FuIHNraXAgCgogICAgLy8gbWlkZGxlIGZpdmUgbnVtYmVycyBpbiBiZWxvdyBsb29wIAoKICAgIGlmIChuICUgMiA9PSAwIHx8IG4gJSAzID09IDApIAogICAgICAgIHJldHVybiBmYWxzZTsgCgogIAoKICAgIGZvciAoaW50IGkgPSA1OyBpICogaSA8PSBuOyBpID0gaSArIDYpIAogICAgICAgIGlmIChuICUgaSA9PSAwIHx8IG4gJSAoaSArIDIpID09IDApIAogICAgICAgICAgICByZXR1cm4gZmFsc2U7IAogICAgcmV0dXJuIHRydWU7IAp9IAogIAovLyBEcml2ZXIgUHJvZ3JhbSB0byB0ZXN0IGFib3ZlIGZ1bmN0aW9uIAoKaW50IG1haW4oKSAKeyAKCiAgICBjb3V0PDwiRW50ZXIgMTAgaW50ZWdlcnMgOiI7CiAgICBpbnQgYXJyWzEwXTsKICAgIGludCBjb3VudD0wOwogICAgZm9yKGludCBpPTA7aTwxMDtpKyspewogICAgICBjaW4+PmFycltpXTsKICAgICAgIGlmKGlzUHJpbWUoYXJyW2ldKT09dHJ1ZSl7CiAgICAgICAgICBjb3V0PDxhcnJbaV08PCIgIjsKICAgICAgIH0KICAgICAgIGVsc2UgaWYoaXNQcmltZShhcnJbaV09PWZhbHNlKSl7CiAgICAgICAgICBjb3V0PDwiTm8gcHJpbWUgbnVtYmVycyBmb3VuZC4iOwogICAgICAgfQogICAgfSAKICAgIHJldHVybiAwOyAKfSA=