https://codeforces.com/contest/1095/problem/C

题解：贪心

一直往大了塞就行了

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=200000+1000;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q;
ll a[64];
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    a[0]=1;
    for(int i=1;i<40;i++){
        a[i]=a[i-1]*2;
    }
    scanf("%d%d",&n,&k);
    t=n;
    if(n==0&&k==0){
        cout << "YES" << endl;
        return 0;
    }
    if(n<k){
        cout << "NO" << endl;
        return 0;
    }
    stack<ll>st;
    int sum=0;
    for(int i=32;i>=0;i--){
        while(a[i]<=n&&k-1<=n-a[i]&&n&&k){//保证在这个数减掉以后接下来的k-1个数至少为1
            st.push(a[i]);
            sum+=a[i];
            k--;
            n-=a[i];
        }
    }
    if(sum!=t){
        cout << "NO" << endl;
        return 0;
    }
    cout << "YES" << endl;
    while(!st.empty()){
        cout <<st.top() << " ";
        st.pop();
    }
    //cout << "Hello world!" << endl;
    return 0;
}