Er Ba Game

题目描述

Er Ba Game is a popular card game in China's Province Zhejiang.

In this problem, the game involves two players and 36 cards - 2,3,⋯ ,102,3,\cdots, 102,3,⋯,10, each with four.

In the game each player takes 2 cards (a1,b1)(a_1,b_1)(a1​,b1​) , (a2,b2)(a_2,b_2)(a2​,b2​) .Player i{i}i gets (ai,bi)(a_i,b_i)(ai​,bi​) . Suppose a1≤b1,a2≤b2a_1\leq b_1,a_2\leq b_2a1​≤b1​,a2​≤b2​, and we determine the winner as follow:

1. (2,8){(2,8)}(2,8) is the biggest pair.
2. If neither is (2,8){(2,8)}(2,8), a pair with a=b{a=b}a=b is greater than a pair without.
3. If a1=b1a_1=b_1a1​=b1​ and a2=b2a_2=b_2a2​=b2​, then compare a1,a2a_1,a_2a1​,a2​.The bigger one wins.
4. If a1≠b1,a2≠b2a_1\ne b_1,a_2\ne b_2a1​​=b1​,a2​​=b2​, compare (a1+b1) mod 10,(a2+b2) mod 10(a_1+b_1)\ \text{mod}\ 10,(a_2+b_2)\ \text{mod}\ 10(a1​+b1​) mod 10,(a2​+b2​) mod 10.The bigger one wins.
5. If  a1≠b1,a2≠b2a_1\ne b_1,a_2\ne b_2a1​​=b1​,a2​​=b2​ and (a1+b1) mod 10=(a2+b2) mod 10(a_1+b_1)\ \text{mod}\ 10=(a_2+b_2)\ \text{mod}\ 10(a1​+b1​) mod 10=(a2​+b2​) mod 10,compare b1,b2b_1,b_2b1​,b2​.The bigger one wins.

If a1≤b1,a2≤b2a_1\leq b_1,a_2\leq b_2a1​≤b1​,a2​≤b2​ does not hold, we can exchange a1a_1a1​ and b1b_1b1​ or exchange a2a_2a2​ and b2b_2b2​ until the formula holds.

You're told  a1,b1,a2,b2a_1,b_1,a_2,b_2a1​,b1​,a2​,b2​, and you should tell who's gonna win the game.

输入描述:

The first line contains an integer T{T}T — number of game cases.
Then T{T}T lines, each contains four integers a1,b1,a2,b2a_1,b_1, a_2,b_2a1​,b1​,a2​,b2​, denoting the cards of each player.

输出描述:

Output T{T}T lines.

If player 1 wins, output "first" (without quote).

If player 2 wins, output "second" (without quote).

Otherwise, output "tie" (without quote).

示例1

输入

复制

5
2 8 4 6
6 6 6 7
4 5 5 5
6 3 9 10
7 2 2 7

输出

复制

first
first
second
second
tie

说明

The answers to the first four sets of data are obtained through the first, second, second, and fifth rules respectively.

备注:

It's guaranteed that T≤100,2≤a1,b1,a2,b2≤10T\leq 100,2\leq a_1,b_1,a_2,b_2\leq 10T≤100,2≤a1​,b1​,a2​,b2​≤10.

It's not guaranteed that a1≤b1,a2≤b2a_1\leq b_1,a_2\leq b_2a1​≤b1​,a2​≤b2​.

思路：为了简化计算代码，直接写一个计算函数，等价每一个（a,b)的值，然后再比较。

代码如下：

#include <bits/stdc++.h>
using namespace std;
int t,a1,b1,a2,b2;
int cal(int a, int b){
    if(a>b) swap(a,b);//必须满足a<=b
    if(a==2&&b==8) return 1e9+7;//令为最大的数
    if(a==b) return 1e8*a;//因为a的范围在2-10之间，所以这里令为1e8*a;
    return 100000*((a+b)%10)+b;//为了综合另外两种情况，同时用到(a+b)%10和b
}
int main(){
    cin>>t;
    while(t--){
        cin>>a1>>b1>>a2>>b2;
        int x=cal(a1,b1);
        int y=cal(a2,b2);
        if(x>y) puts("first");//用puts输出字符串时会自动在末尾添加一个换行符，使代码更简洁
        else if(x==y) puts("tie");
        else puts("second");
    }
    return 0;
}