Cod sursa(job #2280272)
| Utilizator | Data | 10 noiembrie 2018 13:13:09 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.69 kb |
#include <iostream>
#include <fstream>
using namespace std;
int isprim_neoptim(int a)
{
int k = 0;
for (int i = 1; i <= a; ++i)
{
if (a % i == 0)
{
k++;
}
}
if (k == 2)
return 1;
return 0;
}
int isprim(int a)
{
for (int i = 2; i*i <= a; i++)
{
if (a % i == 0)
{
return 0;
}
}
return 1;
}
int main()
{
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n, x=0;
fin >> n;
for (int i=1; i<=n; i++)
{
if ( isprim (i))
{
x++;
}
}
fout <<x<<endl;
return 0;
}
