Cod sursa(job #1213797)
Utilizator | Data | 28 iulie 2014 23:29:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,v[2000008],nr;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main(){
fin>>n;
for(int i=2;i<=n;++i){
if(v[i]==0){
nr++;
for(int j=2;j<=n/i;++j){
v[i*j]=1;
}
}
}
fout<<nr;
return 0;
}