提出 #75912172

---

ソースコード 拡げる

#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define eb emplace_back
#define VI vector<int>
#define VII vector<pii>
#define VL vector<ll>
#define VLL vector<pll>
#define rep(i,l,r) for(int i=(l);i<=(r);++i)
#define per(i,r,l) for(int i=(r);i>=(l);--i)

#define LOCAL false

using namespace std;
bool st;
const bool MUL=true;

void clr(){
	return;
}
void solve(){
	int n;cin>>n;
	if(n==1){cout<<"Yes\n1\n";return;}
	if(n==2||n==3||n==5){cout<<"No\n";return;}
	cout<<"Yes\n";
	priority_queue<int,VI,greater<int>>q;
	if(n%3==1)rep(i,1,4)q.push(2);
	else if(n%3==0){rep(i,1,3)q.push(2);rep(i,1,2)q.push(3);q.push(6);}
	else{rep(i,1,3)q.push(2);rep(i,1,2)q.push(3);rep(i,1,2)q.push(9);q.push(18);}
	int k=(n-q.size())/3;
	rep(i,1,k){int x=q.top();q.pop();rep(j,1,4)q.push(x<<1);}
	bool f=0;while(q.size()){if(f)cout<<" ";cout<<q.top();q.pop();f=1;}
	cout<<"\n";return; 
}

bool ed;
signed main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int tc=1;if(MUL){cin>>tc;}while(tc--)clr(),solve();
	cerr<<"time:"<<clock()<<"ms.\n";
	cerr<<fixed<<setprecision(4)<<"memory:"<<(1.0*(&st-&ed)/1048576.0)<<"MB.\n";
	return 0;
}

提出情報

ジャッジ結果