Submission #1301934

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

const std::string winners = "ABC";
string S[3];
int is[3];

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
    
    for(int i=0;i<3;++i){
        std::cin >> S[i];        
    }

    int cur = 0;
    while(is[cur] < S[cur].size()){
        int next_cur = S[cur][is[cur]] - 'a';
        ++is[cur];
        cur = next_cur;
    }

    std::cout << winners[cur] << std::endl;
}

Submission Info

Judge Result