Cod sursa(job #1553225)
| Utilizator | Data | 19 decembrie 2015 13:57:53 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
int i, n;
int ciur(int a){
int d;
if(a==1)
return 0;
for(d=2;d*d<=a;d++)
if(a%d==0) {
return 0;
}
return 1;
}
int main () {
ifstream fin ("ciur.in");
ofstream fout("ciur.out");
fin>>n;
int nr=0;
for (i=1;i<=n;i++)
if (ciur(i) == 1)
nr++;
fout<<nr;
return 0;
}
