Cod sursa(job #1296912)
Utilizator | Data | 21 decembrie 2014 16:11:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <stdio.h>
int aparitii[2000005];
int main()
{
FILE *in, *out;
in = fopen("ciur.in", "r");
out = fopen("ciur.out", "w");
int n;
fscanf(in, "%d", &n);
for (int i = 2; i <= n; i++)
{
if(aparitii[i]==0)
{
fprintf(out, "%d ", i);
for (int j = 2 * i; j <= n; j = j + i)
aparitii[j] = 1;
}
}
fclose(in);
fclose(out);
return 0;
}