QOJ.ac

QOJ

Time Limit: 1 s Memory Limit: 512 MB Total points: 100

#12381. 玩游戏

统计

ljcc 和他的学妹在玩游戏,这个游戏共有 $n$ 轮,在第 $i$ 轮获胜会获得 $i$ 分,没有平局。

现在给出 ljcc 和学妹的得分,求是否有一种方案符合当前得分。

输入格式

从标准输入读入数据。

输入一行输入两个数 $a,b$ 代表 ljcc 和学妹的得分。

输出格式

输出到标准输出。

若有解,在一行输出一组合法的解。第一个数代表游戏总共进行了 $n$ 轮,之后若干个数表示 ljcc 在哪些局获胜了,每两个数用单个空格隔开,行末不允许有空格。若没有合法解输出 No

样例数据

样例 1 输入

10 5

样例 1 输出

5 1 2 3 4

子任务

$a,b\le 2^{31}-1,1\le n\le 10^5$

Discussions

About Discussions

The discussion section is only for posting: Editorials, General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues. Submitting multiple issues may cause your account to be banned.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.