Submission

Status:

----------

Subtask/Task Score:

0/100

Score: 0

User: Imorange

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

Language: cpp

Time: 0.004 second

Submitted On: 2025-10-13 14:22:15

#include <bits/stdc++.h>

using namespace std; 

int main(){
  int t;
  cin >> t;
  while(t--){
    int n;
    cin >> n;
    int sign;
    if(n > 0) sign = 1;
    else {
      sign = -1;
      n = -n;
    }
    int tag = 0;
    for(;n>0;n/=5){
      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';
  }
}