Cod sursa(job #1461341)
Utilizator | Data | 15 iulie 2015 14:59:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, nr;
int nmr[2000001];
int main()
{
fin >> n;
for(int i=2; i<=n; i++){
nmr[i] = 1;
}
for(int i=2; i<=n; i++){
if(nmr[i] == 1){
nr++;
for(int j=i*i; j<=n; j+=i){
nmr[j]=0;
}
}
}
cout<<nr;
return 0;
}