5711: The Great Game

内存限制:256 MB 时间限制:1 S 标准输入输出
题目类型:传统 评测方式:文本比较 上传者:
提交:2 通过:2

题目描述

两支球队在游戏世界锦标赛中相遇。一些科学家认为这个游戏是世界上最具智力挑战性的游戏。你会得到两个字符串,描述团队在最终战斗中的行动。弄清楚谁成为冠军。
Two teams meet in The Game World Championship. Some scientists consider this game to be the most intellectually challenging game in the world. You are given two strings describing the teams' actions in the final battle. Figure out who became the champion.

Input
The input contains two strings of equal length (between 2 and 20 characters, inclusive). Each line describes the actions of one team.
Output
Output "TEAM 1 WINS" if the first team won, "TEAM 2 WINS" if the second team won, and "TIE" if there was a tie.
Examples
Input
[]()[]8<
8<[]()8<
Output
TEAM 2 WINS
Input
8<8<()
[]8<[]
Output
TIE

输入格式

输入包含两个长度相等的字符串(介于 2 到 20 个字符之间,包括 <> 到 <> 个字符)。每行描述一个团队的操作。

输出格式

如果第一个团队获胜,则输出“TEAM 1 获胜”,如果第二个团队获胜,则输出“TEAM 2 获胜”,如果出现平局,则输出“TIE”。
Input

[]()[]8<
8<[]()8<
Output
TEAM 2 WINS
Input
8<8<()
[]8<[]
Output
TIE

输入样例 复制

8<8<()
[]8<[]

输出样例 复制

TIE