Cod sursa(job #1697218)
Utilizator | Data | 1 mai 2016 00:47:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<iostream>
#include<fstream>
using namespace std;
int N, cnt;
char prim[2000];
int main(void)
{
int i, j;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin >> N;
for (i = 2; i <= N; ++i)
prim[i] = 1;
for (i = 2; i <= N; ++i)
if (prim[i])
{
++cnt;
for (j = i + i; j <= N; j += i)
prim[j] = 0;
}
fout << cnt << endl;
return 0;
}