Cod sursa(job #1326327)
Utilizator | Data | 25 ianuarie 2015 10:32:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool prim(int x,int i)
{
if(x==0 || x==1)
return 0;
else if(i*i<=x)
{
if(x%i==0)
return 0;
prim(x,i+1);
}
else
return 1;
}
int main()
{
int n;
f>>n;
int ct=1;
if(n%2==0)
n--;
for(int i=3; i<=n; i+=2)
if(prim(i,2)==1)
ct++;
g<<ct;
}