Submission

Score: 80

User: ThreeDee

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

Language: cpp

Time: 0.004 second

Submitted On: 2026-06-14 15:38:28

#include <iostream>
using namespace std;
int main(){
	int t,k;
	cin>>t;
	for(k=0;k<t;k++){
	int a=0,j,i=0,n,five[8];
	cin>>n;
	if(n<0){
		a=1;
		n=-n;
	}
	while(n>0){
		if(n%5>2){
			five[i]=n%5-5;
			n=n/5+1;
			i++;
		}
		else{
			five[i]=n%5;
			n=n/5;
			i++;
		}
	}
	j=i;
	if(a==1){
		for(i=0;i<j;i++){
			cout<<-five[i]<<' ';
		}	
	}
	else{
		for(i=0;i<j;i++){
			cout<<five[i]<<' ';
		}
	}
	cout<<'\n';
	}
	return 0;
}