time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Timur likes his name. As a spelling of his name, he allows any permutation of the letters of the name. For example, the following strings are valid spellings of his name: Timur, miurT, Trumi, mriTu. Note that the correct spelling must have uppercased T and lowercased other letters.
Today he wrote string ss of length nn consisting only of uppercase or lowercase Latin letters. He asks you to check if ss is the correct spelling of his name.
Input
The first line of the input contains an integer tt (1≤t≤1031≤t≤103) — the number of test cases.
The first line of each test case contains an integer nn (1≤n≤10)(1≤n≤10) — the length of string ss.
The second line of each test case contains a string ss consisting of only uppercase or lowercase Latin characters.
Output
For each test case, output "YES" (without quotes) if ss satisfies the condition, and "NO" (without quotes) otherwise.
You can output the answer in any case (for example, the strings "yEs", "yes", "Yes" and "YES" will be recognized as a positive answer).
Example
input
Copy
10
5
Timur
5
miurT
5
Trumi
5
mriTu
5
timur
4
Timr
6
Timuur
10
codeforces
10
TimurTimur
5
TIMUR
output
Copy
YES YES YES YES NO NO NO NO NO NO
解题说明:此题是一道字符串题,首先判断长度对不对,然后再判断需要的字母是否都出现了即可。可以对字符串进行排序直接判断。
#include<stdio.h>
#include<string.h>
int main()
{
int t;
scanf("%d", &t);
while (t--)
{
int n;
scanf("%d", &n);
char a[15], tem;
scanf("%s", a);
if (n == 5)
{
for (int i = 0; i<5; i++)
{
for (int j = i + 1; j<5; j++)
{
if (a[i]>a[j])
{
tem = a[i];
a[i] = a[j];
a[j] = tem;
}
}
}
if (a[0] == 'T'&&a[1] == 'i'&&a[2] == 'm'&&a[3] == 'r'&&a[4] == 'u')
{
printf("YES\n");
}
else
{
printf("NO\n");
}
}
else
{
printf("NO\n");
}
}
return 0;
}