Two T-shirt sizes are given: a and b. 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 a and b.
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 t (1≤t≤104) — the number of test cases.
Each test case consists of one line, in which a and b T-shirt sizes are written. The lengths of the strings corresponding to the T-shirt sizes do not exceed 50. It is guaranteed that all sizes are correct.
Output
For each test case, print on a separate line the result of comparing a and b T-shirt sizes (lines “<”, “>” or “=” without quotes).
Example
inputCopy
6
XXXS XS
XXXL XL
XL M
XXL XXL
XXXXXS M
L M
outputCopy
#include<bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
string s[2];
while (n--) {
cin >> s[0] >> s[1];
if (s[0][s[0].length() - 1] == s[1][s[1].length() - 1]) {
if (s[0].length() > s[1].length())printf("%c\n", s[0][s[0].length() - 1] == 'S' ? '<' : '>');
if (s[0].length() == s[1].length())cout << '=' << endl;
if (s[0].length() < s[1].length())printf("%c\n", s[0][s[0].length() - 1] == 'S' ? '>' : '<');
}
else {
if (s[0][s[0].length() - 1] > s[1][s[1].length() - 1]) {
cout << '<'<<endl;
}
if (s[0][s[0].length() - 1] < s[1][s[1].length() - 1]) {
cout << '>' << endl;
}
}
}
}
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 分享一个免费、快速、无限量使用的满血 DeepSeek R1 模型,支持深度思考和联网搜索!
· 基于 Docker 搭建 FRP 内网穿透开源项目(很简单哒)
· ollama系列01:轻松3步本地部署deepseek,普通电脑可用
· 25岁的心里话
· 按钮权限的设计及实现