同和创作矩阵 › ›博文归档› 技术博文归档 › 查看内容

22026_NamePK

2022-5-16 18:21| 发布者: Hocassian| 查看: 28| 评论: 0|原作者: 肇庆学院ACM合集

摘要:

C:\Users\Administrator\Downloads\2019-10-12-10-14-4-8950650499700-Problem List-采集的数据-后羿采集器.html

Pro.ID

22026

Title

Name PK

Title链接

http://10.20.2.8/oj/exercise/problem?problem_id=22026

AC

Submit

Ratio

100.00%

时间&空间限制

Time Limit: 1000/500 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

描述

Name PK is a funny game on the Internet. The game will calculate character's property based on its name.

Now we're simulating a simple Name PK game. Each character has 3 parameters: HP, STR and SPD (HP for health point, STR for strength and SPD for attacking speed).

For a name string of length N, C_i is ASCII code (decimal) of the i-th char.

PK rule:

1. Timer begins to increase from 1. When it is a multiple of (20-SPD), the corresponding character A has that SPD attack once, the opposite lose STR(A's) HP.

2. When any side has a HP ≤ 0, the PK is over.

输入

The input consists of several test cases. The first line of input consists of an integer T, indicating the number of test cases. Each test case is on a separate line, and it consists two strings separated by a whitespace, indicating the name of the characters.

Technical Specification

1. Names contain only English letters.

2. The length of each character’s name is more than 1 and no more than 20.

3. T ≤ 1000.

输出

Description

Name PK is a funny game on the Internet. The game will calculate character's property based on its name.

Now we're simulating a simple Name PK game. Each character has 3 parameters: HP, STR and SPD (HP for health point, STR for strength and SPD for attacking speed).

For a name string of length N, C_i is ASCII code (decimal) of the i-th char.

PK rule:

1. Timer begins to increase from 1. When it is a multiple of (20-SPD), the corresponding character A has that SPD attack once, the opposite lose STR(A's) HP.

2. When any side has a HP ≤ 0, the PK is over.

Input

Technical Specification

1. Names contain only English letters.

2. The length of each character’s name is more than 1 and no more than 20.

3. T ≤ 1000.

Output

For each test case, output a line consisting of the result of the first character: "win", "lose" or "tie".

Sample Input

3
Sylvia xay
Ivan Stacy
Boyd Greg

Sample Output

lose
win
lose