Pagini recente » Cod sursa (job #1113779) | Cod sursa (job #1111057) | Cod sursa (job #1912465) | Cod sursa (job #586685) | Cod sursa (job #1558247)
#include <stdio.h>
#define aibSize 32768
#define NIL -1
int N;
int aib[aibSize + 1];
/** Adauga valoarea "x" in aib.
* val = 1: inserare.
* val = -1: stergere.
**/
void add(int x, int val) {
do {
aib[x] += val;
x += x & -x;
} while (x <= aibSize);
}
/** Cauta elementul de pe pozitia "val" in aib. **/
int search(int val) {
int x = 0, interval;
for (interval = aibSize >> 1; interval; interval >>= 1) {
if (aib[x + interval] < val) {
val -= aib[x += interval];
}
}
return x + 1;
}
int main(void) {
int i, k, last = 2;
FILE *f = fopen("order.in", "r");
freopen("order.out", "w", stdout);
/* Citirea datelor. */
fscanf(f, "%d", &N);
for (i = 1; i <= N; i++) {
add(i, 1);
}
fclose(f);
/* Calcularea solutiei si afisarea ei. */
int limit = N - 1;
for (i = 0; i < limit; i++) {
fprintf(stdout, "%d ", k = search(last = (last + i) % (N - i)));
add(k, NIL);
}
fprintf(stdout, "%d\n", N);
fclose(stdout);
/// Multumim Doamne!
puts("Doamne ajuta!");
return 0;
}