Cod sursa(job #2631265)
Utilizator | Data | 29 iunie 2020 16:58:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
int prim (int x)
{
int k=0;
for (int i=1; i<=x/2; i++)
{
if (x%i==0)
k++;
}
if (k==1)
return 1;
return 0;
}
int main()
{
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n;
fin >> n;
int k=0;
for (int i=2; i<n; i++)
{
if (prim(i)==1)
k++;
}
fout << k;
return 0;
}