fork download
copy 
  1. #include <bits/stdc++.h>
  2.  
  3. using namespace std;
  4.  
  5. int n;
  6. long long b;
  7. double res;
  8. const int maxn = 1e7;
  9. bool prime[maxn+1];
  10. vector<long long> v;
  11.  
  12. void sangnt()
  13. {
  14.    memset(prime,true,sizeof prime);
  15.    prime[0]=false;
  16.    prime[1]=false;
  17.    for (int i=2;i*i<=maxn;i++){
  18.         if (prime[i]==true){
  19.             for (int j=i*i;j<=maxn;j+=i){
  20.                 prime[j]=false;
  21.             }
  22.         }
  23.    }
  24. }
  25. void chuanbi()
  26. {
  27.     for (int i=1;i<=maxn;i++)
  28.     {
  29.         if (prime[i]==true)
  30.         v.push_back(i);
  31.     }
  32. }
  33. long long sumprime(long long n) {
  34.   long long sum=0;
  35.   int dem=0;
  36.   for (auto x : v)
  37.   {
  38.       if (dem==n) break;
  39.       sum+=x;
  40.       dem++;
  41.   }
  42.  return sum;
  43. }
  44.  
  45.  
  46. int main() {
  47.     sangnt();
  48.     chuanbi();
  49.     freopen("NGUYENTO.INP","r",stdin);
  50.     freopen("NGUYENTO.OUT","w",stdout);
  51.     cin>>n;
  52.     while(n--){
  53.         cin>>b;
  54.         cout<<sumprime(b)<<endl;
  55.     }
  56.  
  57.   return 0;
  58. }
  59.  
Success #stdin #stdout 0.08s 23028KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/NXA9xh
language:
C++ (gcc 8.3)
created:
37 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!