Cod sursa(job #2230617)
Utilizator | Data | 10 august 2018 19:32:08 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int isprim(int n)
{
int prim=1,i;
for(i=2; i<=sqrt(n); i++)
{
if(n%i==0) prim=0;
}
return prim;
}
int main()
{
int nrprime=0,nr,i;
fin>>nr;
for(i=2; i<=nr; i++)
{
if(isprim(i))
{nrprime++;
}
}
fout<<nrprime;
return 0;
}