-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1722_Spell_Check.cpp
More file actions
82 lines (74 loc) · 2.18 KB
/
1722_Spell_Check.cpp
File metadata and controls
82 lines (74 loc) · 2.18 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
/* A. Spell Check
time limit per test 1 second
memory limit per test 256 megabytes
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 s of length n consisting only of uppercase or lowercase Latin letters. He asks you to check if s is the correct spelling of his name.
Input
The first line of the input contains an integer t (1≤t≤103) — the number of test cases.
The first line of each test case contains an integer n (1≤n≤10) — the length of string s.
The second line of each test case contains a string s consisting of only uppercase or lowercase Latin characters.
Output
For each test case, output "YES" (without quotes) if s 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:
10
5
Timur
5
miurT
5
Trumi
5
mriTu
5
timur
4
Timr
6
Timuur
10
codeforces
10
TimurTimur
5
TIMUR
Output:
YES
YES
YES
YES
NO
NO
NO
NO
NO
NO
*/
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int t;
cin >> t;
string target = "Timur";
sort(target.begin(), target.end()); // Sorted "Timur"
while (t--) {
int n;
string s;
cin >> n >> s;
if (n != 5) {
cout << "NO" << endl;
continue;
}
sort(s.begin(), s.end());
if (s == target) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
return 0;
}