比赛F-F Perpetuum Mobile

比赛F-F     Perpetuum Mobile

 

题目链接：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=86640#problem/F

 

题目：

Description

standard input/output Statements

The world famous scientist Innokentiy almost finished the creation of perpetuum mobile. Its main part is the energy generator which allows the other mobile's parts work. The generator consists of two long parallel plates with n lasers on one of them and n receivers on another. The generator is considered to be working if each laser emits the beam to some receiver such that exactly one beam is emitted to each receiver.

It is obvious that some beams emitted by distinct lasers can intersect. If two beams intersect each other, one joule of energy is released per second because of the interaction of the beams. So the more beams intersect, the more energy is released. Innokentiy noticed that if the energy generator releases exactly k joules per second, the perpetuum mobile will work up to 10 times longer. The scientist can direct any laser at any receiver, but he hasn't thought of such a construction that will give exactly the required amount of energy yet. You should help the scientist to tune up the generator.

Input

The only line contains two integers n and k (1 ≤ n ≤ 200000, ) separated by space — the number of lasers in the energy generator and the power of the generator Innokentiy wants to reach.

Output

Output n integers separated by spaces. i-th number should be equal to the number of receiver which the i-th laser should be directed at. Both lasers and receivers are numbered from 1 to n. It is guaranteed that the solution exists. If there are several solutions, you can output any of them.

Sample Input

 

Input

4 5

Output

4 2 3 1

Input

5 7

Output

4 2 5 3 1

Input

6 0

Output

1 2 3 4 5 6

 

题意： 

已知逆序数为k 的序列,求可能序列的情况（只需输出一种即可）。

 

分析：

观察输入输出可以发现K恰好等于输出序列的逆序数

 

代码：

#include<cstdio>
#include<iostream>
using namespace std;

int main()
{
    int n;
    long long k;
    while(scanf("%d%I64d",&n,&k)!=EOF)
    {
        int p=1,q=n;
        for(int i=1;i<=n;i++)
        {
            if(k>=n-i) //从n开始输出
            {
                printf("%d ",q--);
                k-=n-i;
            }
            else  //不存在逆序数按正序输出
            {
                printf("%d ",p++);
            }
        }
        printf("\n");
    }
    return 0;
}

比赛的时候没有看懂输入输出的关系，听了汇报之后就明白了。