BOJ 23235 - The Fastest Sorting Algorithm In The World [C++]

문제

링크

풀이

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