Cod sursa(job #1037461)
Utilizator | Data | 20 noiembrie 2013 11:48:25 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<fstream>
#include<cmath>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,r,nr,ok,j;
int main(){
fin>>n;
nr=0;
for(i=2;i<=n;i++){
r=sqrt(i*1.0);
j=2;
ok=0;
while(j<=r){
if(i%j==0){
ok=1;
break;
}
j++;
}
if(ok==0)
nr++;
}
fout<<nr;
return 0;
}