Cod sursa(job #548530)
Utilizator | Data | 7 martie 2011 15:28:25 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<iostream.h>
#include<fstream.h>
char a[2000009];
long long N,i,j,x;
int main()
{
ifstream f;
f.open("ciur.in");
ofstream g;
g.open("ciur.out");
f>>N;
for(i=1;i<=N;i++)
a[i]=1;
int x=0;
for(i=2;i<=N;i++)
if(a[i]==1)
{
for(j=i;j<=N;j=j+i)
a[j]=0;
x++;
}
g<<x;
f.close();
g.close();
return 0;
}