Cod sursa(job #3228585)
Utilizator | Cosmin cosmin21 | Data | 8 mai 2024 23:13:42 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
bool w[20001];
int n, cnt, i, j;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f >> n;
w[0] = w[1] = true;
for(i = 2; i <= n; ++ i){
if(w[i] == false){
cnt ++;
for(j = i + i; j <= n; j += i)
w[j] = true;
}
}
g << cnt;
return 0;
}