#P7835. [USACO06FEB] Backward Digit Sums G/S

[USACO06FEB] Backward Digit Sums G/S

Description

# P1118 [USACO06FEB] Backward Digit Sums G/S

题目描述

FJ and his cows enjoy playing a mental game. They write down the numbers from 11 toN(1N10) N(1 \le N \le 10) in a certain order and then sum adjacent numbers to produce a new list with one fewer number. They repeat this until only a single number is left. For example, one instance of the game (when N=4N=4) might go like this:

    3   1   2   4
      4   3   6
        7   9
         16

Behind FJ's back, the cows have started playing a more difficult game, in which they try to determine the starting sequence from only the final total and the number NN. Unfortunately, the game is a bit above FJ's mental arithmetic capabilities.

Write a program to help FJ play the game and keep up with the cows.

输入格式

共一行两个正整数 n,sumn,sum

输出格式

输出包括一行,为字典序最小的那个答案。

当无解的时候,请什么也不输出。

输入输出样例 #1

输入 #1

4 16

输出 #1

3 1 2 4

说明/提示

  • 对于 40%40\% 的数据,1n71\le n\le 7
  • 对于 80%80\% 的数据,1n101\le n \le 10
  • 对于 100%100\% 的数据,1n121\le n \le 121sum123451\le sum\le 12345