Cod sursa(job #868281)
Utilizator | Data | 30 ianuarie 2013 21:21:58 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <cstdio>
using namespace std;
#define Nmax 2000000
int N, contor;
char (*p) = new char [Nmax];
void citire(){
freopen("ciur.in", "r", stdin);
scanf("%d", &N);
}
void gen(){
for(int i = 2; i <= N; i++)
if(p[i] == 0){
contor++;
for(int j = i + i; j <= N; j += i)
p[j] = 1;
}
}
void afis(){
freopen("ciur.out", "w", stdout);
printf("%d\n", contor);
}
int main(){
citire();
gen();
afis();
return 0;
}