Cod sursa(job #944154)
Utilizator | Data | 27 aprilie 2013 16:28:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
int n, sol;
char prim[2000005];
f>>n;
for (int i=2; i<=n; ++i) prim[i] = 1;
for (int i=2; i<=n; ++i)
if (prim[i])
{
++sol;
for (int j=i+i; j<=n; j+=i) prim[j]=0;
}
g<<sol<<'\n';
f.close(); g.close();
return 0;
}