BOJ 10312 - Lodê [C++]

문제

링크

풀이

#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
 
void solve(void) {
  int k; cin >> k;
 
  vector<int> ans;
  while (k) {
    ans.push_back(k % 3);
    k /= 3;
  }
 
  reverse(ans.begin(), ans.end());
  for (int n : ans) cout << n << " ";
  cout << "\n";
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  int n; cin >> n;
  while (n--) solve();
  return 0;
}