Submission

Score: 100

User: Imorange

Problemset: เลขฐานเบญจภาคได้ดุล

Language: cpp

Time: 0.005 second

Submitted On: 2026-10-12 23:27:19

#include <bits/stdc++.h>

using namespace std;
#define int long long

void solve()
{
	int n;
	cin >> n;
	int tag = 0, sign = 1;
	if(n == 0){
		cout << 0 << '\n';
		return;
	}
	if(n<0){
		sign = -1;
		n = -n;
	}	
	while(n>0)
	{
		int d = n%5+tag;
		if (d < 3){
			cout << sign*d << ' ';
			tag = 0;
		}else{
			cout << -sign * (5-d) << ' ';
			tag = 1;
		}
		n/=5;
	}
	if(tag > 0) cout << sign*tag;
	cout << '\n';

}
int32_t main()
{
	cin.tie(nullptr)->sync_with_stdio(false);
	int t;
	cin >> t;
	while(t--) solve();
}