Cod sursa(job #573545)
Utilizator | Data | 6 aprilie 2011 12:55:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
using namespace std;
#include<fstream>
bool prim[2100100];
int main()
{unsigned int n,i, j,st,cont=1;
ifstream in("ciur.in");
ofstream out("ciur.out");
in>>n;
in.close();
prim[2]=1;
for(i=3;i<=n;prim[i]=1,i+=2);
for(i=3;i<=n;i+=2)
if(prim[i])
{cont++;
st=i+i;
while(st<=n)
prim[st]=0,st+=i;
}
out<<cont<<'\n';
out.close();
}