Cod sursa(job #271362)
| Utilizator |  Alex Chindea al3x3 |
Data | 5 martie 2009 10:43:25 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.33 kb |
#include <stdio.h>
#include <math.h>
long i, j, n, k=0;
int main()
{
FILE *f=fopen("ciur.in", "r");
fscanf(f, "%ld", &n);
fclose(f);
if(n>=2) k=1;
for(i=3;i<=n;i+=2)
{
j=3;
while((j<=sqrt(i))&&(i%j!=0)) j+=2;
if(i%j!=0) k++;
}
f=fopen("ciur.out", "w");
fprintf(f, "%ld", k+1);
fclose(f);
return 0;
}