Cod sursa(job #1126379)
Utilizator | Data | 26 februarie 2014 22:56:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<stdio.h>
#include<stdlib.h>
unsigned long n,j,i,q=1; bool a[2000000];
int main()
{
FILE*f=fopen("ciur.in", "rb");
fscanf(f,"%lu",&n); fclose(f);
FILE*g=fopen("ciur.out","wb");
for(i=3;i<=n;i+=2)
if(a[i]==0)
{
for(j=3;j<=n;j+=2) a[j*i]=1;
q++;
}
fprintf(g,"%lu",q);
fclose(g);
return 0;
}