arc173-1.cpp

#include <bits/stdc++.h>
using namespace std;
#define int long long
int a[15], sum[15];

int ii = 1;
const int maxn = 1e12 + 1;
void init()
{
    a[1] = sum[1] = 9;
    int cnt = 81;
    while (ii <= 14)
    {
        ii++;
        a[ii] = cnt;
        sum[ii] = cnt;
        cnt *= 9;
        sum[ii] += sum[ii - 1];
    }
}
void solve()
{
    int k;
    cin >> k;
    int size = lower_bound(sum + 1, sum + 15, k) - sum;
    k -= sum[size - 1];
    int used = 0;
    int d = pow(9, size - 1);
    int tar = 1;
    for (int i = size - 1; i >= 0; i--)
    {
        int cnt = 1;
        int t = (k / d);
        if (k%d==0)
            t--;
        if (tar > used || tar + t < used)
            tar += t;
        else
            tar += (t + 1);
        cout << tar;
        used = tar;
        tar = 0;
        k -= t * d;
        d /= 9;
    }
    cout << endl;
    return;
}
signed main()
{
    init();
    int t;
    cin >> t;
    while (t--)
    {
        solve();
    }
    system("pause");
    return 0;
}