CF1790B.Taisia and Dice
入门
通过率：0%
AC君温馨提醒
该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。
题目描述
Taisia has n six-sided dice. Each face of the die is marked with a number from 1 to 6, each number from 1 to 6 is used once.
Taisia rolls all n dice at the same time and gets a sequence of values a1,a2,…,an (1≤ai≤6), where ai is the value on the upper face of the i-th dice. The sum of this sequence is equal to s.
Suddenly, Taisia's pet cat steals exactly one dice with maximum value ai and calculates the sum of the values on the remaining n−1 dice, which is equal to r.
You only know the number of dice n and the values of s, r. Restore a possible sequence a that fulfills the constraints.
输入格式
The first line contains the integer t (1≤t≤1000) — the number of testcases.
Each testcase is given on a separate line and contains three integers n, s, r (2≤n≤50, 1≤r<s≤300).
It is guaranteed that a solution exists.
输出格式
For each testcase, print: n integers a1,a2,…,an in any order. It is guaranteed that such sequence exists.
If there are multiple solutions, print any.
输入输出样例
输入#1
7 2 2 1 2 4 2 4 9 5 5 17 11 3 15 10 4 4 3 5 20 15
输出#1
1 1 2 2 1 2 2 4 6 4 2 3 2 5 5 5 1 1 1 1 1 4 5 5 5
输入解题思路，AI测评打分。不知道怎么写?