Cod sursa(job #1807622)
Utilizator | Data | 16 noiembrie 2016 19:27:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int prim(int x)
{
if(x<2)
return 0;
if(x%2==0 && x!=2)
return 0;
for(int d=3;d*d<=x;d+=2)
if(x%d==0)
return 0;
return 1;
}
int main()
{
int n,i,cont=0;
fin>>n;
for(i=2;i<=n;++i)
if(prim(i)==1)
cont++;
fout<<cont;
return 0;
}