Cod sursa(job #296044)
Utilizator | Data | 4 aprilie 2009 01:58:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<fstream.h>
ifstream intrare ("ciur.in");
ofstream iesire ("ciur.out");
int v[2000001];
int main()
{
int nr;
long long unsigned j,i,n;
intrare>>n;
nr=0;
for(i=2;i<=n;i++)
{
if(v[i]==0)
{
for(j=i*i;j<=n;j+=i)
{
v[j]=1;
}
nr++;
}
}
iesire<<nr;
return 0;
}