Codingame Solution: The Descent

Solution

I solved this problem quite some time before writing about it here. They actually simplified this already simple problem even more. Previously, we flew over the mountains and had to decide when to fire. The new version is just finding the maximum height and printing the index. So here it is:

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int main() {

  while (1) {
    int max = 0;
    int max_i = 0;
    for (int i = 0; i < 8; i++) {
      int MH;
      cin >> MH; cin.ignore();
      if (max < MH) {
        max = MH;
        max_i = i;
      }
    }
    cout << max_i << endl;
  }
}

Synopsis