Cod sursa(job #282566)
Utilizator | Data | 17 martie 2009 22:03:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
char a[2000001];
int n,nr;
int main(){
int i,j;
fin>>n;
for(i = 2; i <= n; i++)
if(a[i] == 0){
nr++;
for(j = i+1;j<= n; j++)
if(j%i == 0)
a[j] = 1;
}
fout<<nr;
fin.close();
fout.close();
return 0;
}