Description
Input
整個測試以-1 -1代表結束。
Output
Sample Input
5 9
7 3
-1 -1
Sample Output
4 5 3 2 1
1 2 3 4 7 6 5
HINT
Source
#include<cstdio>
using namespace std;
const int MAX_LEN = 50000;
int ans[MAX_LEN];
void print_ans(int n, int m) {
int i = 2;
while (i <= n && i * (i - 1) / 2 <= m)
i++;
i--;
int k = n + 1 - i;
int lt = m - i * (i - 1) / 2;
int pos = 0;
for (int w = 1; w < k - 1; w++, pos++)
ans[pos] = w;
ans[pos++] = k - 1 + lt;
for (int w = n; w >= k - 1; w--) {
if (w != (k - 1 + lt))
ans[pos++] = w;
}
printf("%d", ans[0]);
for (int w = 1; w < n; w++)
printf(" %d", ans[w]);
}
int main() {
int n, m;
while (true) {
scanf("%d %d", &n, &m);
if (n == -1 && m == -1)
break;
print_ans(n, m);
printf("\n");
}
return 0;
}
/**************************************************************
Problem: 1130
User: xrq
Language: C++
Result: Accepted
Time:16 ms
Memory:1148 kb
****************************************************************/