AtCoder Beginner Contest 137
翻译中…
Problem Statement
翻译中…
There are $2000001$ stones placed on a number line. The coordinates of these stones are $-1000000, -999999, -999998, \ldots, 999999, 1000000$.
翻译中…
Among them, some $K$ consecutive stones are painted black, and the others are painted white.
翻译中…
Additionally, we know that the stone at coordinate $X$ is painted black.
翻译中…
Print all coordinates that potentially contain a stone painted black, in ascending order.
翻译中…
Constraints
翻译中…
$1 \leq K \leq 100$$0 \leq X \leq 100$- All values in input are integers.
翻译中…
Input
翻译中…
Input is given from Standard Input in the following format:
翻译中…
K X翻译中…
Output
翻译中…
Print all coordinates that potentially contain a stone painted black, in ascending order, with spaces in between.
翻译中…
样例
Input #1
3 7
Output #1
5 6 7 8 9
We know that there are three stones painted black, and the stone at coordinate $7$ is painted black. There are three possible cases:
- The three stones painted black are placed at coordinates $5$, $6$, and $7$.
- The three stones painted black are placed at coordinates $6$, $7$, and $8$.
- The three stones painted black are placed at coordinates $7$, $8$, and $9$.
Thus, five coordinates potentially contain a stone painted black: $5$, $6$, $7$, $8$, and $9$.
Input #2
4 0
Output #2
-3 -2 -1 0 1 2 3
Negative coordinates can also contain a stone painted black.
Input #3
1 100
Output #3
100
题目信息
题面与样例版权归 AtCoder 及出题人所有；中文翻译由 AI 生成（CI 管线），如有出入请以原文为准。