Cod sursa(job #1925198)
Utilizator | Data | 12 martie 2017 16:44:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");ofstream g("ciur.out");
int N,cnt;
char prim[2000010];
int main()
{
f >> N;
for(int i = 2; i <= N; ++i)
{
if(!prim[i])
{
cnt++;
for(int j = i + i; j <= N; j+=i)
prim[j] = 1;
}
}
g << cnt;
g.close();
return 0;
}