Cod sursa(job #1742283)
Utilizator | Data | 16 august 2016 10:04:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{ int n,d,nd,cate,i;
f>>n;
cate=0;
for(i=2;i<=n;i++){
nd=0;
for(d=2;d<=sqrt(i);d++)
if(i%d==0)
nd++;
if(nd==0)
cate++;
}
g<<cate;
return 0;
}