200708

[lsy0314]

https://level.goorm.io/exam/43064/binary-search/quiz/1

#include <stdio.h>
int main()
{
int t, n[10000], k[10000], data[1000] = { 0, }, num, p = 0;
scanf("%d", &t);
for (int i = 0; i < t; i++) {
scanf("%d %d", &n[i], &k[i]);
}
for (int i = 0; i < t; i++) {
int data[1000] = { 0, };
num = 1;
p = 0;
for (int j = 0; j < n[i]; j++) {
for (int z = 0; z < k[i]; z++) {
if (p == 0) { //순서대로
data[z] = data[z] + num;
num++;
}
else { //역순
data[k[i] - z - 1] = data[k[i] - z - 1] + num;
num++;
}
}
if (p == 0)
p = 1;
else
p = 0;
}
printf("#%d", i + 1);
for (int d = 0; d < k[i]; d++) {
printf(" %d", data[d]);
}
printf(" \n");
}
}