codeforces round 742D

题目链接：https://codeforces.com/contest/1567/problem/D

思路：通过手动模拟几组样例可以发现，十进制转化成十一进制，再做加法时进位比较亏，比如98₁₁ + 12₁₁ = AA₁₁，而100₁₁ + 10₁₁ = 110₁₁，所以本题我们尽量将它拆成10的幂，防止进位。

ac代码：

// Problem: D. Expression Evaluation Error
// Contest: Codeforces - Codeforces Round #742 (Div. 2)
// URL: https://codeforces.com/contest/1567/problem/D
// Memory Limit: 256 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>

using namespace std;

const int N = 10010;

typedef long long LL;

int t;

int n,s;

int main(){
	ios::sync_with_stdio(false);
	cin >> t;
	while(t--){
		cin >> s >> n;
		int tmp = s;
		for(int i = 1;i < n;i++){
			int j = pow(10,(int)log10(tmp - (n - i)));
			cout << j << " ",tmp-=j;
		}
		cout << tmp << endl;
	}
	return 0;
}