forked from varnitsingh/OJ-problems
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathJuggling Letters.cpp
65 lines (51 loc) · 1.15 KB
/
Juggling Letters.cpp
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
// Problem: A. Juggling Letters
// Contest: Codeforces - Codeforces Round #666 (Div. 2)
// URL: https://codeforces.com/contest/1397/problem/A
// Memory Limit: 256 MB
// Time Limit: 1000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define ll long long int
#define vi vector<int>
#define vii vector<int, int>
#define vc vector<char>
#define vl vector<ll>
#define mod 1000000007
#define INF 1000000009
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
t = 1;
cin >> t;
while(t--) {
int n;
cin >> n;
string s;
unordered_map<int, int> mp;
for(int i = 1; i <= n; i++) {
cin >> s;
for(auto c : s) {
mp[c]++;
}
}
bool flag = 0;
for(auto x : mp) {
if(x.second % n != 0) {
cout << "NO\n";
flag =1;
break;
}
}
if(flag) continue;
cout << "YES\n";
}
return 0;
}