Model Solution of GEEK02

geek02.cpp

#include <bits/stdc++.h>
using namespace std;

int main() {
	ios_base::sync_with_stdio(false);
	int t, n;
	cin >> t;
	assert(1 <= t && t <= 100);
	while(t--) {
		cin >> n;
		assert(0 <= n && n <= 10000);
		if (n == 0) {
			cout << "0\n";
			continue;
		}
		if (n % 9 != 0) {
			cout << (n % 9);
		}
		for(int i = 1; i <= (n/9); ++i) {
			cout << "9";
		}
		for(int i = 1; i <= n; ++i) {
			cout << "0";
		}
		cout << "\n";
	}
	return 0;
}