fork download
copy 
  1. // A optimized school method based C++ program to check 
  2. // if a number is prime 
  3. #include <bits/stdc++.h> 
  4.  
  5. using namespace std; 
  6.  
  7.  
  8.  
  9. bool isPrime(int n) 
  10. { 
  11.  
  12.     // Corner cases 
  13.  
  14.     if (n <= 1) 
  15.  
  16.         return false; 
  17.  
  18.     if (n <= 3) 
  19.  
  20.         return true; 
  21.  
  22.  
  23.  
  24.     // This is checked so that we can skip 
  25.  
  26.     // middle five numbers in below loop 
  27.  
  28.     if (n % 2 == 0 || n % 3 == 0) 
  29.  
  30.         return false; 
  31.  
  32.  
  33.  
  34.     for (int i = 5; i * i <= n; i = i + 6) 
  35.  
  36.         if (n % i == 0 || n % (i + 2) == 0) 
  37.  
  38.             return false; 
  39.  
  40.  
  41.  
  42.     return true; 
  43. } 
  44.  
  45.  
  46. // Driver Program to test above function 
  47.  
  48. int main() 
  49. { 
  50.     int arr[10];
  51.     for(int i=0;i<10;i++){
  52.       cin>>arr[i];
  53.        if(isPrime(arr[i])==true){
  54.           cout<<arr[i]<<" ";
  55.        }
  56.     } 
  57.     return 0; 
  58. }
Success #stdin #stdout 0s 5552KB
comments (?)
stdin
copy 
1 2 3 4 5 6 7 8 9 10
stdout
copy 
2 3 5 7
https://ideone.com/A6XBaf
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!