古代密码AC答案

上代码：

#include <stdio.h>
#include <iostream>
#include <stack>
#include <string.h>
#include <queue>
#include <cmath>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <string>
#include <iomanip>
using namespace std;
typedef long long LL;
#define MAX 1001
int a[MAX][MAX];
int b[MAX][MAX];
int res[MAX][MAX];
 
char c1[200];
char c2[200];
int hash_a[26];
int hash_b[26];
 
 
int main() {
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    //cin >> k >> x;
    scanf("%s", c1);
    getchar();
    scanf("%s", c2);
    int len1 = strlen(c1);
    int len2 = strlen(c2);
    for(int i = 0; i < len1; i++){
        hash_a[c1[i]- 'A']++;
    }
    for(int i = 0; i < len2; i++){
        hash_b[c2[i]- 'A']++;
    }
    sort(hash_a, hash_a + 26);
    sort(hash_b, hash_b + 26);
    for(int i = 0; i < 26; i++){
        if(hash_a[i] != hash_b[i]){
            cout << "NO" << endl;;
            return 0;
        }
    }
    cout << "YES" << endl;
    return 0;
 
}