Cod sursa(job #1662059)
Utilizator | Data | 24 martie 2016 14:12:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream>
#include <cmath>
using namespace std;
int nc, i, j,n,ok;
int main()
{ifstream f("ciur.in");
ofstream g("ciur.out");
nc=1; f>>n;
for(i=3; i<=n; i=i+2)
{
j=2; ok=1;
while(j<=sqrt(i) && ok==1)
if(i % j==0)ok=0;
else
j++;
if(ok==1)
nc++;
}
g<<nc;
return 0;
}