Cod sursa(job #1193418)
| Utilizator | Data | 31 mai 2014 18:30:14 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream>
using namespace std;
const int MAX=2000001;
int prim[2000001],nr=0;
int main(){
ifstream fin("ciur.in");
ofstream fout("ciur.out");
long n;
fin>>n;
for(int i=2;i<=n;i++)
prim[i]=1;
for(int i=2;i<=n;i++){
if(prim[i]){
nr++;
for(int j=i;j<=n;j+=i)
prim[j]=0;
}
}
fout<<nr;
}
