fork download
copy 
  1. #pragma GCC optimize("O3,unroll-loops")
  2. #pragma GCC optimize("inline")
  3. #pragma GCC optimize("-fgcse")
  4. #pragma GCC optimize("-fgcse-lm")
  5. #pragma GCC optimize("-fipa-sra")
  6. #pragma GCC optimize("-ftree-pre")
  7. #pragma GCC optimize("-ftree-vrp")
  8. #pragma GCC optimize("-fpeephole2")
  9. #pragma GCC optimize("-ffast-math")
  10. #pragma GCC optimize("-fsched-spec")
  11. #pragma GCC optimize("-falign-jumps")
  12. #pragma GCC optimize("-falign-loops")
  13. #pragma GCC optimize("-falign-labels")
  14. #pragma GCC optimize("-fdevirtualize")
  15. #pragma GCC optimize("-fcaller-saves")
  16. #pragma GCC optimize("-fcrossjumping")
  17. #pragma GCC optimize("-fthread-jumps")
  18. #pragma GCC optimize("-funroll-loops")
  19. #pragma GCC optimize("fast-math")
  20. #pragma GCC optimize("-freorder-blocks")
  21. #pragma GCC optimize("-fschedule-insns")
  22. #pragma GCC optimize("inline-functions")
  23. #pragma GCC optimize("-ftree-tail-merge")
  24. #pragma GCC optimize("-fschedule-insns2")
  25. #pragma GCC optimize("-fstrict-aliasing")
  26. #pragma GCC optimize("-falign-functions")
  27. #pragma GCC optimize("-fcse-follow-jumps")
  28. #pragma GCC optimize("-fsched-interblock")
  29. #pragma GCC optimize("-fpartial-inlining")
  30. #pragma GCC optimize("no-stack-protector")
  31. #pragma GCC optimize("-freorder-functions")
  32. #pragma GCC optimize("-findirect-inlining")
  33. #pragma GCC optimize("-fhoist-adjacent-loads")
  34. #pragma GCC optimize("-frerun-cse-after-loop")
  35. #pragma GCC optimize("inline-small-functions")
  36. #pragma GCC optimize("-finline-small-functions")
  37. #pragma GCC optimize("-ftree-switch-conversion")
  38. #pragma GCC optimize("-foptimize-sibling-calls")
  39. #pragma GCC optimize("-fexpensive-optimizations")
  40. #pragma GCC optimize("inline-functions-called-once")
  41. #pragma GCC optimize("-fdelete-null-pointer-checks")
  42. #include<bits/stdc++.h>
  43. using namespace std;
  44. #define fi first
  45. #define se second
  46. #define ll long long
  47. #define el cout<<"\n"
  48. #define sz(x) (int)(x).size()
  49. #define all(x) (x).begin(),(x).end()
  50. #define f0(i,n) for(int i=0;i<n;++i)
  51. #define f1(i,n) for(int i=1;i<=n;++i)
  52. #define fz(i,a,n,z) for(int i=a;i<n;i+=z)
  53. #define rep(i,a,n,z) for(int i=a;i>n;i-=z)
  54. #define faster ios_base::sync_with_stdio(false);cin.tie(NULL);
  55. #define file(name) freopen(name".inp","r",stdin);freopen(name".out","w",stdout);
  56. bool checkprime(ll n)
  57. {
  58.     if(n == 2 || n == 3) return true;
  59.     if(n < 2 || n%2 == 0 || n%3 == 0) return false;
  60.     for(int i = 5; 1ll*i*i <= n; i+=6){
  61.         if(n%i == 0 || n%(i+2) == 0) return false;
  62.     }
  63.     return true;
  64. }
  65. const int maxn = 2e6 + 1;
  66. vector<int> prime;
  67. int D[maxn];
  68. void Sieve(){
  69.     for(int i=2;i<=sqrt(maxn);++i){
  70.         if(D[i] == 0){
  71.             for(int j=i;j<=maxn/i;++j){
  72.                 D[i*j] = 1;
  73.             }
  74.         }
  75.     }
  76.     for(int i=2;i<=maxn;++i) if(D[i] == 0) prime.push_back(i);
  77. }
  78. int main() {
  79.     faster
  80.     file("MPRI")
  81.     int q;
  82.     cin>>q;
  83.     ll n;
  84.     if(q<=100){ 
  85.         while(q--){
  86.             cin>>n;
  87.             while(!checkprime(n)) ++n;
  88.             cout<<n<<"\n";
  89.         }
  90.     }
  91.     else
  92.     {
  93.         Sieve();
  94.         while(q--){
  95.             cin>>n;
  96.             int vt = lower_bound(all(prime), n) - prime.begin();
  97.             cout<<prime[vt]<<"\n";
  98.         }
  99.     }
  100. }
  101.  
Success #stdin #stdout 0.02s 12292KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/EUmkyf
language:
C++14 (gcc 8.3)
created:
5 days 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!