Cod sursa(job #1017250)
Utilizator | Data | 27 octombrie 2013 16:20:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
char prim[2000001];
int n, nr=1, i, j;
f>>n;
for(i=3; i<=n; i=i+2)
{
if(!prim[i])
{
nr++;
for(j=i; j<=n; j=j+i)
prim[j]=1;
}
}
g<<nr;
f.close(); g.close();
return 0;
}