Cod sursa(job #662292)
Utilizator | Data | 16 ianuarie 2012 14:52:00 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<fstream>
using namespace std;
int main ()
{
int i,j,nr=0,n;
char ciur[2000001];
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++);
if (ciur[i]==0)
{ nr++;
for(j=i+i;j<=n;j+=i)
ciur[i]=1;
}
g<<nr;
return 0;
}