1714C - Minimum Varied Number.cpp

/** ========================================**
 ** @Author: Kareem Taha Abdelfatah
 ** @Category: Codeforces problems solutions
/** ========================================**/

#include<bits/stdc++.h>
using namespace std;
#define IO                  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define endll               "\n"
#define ll                  long long
#define fr(i, n)            for(ll i = 0; i < n; i++)
#define fr1(i, n)           for(ll i = 1; i <= n; i++)
#define asort(a)            sort(a + 1, a + n + 1)
#define dsort(a)            sort(a + 1, a + n + 1, greater<int>())
const long long N = 2e5 + 5, MOD = 1e9 + 7, oo = 1e18;
const double PI = 3.14;
const double Prox = 1e-7;

ll a[N], b[N] ,q[N], s[N], w[N], xy[N], l, r, v, x, y, j;
string a1[N], b1[N];
map<ll, ll>mp, mk;
set<ll>st;
pair<int, int> arr[N];

struct point{
    int x;
    int y;
};

// true (not swap).
// false (swap).
bool cmp(point a, point b){
    if(a.x == b.x){
        return a.y < b.y;
    }
    else return a.x < b.x;
};


int main()
{
    IO
    ll Tc; cin >> Tc;
    while(Tc--){
        deque<int>dq;
        dq.clear();
        int s, cnt = 0; cin >> s;
        if(s >= 10){
            for(int i = 9; i > 0; i--){
                if(i + cnt < s){
                    cnt += i;
                    dq.push_front(i);
                }
                else if(i + cnt == s){
                    cnt += i;
                    dq.push_front(i);
                    break;
                }
            }
        }
        else{
            for(int i = s; i > 0; i--){
                if(i + cnt < s){
                    cnt += i;
                    dq.push_front(i);
                }
                else if(i + cnt == s){
                    cnt += i;
                    dq.push_front(i);
                    break;
                }
            }
        }
        deque<int>::iterator it;
        for(it = dq.begin(); it < dq.end(); it++) cout << *it;
        cout << endll;
    }
    return 0;
}