CF1355D.Game With Array

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

Petya and Vasya are competing with each other in a new interesting game as they always do.

At the beginning of the game Petya has to come up with an array of $N$ positive integers. Sum of all elements in his array should be equal to $S$ . Then Petya has to select an integer $K$ such that $0 \leq K \leq S$ .

In order to win, Vasya has to find a non-empty subarray in Petya's array such that the sum of all selected elements equals to either $K$ or $S - K$ . Otherwise Vasya loses.

You are given integers $N$ and $S$ . You should determine if Petya can win, considering Vasya plays optimally. If Petya can win, help him to do that.

输入格式

The first line contains two integers $N$ and $S$ ( $1 \leq N \leq S \leq 10^{6}$ ) — the required length of the array and the required sum of its elements.

输出格式

If Petya can win, print "YES" (without quotes) in the first line. Then print Petya's array in the second line. The array should contain $N$ positive integers with sum equal to $S$ . In the third line print $K$ . If there are many correct answers, you can print any of them.

If Petya can't win, print "NO" (without quotes).

You can print each letter in any register (lowercase or uppercase).

输入输出样例

输入#1
```
1 4
```
输出#1
```
YES
4
2
```
输入#2
```
3 4
```
输出#2
```
NO
```
输入#3
```
3 8
```
输出#3
```
YES
2 1 5
4
```

首页