fork download
copy 
  1. #include <bits/stdc++.h>
  2. #define int long long
  3. using namespace std;
  4.  
  5. bool is_prime(int n) {
  6.     for(int i = 2; i * i <= n; ++ i)
  7.         if(n % i == 0)
  8.             return false;
  9.     return true;
  10. }
  11.  
  12. vector<bool> prime(1e6 + 1, true);
  13. void sieve() {
  14.     prime[0] = prime[1] = false;
  15.     for(int i = 2; i <= 1e6; ++ i) {
  16.         if(prime[i]) {
  17.             for(int j = i * 2; j <= 1e6; j += i) {
  18.                 prime[j] = false;
  19.             }
  20.         }
  21.     }
  22. }
  23.  
  24. int32_t main() {
  25.     int q; cin >> q;
  26.     if(q > 100) sieve();
  27.     for(int i = 0; i < q; ++ i) {
  28.         int n; cin >> n;
  29.         if(q <= 100) {
  30.             while(!is_prime(n)) ++ n;
  31.         }
  32.         else {
  33.             while(!prime[n]) ++ n;
  34.         }
  35.         cout << n << "\n";
  36.     }
  37. }
Success #stdin #stdout 0.01s 5304KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/WrXW3a
language:
C++14 (gcc 8.3)
created:
1 year ago
visibility:
secret

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!