Cod sursa(job #256640)
Utilizator | Data | 11 februarie 2009 23:01:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
using namespace std;
#define xx 2000001
ifstream fin("ciur.in");
ofstream fout("ciur.out");
long int n,i,j,cnt;
char prim[xx];
int main()
{
fin>>n;
for(i=2;i<=n;i++)
prim[i]=1;
for(i=2;i<=n;i++)
if(prim[i]==1)
{
cnt++;
for(j=i+i;j<=n;j+=i)
prim[j]=0;
}
fout<<cnt<<'\n';
fout.close();
return 0;
}