Cod sursa(job #1037529)
Utilizator | Data | 20 noiembrie 2013 12:42:00 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream>
#include<cmath>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,r,nr,ok,j;
int v[20000000];
int main(){
fin>>n;
nr=0;
for(i=2;i<=n;i++){
if(v[i]==0){
nr++;
for(j=i+i;j<=n;j+=i)
v[j]=1;
}
}
fout<<nr;
return 0;
}