cf409a

这个题，是个愚人节题，我当时想到了是愚人节题，但是还是没有看出来是什么猫腻。。。。可能是懒了，然后去搜了一发题解，然后知道，其实就是剪刀石头布的游戏，，，。。。。

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

int main()
{
    char s1[20] , s2[20];
    int c1 = 0 , c2 = 0;
    gets(s1);
    gets(s2);
    for(int i = 0 ;  i < strlen(s2)-1 ; i+=2){
    if(s1[i+1] - s1[i] == 2 && s2[i+1] - s2[i] == 4  || s1[i+1] - s1[i] == 1 && s2[i+1] - s2[i] == 2 || s1[i+1] - s1[i] == 4 && s2[i+1] - s2[i] == 1)
        c2++;
    if(s1[i+1] - s1[i] == 2 && s2[i+1] - s2[i] == 1  || s1[i+1] - s1[i] == 1 && s2[i+1] - s2[i] == 4 || s1[i+1] - s1[i] == 4 && s2[i+1] - s2[i] == 2)
        c1++;
    }
    if(c1 == c2) printf("TIE\n");
    else if(c1 > c2) printf("TEAM 1 WINS\n");
    else printf("TEAM 2 WINS\n");
    return 0;
}