fork download
copy 
  1. #include<bits/stdc++.h> 
  2. using namespace std; 
  3.  
  4. bool isPrime(int n) 
  5. { 
  6.  
  7.     // Corner cases 
  8.     if (n <= 1) 
  9.         return false; 
  10.     if (n <= 3) 
  11.         return true; 
  12.  
  13.  
  14.     // This is checked so that we can skip 
  15.  
  16.     // middle five numbers in below loop 
  17.  
  18.     if (n % 2 == 0 || n % 3 == 0) 
  19.         return false; 
  20.  
  21.  
  22.  
  23.     for (int i = 5; i * i <= n; i = i + 6) 
  24.         if (n % i == 0 || n % (i + 2) == 0) 
  25.             return false; 
  26.     return true; 
  27. } 
  28.  
  29. // Driver Program to test above function 
  30.  
  31. int main() 
  32. { 
  33.     int arr[10];
  34.     int count=0;
  35.     for(int i=0;i<10;i++){
  36.       cin>>arr[i];
  37.        if(isPrime(arr[i])==true){
  38.           cout<<arr[i]<<", ";
  39.        }
  40.        else{
  41.           cout<<"No prime number found.";
  42.        }
  43.     } 
  44.     return 0; 
  45. }
Success #stdin #stdout 0s 5636KB
comments (?)
stdin
copy 
1 2 3 4 5 6 7 8 9 10
stdout
copy 
No prime number found.2, 3, No prime number found.5, No prime number found.7, No prime number found.No prime number found.No prime number found.
https://ideone.com/sL9tXD
language:
C++14 (gcc 8.3)
created:
2 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!