Codeforces Round #826 (Div. 3) A. Compare T-Shirt Sizes

Two T-shirt sizes are given: aa and bb. The T-shirt size is either a string M or a string consisting of several (possibly zero) characters X and one of the characters S or L.

For example, strings M, XXL, S, XXXXXXXS could be the size of some T-shirts. And the strings XM, LL, SX are not sizes.

The letter M stands for medium, S for small, L for large. The letter X refers to the degree of size (from eXtra). For example, XXL is extra-extra-large (bigger than XL, and smaller than XXXL).

You need to compare two given sizes of T-shirts aa and bb.

The T-shirts are compared as follows:

  • any small size (no matter how many letters X) is smaller than the medium size and any large size;
  • any large size (regardless of the number of letters X) is larger than the medium size and any small size;
  • the more letters X before S, the smaller the size;
  • the more letters X in front of L, the larger the size.

For example:

  • XXXS < XS
  • XXXL > XL
  • XL > M
  • XXL = XXL
  • XXXXXS < M
  • XL > XXXS

Input

The first line of the input contains a single integer tt (1≤t≤1041≤t≤104) — the number of test cases.

Each test case consists of one line, in which aa and bb T-shirt sizes are written. The lengths of the strings corresponding to the T-shirt sizes do not exceed 5050. It is guaranteed that all sizes are correct.

Output

For each test case, print on a separate line the result of comparing aa and bb T-shirt sizes (lines "<", ">" or "=" without quotes).

Example

input

Copy

 

6

XXXS XS

XXXL XL

XL M

XXL XXL

XXXXXS M

L M

output

Copy

<
>
>
=
<
>

思路是利用数字判断size大小就很容易了

#include<stdio.h>
int main()
{
	int n;
	int a = 100, b = 100;
	int xa, xb;
	int xal;
	int xbl;
	scanf("%d", &n);
 
	for (int i = 0; i < n; i++)
	{
	    	char sa[51];
        	char sb[51];
		scanf("%s %s",sa,sb);
		a = 100, b = 100;
		xa = xb = 0;
		xal = xbl = 1;
		for (int i = 0; sa[i] != '\0'; i++)
		{
			if (sa[i] == 'X')
				xa++;
			if (sa[i] == 'S')
				xal = -1;
			if ( sa[i] == 'L')
				a = 200;
				if(sa[i]=='M')
				a=150;
 
		}
		for (int i = 0; sb[i] != '\0'; i++)
		{
			if (sb[i] == 'X')
				xb++;
			if (sb[i] == 'S')
				xbl = -1;
			if ( sb[i] == 'L')
				b = 200;
				if(sb[i]=='M')
				b=150;
 
		}
		a = a + xa * xal;
		b = b + xb * xbl;
		if (a > b)
		{
			printf(">\n");
		}
		else if (a < b)
		{
			printf("<\n");
 
		}
		else printf("=\n");
	}
 
}

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值