Cod sursa(job #2428301)
Utilizator | Data | 4 iunie 2019 17:06:15 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<fstream>
#include<bitset>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,x=1,i,j;
bitset<2000001> p;
int main()
{
for(f>>n,i=3;i*i<=n;i+=2)
if(!p[i])
for(j=i*i;j<=n;j+=2*i)
p[j]=1;
g<<(n+1)/2-p.count();
return 0;
}