Cod sursa(job #1150327)
Utilizator | Data | 22 martie 2014 20:57:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <stdio.h>
long n,i,q,d,flag;
int main()
{
FILE*f1,*f2;
f1=fopen("ciur.in","r");
f2=fopen("ciur.out","w");
fscanf(f1,"%ld",&n);
for(i=3;i<=n;i+=2)
{
flag=1;
for(d=3;(d*d<i)&&(flag);d+=2)
if(i%d==0)flag=0;
if(flag)q++;
}
fprintf(f2,"%ld",q);
return 0;
}