Cod sursa(job #1011575)
Utilizator | Data | 16 octombrie 2013 22:45:31 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<fstream>
#include<bitset>
using namespace std;
bitset<2000001> v;
long n,i,j,nr=0;
int main()
{ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
v[1]=1;
for(i=2;i<=n;i++)
if(v[i]==0)
{nr++;
for(j=2*i;j<=n;j+=i)
v[j]=1;
}
g<<nr;
f.close();g.close();
return 0;
}