Mai intai trebuie sa te autentifici.
Cod sursa(job #597407)
| Utilizator | Data | 22 iunie 2011 01:01:38 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <stdio.h>
#include <math.h>
int prim(int a)
{
int i,ra;
ra = (int) sqrt(a);
for(i=0;i<=ra;i++)
if(a%i == 0) return 0;
return 1;
}
int main(void)
{
unsigned int i,c=1, N;
freopen("ciur.in","r",stdin);
scanf("%d",&N);
fclose(stdin);
for(i=3;i<=N;i+=2)
if(prim(i)) c++;
freopen("ciur.out","w",stdout);
printf("%d",c);
fclose(stdout);
return 0;
}
