Ural1521-War Games 2

#include <cstdio>
#include <vector>

using namespace std;

const int maxn = 100000+5;

int fw[maxn];

int n, k;

inline int lowbit(int x) {
return x & -x;
}

void add(int x, int delta) {
for (int i = x; i <= n; i += lowbit(i)) {
fw[i] += delta;
}
}

int sum(int x) {
int ret = 0;
for (int i = x; i > 0; i -= lowbit(i)) {
ret += fw[i];
}
return ret;
}

int search(int x) {
int lb = 1, ub = n;
while (lb < ub) {
int mid = (lb + ub) / 2;
if (sum(mid) >= x) {
ub = mid;
} else {
lb = mid + 1;
}
}
return ub;
}

vector<int> v;

int main(int argc, char const *argv[]) {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
add(i, 1);
}
int cur = 1;
for (int i = n; i >= 1; i--) {
cur = (cur + k - 1) % i;
if (cur == 0) {
cur = i;
}
int x = search(cur);
v.push_back(x);
add(x, -1);
}
for (int i = 0; i < v.size(); i++) {
if (i) {
putchar(' ');
}
printf("%d", v[i]);
}
putchar('\n');
return 0;
}