Cod sursa(job #581408)
Utilizator | Data | 14 aprilie 2011 09:18:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
long long su=0,n;
char prim[2000005];
int main()
{long long i,j;
f>>n;
for(i=2;i<=n;i++)
prim[i]=1;
for(i=2;i<=n;i++)
if(prim[i])
{su++;
for(j=i*i;j<=n;j+=i)
prim[j]=0;
}
g<<su;
}