Cod sursa(job #900951)
Utilizator | Dumitrana Bogdan bdumitrana | Data | 28 februarie 2013 23:00:52 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int prim(int x)
{
int ct=0,i;
for(i=1;i<=x;i++)
{
if(x%i==0)
ct++;
if(ct>=3)
return 0;
}
return 1;
}
int main()
{
int i,ct=0,n;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
if(prim(2)==1)
ct++;
for(i=3;i<=n;i++)
{
if(prim(i)==1)
ct++;
}
printf("%d",ct);
return 0;
}