codeforce 851(div2) B.写麻烦了
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define LL long long
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define PII pair<int,int>
#define PLL pair<LL, LL>
#define VVI vector<vector<int>>
#define VI vector<int>
#define lowbit(x) ((x) & -(x))
#define fr front
#define ff first
#define ss second
#define pb push_back
#define PQ priority_queue<int>
int check(int a, int b) {
int sa = 0, sb = 0;
while (a) {
sa += a % 10;
a /= 10;
}
while (b) {
sb += b % 10;
b /= 10;
}
return abs(sa - sb);
}
void solved() {
int n;
cin >> n;
if (n % 2 == 0)
cout << n / 2 << ' ' << n / 2 << '\n';
else {
if (check(n / 2, n / 2 + 1) <= 1)
cout << n / 2 << ' ' << n / 2 + 1 << '\n';
else {
int t = check(n / 2, n / 2 + 1) / 2;
int tem = 1;
int a = n / 2, b = n / 2 + 1;
while (t -- ) {
if (a % (10 * tem) == 0) {
tem *= 10;
}
a -= tem;
b += tem;
}
cout << a << ' ' << b << '\n';
}
}
return ;
}
signed main() {
IOS;
int t;
cin >> t;
while (t -- ) {
solved();
}
return 0;
}