Cod sursa(job #1887509)
Utilizator | Data | 21 februarie 2017 17:18:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int N,prim[200005],nr;
int main()
{
f>>N;
for (int i = 2; i <= N; ++i)
prim[i] = 1;
for (int i = 2; i <= N; ++i)
if (prim[i])
{
++nr;
for (int j = i+i; j <= N; j += i)
prim[j] = 0;
}
g<<nr<<' ';
return 0;
}