Cod sursa(job #1807521)
Utilizator | Data | 16 noiembrie 2016 17:56:53 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
int prim (int n)
{
int ok=1,p;
p=n/2;
for (int i=2;i<=p;i++)
{
if (n%i==0)
{
ok=0;
break;
}
}
if (ok==1)
return 1;
else return 0;
}
int main()
{
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n,m,j=0;
fin>>n;
for (int i=2;i<n;i++)
{
m=prim(i);
if (m==1)
j++;
}
fout<<j;
return 0;
}