Cod sursa(job #163555)
Utilizator | Data | 22 martie 2008 14:46:41 | |
---|---|---|---|
Problema | Sortare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | preONI 2008, Runda Finala, Clasele 11-12 | Marime | 0.54 kb |
#include <stdio.h>
long i, n, a[5010], b[5010], c[5010], puteri[] = {1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192};
int main()
{
freopen ("sortare.in", "rt", stdin);
freopen ("sortare.out", "wt", stdout);
scanf("%ld", &n);
for (i = 1; i <= n; ++i)
scanf("%ld %ld %ld", &a[i], &b[i], &c[i]);
i = 0;
while (puteri[i] <= n)
++i;
printf("%ld\n", i);
for (i = 1; i <= n; ++i)
printf("%ld ", i);
printf("\n");
return 0;
}