Cod sursa(job #1058364)
Utilizator | Data | 15 decembrie 2013 14:23:31 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int n,i,d,flag,q=2;
int main()
{
FILE * f; f=fopen("ciur.in","r"); FILE * g; g=fopen("ciur.out","w");
fscanf(f,"%d",&n);
for(i=3;i<=n;i+=2)
{
for(d=3;d<=i;d+=3)
if(i%d==0) flag=0;
else flag =1;
if(flag==1) q++;
}
fprintf(g,"%d",q);
fclose(f); fclose(g);
return 0;
}