BOJ 3943 - 헤일스톤 수열 [C++]

문제

링크

풀이

#include <algorithm>
#include <iostream>
using namespace std;
 
void solve(void) {
  int n; cin >> n;
 
  int ans = n;
  while (n != 1) {
    n = (n & 1) ? 3*n+1 : n/2;
    ans = max(ans, n);
  }
  cout << ans << "\n";
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  int t; cin >> t;
  while (t--) solve();
  return 0;
}