Cod sursa(job #822604)
Utilizator | Data | 23 noiembrie 2012 20:06:54 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
#define MAXN 2000001
using namespace std;
ofstream fout("ciur.out");
ifstream fin("ciur.in");
int main()
{
bool A[MAXN]={0};
int N,i,j,prime = 1;
fin >> N;
for(i = 1; 2*i+1 <= N; i++){
if(!A[i]){
prime++;
for(j = 3*i + 1; j <= N; j+=2*i+1){
A[j] = 1;
}
}
}
fout << prime;
fin.close();
fout.close();
return 0;
}