Cod sursa(job #384836)
Utilizator | Data | 21 ianuarie 2010 08:09:15 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.26 kb |
#include<fstream.h>
int n,v[1000],nr,j,i;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
f>>n;
for(i=0;i<n;i++)
v[i]=0;
for(i=2;i<=n;i++)
if(v[i]==0)
{
nr++;
for(j=2;j<=n/i;j++)
v[i*j]=1;
}
g<<nr;
return 0;
}