1157D - N Problems During K Days - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define F first
#define S second
#define infile freopen("file.in" , "r", stdin) ;
#define G vector<vector<int>>
#define speed ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int dir [5] = { -1, 0, 1, 0 ,-1 };
ll nCr( int n , int r )
{
    ll ans =1;
    r = min(r, n-r );
    for(int i = 0 ;i< r ;++i )
        ans *= (n-i) , ans /= (i+1) ;
    return ans ;
}
int main()
{
    speed
    int t = 1;
//    cin >> t ;
    while(t--)
    {
        ll n , k ;
        cin >>n >> k;
        if ( k == 1 )
            return cout <<"YES\n" << n ,0;
        vector<int>v(k);
        iota(v.begin(),v.end(),1);
        n -= k*(k+1)/2 ;
        if ( n < 0 ) cout <<"NO" ;
        else
        {
            for ( int i =0 ; i < k - n%k ; ++i )
                v[i] += n/k;
            for(int i = k-1 ; i >= k-n%k ;--i )
                v[i] += (n+k-1)/k;
            if ( n == k-1 )
            {
                if ( k <= 3 ) return cout <<"NO",0;
                --v[1] ;
                ++v[k-1];
            }
            cout <<"YES\n";
            for(auto it : v) cout << it <<" ";
        }
    }
    return 0;
}