-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path141A_AmusingJoke.cpp
More file actions
49 lines (38 loc) · 976 Bytes
/
141A_AmusingJoke.cpp
File metadata and controls
49 lines (38 loc) · 976 Bytes
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
//* 216665410 Aug/01/2023 13:18UTC+7 Minh4893IT A - Amusing Joke GNU C++14 Accepted 30 ms 0 KB
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ss stringstream
#define uset unordered_set
#define umap unordered_map
#define mmap multimap
#define mset multiset
#define pq priority_queue
#define endl "\n"
#define LLMAX INT64_MAX
#define GET(var) getline(cin, var)
#define EACH(x, a) for (auto &x : a)
#define IF(cond, t, f) (cond ? t : f)
#define OFILE(finp, fout) freopen(finp, "r", stdin), freopen(fout, "w", stdout)
#define FAST_IO ios_base::sync_with_stdio(false), cin.tie()
void solve()
{
vector<int> count1(26), count2(26);
string s;
cin >> s;
for (auto c : s)
++count1[c - 'A'];
cin >> s;
for (auto c : s)
++count1[c - 'A'];
cin >> s;
for (auto c : s)
++count2[c - 'A'];
cout << IF(count1 == count2, "YES", "NO");
}
signed main()
{
FAST_IO;
solve();
return 0;
}