Facebook
From Nguyen Cong Kien, 1 Month ago, written in C++.
Embed
Download Paste or View Raw
Hits: 123
  1. #include<bits/stdc++.h>
  2.  
  3. using namespace std;
  4.  
  5. long long n,m;
  6. long long l = 35000;
  7. int p[35000];
  8. long long k = 0;
  9.  
  10. void sieve() {
  11.     for (int i = 1;i <= l;i++) {p[i] = 1;}
  12.  
  13.     p[1] = 0;
  14.     for (int i = 2;i <= l;i++) {
  15.         if (p[i] == 1) {
  16.             for (int j = i+i;j <= l;j += i) {p[j] = 0;}
  17.         }
  18.     }
  19. }
  20.  
  21. int main() {
  22.     freopen("BEAUNUM.inp","r",stdin);
  23.     freopen("BEAUNUM.out","w",stdout);
  24.  
  25.     cin>>n;
  26.     m = (int)sqrt(sqrt(n));
  27.  
  28.     sieve();
  29.  
  30.     for (int i = 1;i <= m;i++) {k += p[i];}
  31.     cout<<k;
  32.  
  33.     //for (int i = 1;i <= n;i++) {if (p[i] == 1) {cout<<i<<" ";}}
  34. }
  35.