Cod sursa(job #1640842)
Utilizator | Data | 8 martie 2016 19:36:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <cmath>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int N, Nr;
int prim(int N)
{
for(int i = 2; i <= sqrt(N); i++)
if(N % i == 0)
return 0;
return 1;
}
int main()
{
fin>>N;
for(int i = 2; i<=N; i++)
if(prim(i))
Nr++;
fout<<Nr<<"\n";
return 0;
}