-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathD.cpp
88 lines (79 loc) · 2.11 KB
/
D.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(v) v.begin(),v.end()
#define X first
#define Y second
#define Len(x) (static_cast<int>(x.size()))
/* <not-serious> */
template<typename T>
class number_iterator : iterator<forward_iterator_tag, T> {
public:
number_iterator(T _v) : v(_v), step(1) {}
number_iterator(T _v, T _step) : v(_v), step(_step) {}
operator T &() { return v; }
T operator*() const { return v; }
number_iterator operator++() {
v += step;
return *this;
}
bool operator!=(number_iterator rhs) {
return step > 0 ? v < rhs.v : v > rhs.v;
}
private:
T v, step;
};
template<typename T = int>
class range : pair<T, T> {
public:
using ptt = pair<T, T>;
range(T begin, T end) : ptt(begin, max(begin, end)), step(1) {}
range(T end) : ptt(0, max<T>(0, end)), step(1) {}
range(T begin, T end, T _step) :
ptt(begin, _end(begin, end, _step)), step(_step) {}
number_iterator<T> begin() const {
return number_iterator<T>(this->first, step);
}
number_iterator<T> end() const {
return number_iterator<T>(this->second, step);
}
private:
T step;
T _end(T begin, T end, T _step) {
return _step > 0 ? max(begin, end) : min(begin, end - 1);
}
};
template<typename T = int>
class rrange : public range<T> {
public:
rrange(T end, T begin) : range<T>(end, begin, -1) {}
rrange(T end) : range<T>(end, 0, -1) {}
};
template<class T = int, class... Args>
auto vec(size_t n, Args &&... args) {
if constexpr(sizeof...(args) == 1)
return vector<T>(n, T(args...));
else
return vector(n, vec<T>(args...));
}
/* </not-serious> */
int constexpr MOD = 1e9 + 7;
ll constexpr INF = 1e9;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, s;
cin >> n >> s;
if (n > s / 2) return cout << "NO\n", 0;
cout << "YES\n";
vector<int> a;
int sn = 0;
while (a.size() < n - 1) {
a.emplace_back(2);
sn += 2;
}
a.emplace_back(s - sn);
for (auto i : a) cout << i << ' ';
cout << "\n1";
return 0;
}