Cod sursa(job #524491)
Utilizator | Data | 21 ianuarie 2011 21:12:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.26 kb |
#include<fstream>
using namespace std;
int main ()
{ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,j,nr,p[1000];
f>>n;
for(i=2; i<=n; i++)
if(!p[i])
{ nr++; for(j=i+1; j<=n; j+=i) p[j]=1;}
g<<nr<<endl;
f.close();
g.close();
return 0;
}