题解 | 斗兽棋

#include <iostream>
#include <map>
#include <string>
using namespace std;

int main() {
    string s1, s2;
    cin >> s1 >> s2;
    if (((s1[0]=='e') && (s2[0]=='t')) || ((s1[0]=='t') && (s2[0]=='c')) || ((s1[0]=='c') && (s2[0]=='m')) || ((s1[0]=='m') && (s2[0]=='e'))) {
        cout << "win";
    } else if (((s1[0]=='e') && (s2[0]=='m')) || ((s1[0]=='m') && (s2[0]=='c')) || ((s1[0]=='c') && (s2[0]=='t')) || ((s1[0]=='t') && (s2[0]=='e'))) {
        cout << "lose";
    } else {
        cout << "tie";
    }
}
// 64 位输出请用 printf("%lld")