Submission

Score: 80

User: anonymous

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

Language: cpp

Time: 0.004 second

Submitted On: 2026-10-06 09:30:35

#include <bits/stdc++.h>

using namespace std;
int main(){
	
	int n,num[1001]; cin >> n;
	for(int i = 0 ; i < n ; i++)
	{
		cin >> num[i];
	}
	
	for(int i = 0 ; i < n ; i++){
		if(num[i] == 0){
			cout << "/n";
			continue;
		}
		
		while (num[i] != 0)
		{
			int temp = (num[i] % 5 + 5) % 5;
			num[i] = (num[i] - temp)/5;
			if(temp == 3)
			{
				temp = -2;
				num[i] += 1;
			}
			else if(temp == 4)
			{
				temp = -1;
				num[i] += 1;
			}
			cout << temp << ' ';
		}
		cout << '\n';
	}
    
    return 0;

}