// A optimized school method based C++ program to check
// if a number is prime
#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()
{
int arr[10];
int count=0;
for(int i=0;i<10;i++){
cin>>arr[i];
if(isPrime(arr[i])==true){
count++;
cout<<"Found "<<count<<"prime numbers : "<< arr[i]<<" ";
}
}
return 0;
}
Ly8gQSBvcHRpbWl6ZWQgc2Nob29sIG1ldGhvZCBiYXNlZCBDKysgcHJvZ3JhbSB0byBjaGVjayAKLy8gaWYgYSBudW1iZXIgaXMgcHJpbWUgCiNpbmNsdWRlIDxiaXRzL3N0ZGMrKy5oPiAKCnVzaW5nIG5hbWVzcGFjZSBzdGQ7IAoKICAKCmJvb2wgaXNQcmltZShpbnQgbikgCnsgCgogICAgLy8gQ29ybmVyIGNhc2VzIAoKICAgIGlmIChuIDw9IDEpIAoKICAgICAgICByZXR1cm4gZmFsc2U7IAoKICAgIGlmIChuIDw9IDMpIAoKICAgICAgICByZXR1cm4gdHJ1ZTsgCgogIAoKICAgIC8vIFRoaXMgaXMgY2hlY2tlZCBzbyB0aGF0IHdlIGNhbiBza2lwIAoKICAgIC8vIG1pZGRsZSBmaXZlIG51bWJlcnMgaW4gYmVsb3cgbG9vcCAKCiAgICBpZiAobiAlIDIgPT0gMCB8fCBuICUgMyA9PSAwKSAKCiAgICAgICAgcmV0dXJuIGZhbHNlOyAKCiAgCgogICAgZm9yIChpbnQgaSA9IDU7IGkgKiBpIDw9IG47IGkgPSBpICsgNikgCgogICAgICAgIGlmIChuICUgaSA9PSAwIHx8IG4gJSAoaSArIDIpID09IDApIAoKICAgICAgICAgICAgcmV0dXJuIGZhbHNlOyAKCiAgCgogICAgcmV0dXJuIHRydWU7IAp9IAoKICAKLy8gRHJpdmVyIFByb2dyYW0gdG8gdGVzdCBhYm92ZSBmdW5jdGlvbiAKCmludCBtYWluKCkgCnsgCiAgICBpbnQgYXJyWzEwXTsKICAgIGludCBjb3VudD0wOwogICAgZm9yKGludCBpPTA7aTwxMDtpKyspewogICAgICBjaW4+PmFycltpXTsKICAgICAgIGlmKGlzUHJpbWUoYXJyW2ldKT09dHJ1ZSl7CiAgICAgICAgICBjb3VudCsrOwogICAgICAgICAgY291dDw8IkZvdW5kICI8PGNvdW50PDwicHJpbWUgbnVtYmVycyA6ICI8PCBhcnJbaV08PCIgIjsKICAgICAgIH0KICAgIH0gCiAgICByZXR1cm4gMDsgCn0g