Cod sursa(job #1638150)
Utilizator | Data | 7 martie 2016 21:31:49 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int cont, N, tab[2000003];
int main(){
cin >> N;
for(int i = 2; i <= N; i++)
tab[i] = 1;
for(int i = 2; i <= N; i++)
if(tab[i]){
cont++;
for(int j = i+i; j <= N; j+=i)
tab[j] = 0;
}
cout << cont;
return 0;
}