Submission

Score: 100

User: Benjamin404

Problemset: อะนาแกรม 2

Language: cpp

Time: 0.004 second

Submitted On: 2025-10-19 00:15:25

#include <bits/stdc++.h>

using namespace std;

int main() {

    unordered_map<char, int> s_map, t_map;
    for (char i = 'A'; i <= 'H'; i++) {
        s_map[i] = 0;
        t_map[i] = 0;
    }

    string s, t;
    cin >> s >> t;

    for (char c : s) s_map[c]++;
    for (char c : t) t_map[c]++;

    vector<int> s_vec, t_vec;

    for (char i = 'A'; i <= 'H'; i++) {
        s_vec.push_back(s_map[i]);
        cout << s_map[i] << ' ';
    }

    cout << endl;

    for (char i = 'A'; i <= 'H'; i++) {
        t_vec.push_back(t_map[i]);
        cout << t_map[i] << ' ';
    }

    cout << endl;

    int count = 0;
    for (int i = 0; i < s_vec.size(); i++) {
        int value = abs(s_vec[i] - t_vec[i]);
        if (value != 0) count++;
        cout << value << ' ';
    }

    cout << endl;

    if (count <= 3) {
    	cout << "anagram";
    } else {
    	cout << "no";
    }

    return 0;
}