199-k-lcm-hard-version.cpp

/*
 * k-LCM (hard version)  [1497C2]
 * Problem:  https://codeforces.com/problemset/problem/1497/C2
 * Verdict:  ACCEPTED        Solved: 2021-03-22
 * Language: C++17 (GCC 7-32)
 * Runtime:  31 ms     Memory: 0 KB
 * Tags:     constructive algorithms, math
 * Author:   BidoTeima
 * Source:   https://codeforces.com/contest/1497/submission/110756583
 */

#include "bits/stdc++.h"
 
using namespace std;
using ll = long long;
 
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin >> t;
    while (t--) {
        ll n, k;
        cin >> n >> k;
        {
            while (k-- > 3) {
                cout << 1 << ' ';
                --n;
            }
            if (n % 4 == 0) {
                //cout << "case 1\n";
                cout << (n / 4) << ' ' << (n / 4) << ' ' << n / 2 << '\n';
            }
            else if (n % 2 == 0) {
                //cout << "case 2\n";
                cout << (n / 2) - 1 << ' ' << (n / 2) - 1 << ' ' << 2 << '\n';
            }
            else {
                //cout << "case 3\n";
                cout << n / 2 << ' ' << n / 2 << ' ' << 1 << '\n';
            }
        }
    }
    return 0;
}