fork(1) download
copy 
  1. #include <bits/stdc++.h>
  2.  
  3. using namespace std;
  4.  
  5. // Complete the solve function below.
  6. string solve(int n) {
  7.     if(n == 1) return "Not Prime";
  8.     int i, num;
  9.     num = pow(n,0.5);
  10.     for(i=2; i <= num; ++i){
  11.         if(n % i == 0) return "Not Prime";
  12.     }
  13.     return "Prime";
  14. }
  15.  
  16. int main()
  17. {
  18.  
  19.     int p;
  20.     cin >> p;
  21.     cin.ignore(numeric_limits<streamsize>::max(), '\n');
  22.  
  23.     for (int p_itr = 0; p_itr < p; p_itr++) {
  24.         int n;
  25.         cin >> n;
  26.         cin.ignore(numeric_limits<streamsize>::max(), '\n');
  27.  
  28.         string result = solve(n);
  29.  
  30.         cout << result << "\n";
  31.     }
  32.  
  33.     return 0;
  34. }
  35.  
Success #stdin #stdout 0s 4400KB
comments (?)
stdin
copy 
3
12
5
7
stdout
copy 
Not Prime
Prime
Prime
https://ideone.com/gH8CT4
language:
C++14 (gcc 8.3)
created:
5 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!