Pagini recente » Cod sursa (job #2145299) | Cod sursa (job #629263) | Cod sursa (job #1500747) | Istoria paginii runda/pregatire_oji_11-12/clasament | Cod sursa (job #615834)
Cod sursa(job #615834)
#include <stdio.h>
#include <iostream>
int n, contor;
char prim[2000005];
void main()
{
int i, j;
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &n);
for (i = 2; i <= n; ++i)
{prim[i] = 1;
printf("%d , ",prim[i]);
printf("\n");}
for (i = 2; i <= n; ++i)
if (prim[i])
{
++contor;
for (j = i+i; j <= n; j =j+ i)
prim[j] = 0;
printf("%d ,",prim[j]);
}
printf("%d\n", contor);
}