Submission

Score: 100

User: porpeang

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

Language: cpp

Time: 0.003 second

Submitted On: 2026-10-08 11:29:45

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

int main(){
    int a=0,b=0,c=0;
    cin>>a;
    vector<int>ve;
    for(int i=0;i<a;i++){
        cin>>b;
        ve.push_back(b);
    }
    for(int j=0;j<a;j++){
        int sad=ve[j];
        vector<int>vev={};
        while(true){
            int r = (sad % 5 + 5) % 5;

            if(r == 0){
                vev.push_back(0);
                sad = sad / 5;
            }
            else if(r == 1){
                vev.push_back(1);
                sad = (sad - 1) / 5;
            }
            else if(r == 2){
                vev.push_back(2);
                sad = (sad - 2) / 5;
            }
            else if(r == 3){
                vev.push_back(-2);
                sad = (sad + 2) / 5;
            }
            else if(r == 4){
                vev.push_back(-1);
                sad = (sad + 1) / 5;
            }

            if(sad == 0) break;
        }
        for(size_t k = 0; k < vev.size(); k++){
            cout << vev[k] << (k + 1 == vev.size() ? "" : " ");
        }
        cout << '\n';
    }
}