Cod sursa(job #2154056)
Utilizator | Data | 6 martie 2018 17:52:19 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream g ("ciur.in");
ofstream h("ciur.out");
int prim (int n)
{
int d,i,c=0;
if (n>=4)
{
for (i=2;i*i<=n;i++)
{
if (n%i==0)
c=1;
}
}
return c;
}
int main()
{ int n,cnt=0,i;
g>>n;
for (i=2;i<=n;i++)
{
if (prim (i)==0)
cnt++;
}
h<<cnt;
return 0;
}