BOJ 5346 - Frodo Sequence [C++]

문제

링크

풀이

#include <iostream>
using namespace std;
 
bool solve(void) {
  int n; cin >> n;
  if (n == 0) return false;
 
  cout << (n+1)/2 << "\n";
  return true;
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  while (solve());
  return 0;
}