传送门
题意
给定 n , s n,s n,s,将 s s s拆成 n n n个数,这些数的和等于 s s s,并且他们按照 11 11 11进制计算下,和最大
分析
如果我们把
10
10
10拆成
9
+
1
9 + 1
9+1,会发现损失了1
所以,我们要尽可能的把
s
s
s在高位的时候进行拆解成
10
10
10的整数次幂,如果不够的话,就用
1
1
1占位
代码
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int val,n;
int main() {
int T;
read(T);
while(T--){
read(val),read(n);
for(int i = 1;i < n;i++){
int x = pow(10,(int)log10(val - (n - i)));
printf("%d ",x);
val -= x;
}
printf("%d\n",val);
}
return 0;
}