Cod sursa(job #1461792)
Utilizator | Data | 16 iulie 2015 15:00:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
int prim (int x)
{
int i;
for (i=2; i<=x; i++)
if (x%i == 0)
return 1;
return 0;
}
int n, i, nr;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f >> n;
for (i=2; i<=n; i++)
if (prim(i) == 1)
nr++;
g << nr;
return 0;
}