Cod sursa(job #1719986)
Utilizator | Data | 20 iunie 2016 20:16:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<iostream>
#include<fstream>
using namespace std;
int nrprim(int x)
{
for(int i=2;i<=x/2;i++)
if(x%i==0)
return 0;
return 1;
}
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int k=0,n;
f>>n;
for(int i=2;i<=n;i++)
if(nrprim(i)==1)
k++;
g<<k;
f.close();
g.close();
}