Cod sursa(job #2241213)
Utilizator | Data | 15 septembrie 2018 12:26:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int prim(int x)
{
if(x<2) return 0;
else
{
int d=2,ok=1;
while(ok==1 and d*d<=x)
{
if(x%d==0) ok=0;
d++;
}
if(ok==1) return 1;
else return 0;
}
}
int main()
{
int n,i,nr=0;
cin>>n;
for(i=n;i>=1;i--)
if(prim(i)==1) nr++;
cout<<nr;
}