Cod sursa(job #1846588)
Utilizator | Data | 13 ianuarie 2017 15:47:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
#include <math.h>
using namespace std;
bool prim (int n)
{
int p;
p=sqrt(n);
for (int i=2;i<=p;i++)
{
if (n%i==0)
return false;
}
return true;
}
int main()
{
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n,j=0;
fin>>n;
for (int i=2;i<=n;i++)
{
if (prim(i))
j++;
if (i>=3)
i++;
}
fout<<j;
return 0;
}