Submission

Score: 100

User: kavin8888

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

Language: cpp

Time: 0.003 second

Submitted On: 2025-10-21 08:49:23

#include<bits/stdc++.h>
using namespace std;
#define spps1 ios::sync_with_stdio(false)
#define spps2 cin.tie(nullptr)
int main()
{
	spps1; spps2;
	int a; cin>>a;
	string out="";
	while(a--)
	{
		int x; cin>>x;
		vector<int> s;
		//TO QUINARY
		while(x != 0)
		{
			int r=x%5;
			x/=5;
			if(r>2)
			{
				r-=5;
				x++;
			}
			if(r<-2)
			{
				r+=5;
				x--;
			}
			s.push_back(r);
		}
		if(s.empty())
		{
			s.push_back(0);
		}
		for(int i=0;i<s.size();i++)
		{
			if(i)
				out+=' ';
			out+=to_string(s[i]);
		}
		out+='\n';
	}
	cout<<out;
}