-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1155.cpp
More file actions
56 lines (44 loc) · 1.01 KB
/
1155.cpp
File metadata and controls
56 lines (44 loc) · 1.01 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
#include <iostream>
#include <string>
#include <vector>
std::string solve(int n, const std::string (&str)[100])
{
std::vector<std::vector<int>> freq1(n, std::vector<int> (26));
for (size_t i{0}; i < n; ++i)
{
for (size_t j{0}; j < str[i].size(); ++j)
{
++freq1[i][str[i][j] - 'a'];
}
}
std::vector<int> same_freq(26, 100);
for (size_t i{0}; i < n; ++i) {
for (size_t j{0}; j < 26; ++j) {
if (same_freq[j] > freq1[i][j]) same_freq[j] = freq1[i][j];
}
}
std::string result;
for(size_t i{0}; i < 26; ++i) {
if(same_freq[i]!=0) {
result.append(same_freq[i], (char(i+'a')));
}
}
return result;
}
int main()
{
int T;
int n;
std::cin >> T;
for (size_t i{0}; i < T; ++i)
{
std::string str[100];
std::cin >> n;
for (size_t j{0}; j < n; ++j)
{
std::cin >> str[j];
}
std::cout << solve(n, str)<<'\n';
}
return 0;
}