Cod sursa(job #236972)
Utilizator | Data | 28 decembrie 2008 20:34:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<iostream.h>
#include<fstream.h>
int main()
{
char v[2000001];long int k=0,i,j,n;
fstream f("ciur.in",ios::in),g("ciur.out",ios::out);
f>>n;
for(i=1;i<=n;i++)
v[i]='0';
for(i=2;i<=n;i++)
if(v[i]=='0')
{
k++;
for(j=i;j<=n;j+=i)
v[j]='1';
}
g<<k;f.close();g.close();
}