Submission #3050692

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int n;

int dist(int i, int j) {
    int ans = j-i;
    if (ans <= 0) ans += n;
    return ans;
}

int mid(int i, int j) {
    auto d = dist(i,j);
    return (i+d/2)%n;
}

int ask(int i) {
    cout << i << endl;
    string ans; cin >> ans;
    if (ans[0] == 'V') exit(0);
    return string("MF").find(ans[0]);
}

int main() {
    cin >> n;
    int lo = 0, hi = 0;
    int vl = ask(0), vh = vl;
    while (true) {
        auto mi = mid(lo,hi);
        auto vm = ask(mi);
        if ((lo+vl+mi+vm)%2) {
            hi = mi, 
            vh = vm;
        }
        else {
            lo = mi;
            vl = vm;
        }
    }
    return 0;
}

Submission Info

Judge Result