Cod sursa(job #441846)
Utilizator | Data | 13 aprilie 2010 15:57:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
using namespace std;
#include <fstream>
int n, nr;
char prim[2000010];
int main()
{
int i, j;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for (i = 2; i <= n; ++i)
prim[i] = 1;
for (i = 2; i <= n; ++i)
if (prim[i])
{
nr++;
for (j=2*i;j<=n;j=j+i)
prim[j] = 0;
}
g<<nr;
return 0;
}