B. Spell Check

最新推荐文章于 2024-05-05 11:35:29 发布

朱小呆QAQ

最新推荐文章于 2024-05-05 11:35:29 发布

阅读量44

点赞数

文章标签： c++ 开发语言

本文链接：https://blog.csdn.net/hacker_hao/article/details/131153977

版权

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

Timur

miurT

Trumi

mriTu

timur

Timr

Timuur

codeforces

TimurTimur

TIMUR

output

Copy

YES
YES
YES
YES
NO
NO
NO
NO
NO
NO

#include <bits/stdc++.h>
using namespace std;
int t,cnt,n;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> t;
    while(t--)
    {
        cnt = 0;
        string s;
        cin >> n >> s;
        if(n != 5)
        {
            cout << "NO" << endl;
            continue;
        }


        string index = "Timur";
        int ok[5] = {1,1,1,1,1};
        for(int i =0 ;i < 5; i++)
        {
            for(int j = 0; j < 5; j++)
            {
                if(s[j] == index[i])
                {
                    ok[i] = 0;
                    break;
                }
            }
        }
        for(int i = 0; i < 5; i++)
            cnt += ok[i];

        if(cnt == 0)
            cout << "YES" << endl;
        else
            cout << "NO" << endl;


    }
    system("pause");
    return 0;
}