-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathA.cpp
52 lines (50 loc) · 1.16 KB
/
A.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
#include <algorithm>
#include <iostream>
#include <cstring>
#include <climits>
#include <cstdlib>
#include <cstdio>
#include <bitset>
#include <vector>
#include <cmath>
#include <ctime>
#include <queue>
#include <stack>
#include <map>
#include <set>
#define fi first
#define se second
#define db double
#define U unsigned
#define P std::pair<int,int>
#define LL long long
#define pb push_back
#define MP std::make_pair
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define FOR(i,a,b) for(int i = a;i <= b;++i)
#define ROF(i,a,b) for(int i = a;i >= b;--i)
#define DEBUG(x) std::cerr << #x << '=' << x << std::endl
int main(){
int T;scanf("%d",&T);
while(T--){
int n;scanf("%d",&n);
if(n <= 6+10+14){
puts("NO");continue;
}
if(n == 36){
puts("YES\n5 6 10 15");
continue;
}
if(n == 40){
puts("YES\n14 15 6 5");
continue;
}
if(n == 44){
puts("YES\n14 15 6 9");
continue;
}
printf("YES\n%d %d %d %d\n",6,10,14,n-6-10-14);
}
return 0;
}