Cod sursa(job #872290)
Utilizator | Data | 5 februarie 2013 22:28:48 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int v[20000];
int N;
int ct;
int main()
{
f >> N;
for(int i = 2; i <= N; i++) {
if(v[i] == 0) {
ct++;
v[i] = 1;
for(int j = i + i; j <= N; j += i) {
v[j] = 1;
}
}
}
g << ct;
}