Cod sursa(job #1483911)
Utilizator | Data | 10 septembrie 2015 09:29:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <stdio.h>
int n, k;
int a[100];
void main()
{
int i, j;
int cop[100];
printf("%d", &n);
scanf("%d", &n);
for (i = 2; i <= n; ++i)
a[i] = 1;
for (i = 2; i <= n; ++i)
if (a[i]==1)
{
k++;
cop[k] = i;
for (j = i + i; j <= n; j += i)
a[j] = 0;
}
for (i = 1; i <= k; i++)
{
printf("%d ", cop[i]);
}
printf("Sunt %d numere prime.\n", k);
}