Cod sursa(job #362308)
Utilizator | Data | 8 noiembrie 2009 20:30:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream.h>
#include <iostream.h>
int v[2000000];
int main()
{
int i,j,n,nr=0;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++)if(!v[i])
{
nr++;
for(j=2*i;j<=n;j+=i)
v[j]=1;
}
g<<nr;
return 0;
}