思路:
- 题意:将n*m个口罩分装到经量少的盒子,使得既能均分成n份又能均分成m份。
- 设m <= n,则前m个答案必定为m个m,大了分不了,小了又非最优,再继续考虑后n - m个和m个。
- 还发现了 dfs做法 和 gcd的辗转相除思路。
代码实现:
#include<bits/stdc++.h>
#define endl '\n'
#define null NULL
#define ll long long
#define int long long
#define pii pair<int, int>
#define lowbit(x) (x &(-x))
#define ls(x) x<<1
#define rs(x) (x<<1+1)
#define me(ar) memset(ar, 0, sizeof ar)
#define mem(ar,num) memset(ar, num, sizeof ar)
#define rp(i, n) for(int i = 0, i < n; i ++)
#define rep(i, a, n) for(int i = a; i <= n; i ++)
#define pre(i, n, a) for(int i = n; i >= a; i --)
#define IOS ios::sync_with_stdio(0); cin.tie(0);cout.tie(0);
const int way[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
using namespace std;
const int inf = 0x7fffffff;
const double PI = acos(-1.0);
const double eps = 1e-6;
const ll mod = 1e9 + 7;
const int N = 2e5 + 5;
int t, n, m, a[N];
signed main()
{
IOS;
cin >> t;
while(t --){
cin >> n >> m;
int cnt = 0;
while(n && m){
if(n < m) swap(n, m);
for(int i = 1; i <= m; i ++) a[++ cnt] = m;
n -= m;
}
cout << cnt << endl;
for(int i = 1; i <= cnt; i ++) cout << a[i] << (i == cnt ? '\n' : ' ');
}
return 0;
}