Cod sursa(job #1094027)
Utilizator | Data | 28 ianuarie 2014 20:43:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
long p[2000001];
using namespace std;
int main()
{ ifstream f("ciur.in");
ofstream g("ciur.out");
long n, i,j,nr=0;
f>>n;
for (i=2;i<=n;++i)
if(p[i]==0)
{
nr++;
for (j=i+i; j<=n;j+=i)
p[j]=1;
}
g<<nr;
f.close();
g.close();
return 0;
}