Submission

Score: 100

User: SRW

Problemset: อะนาแกรม 2

Language: cpp

Time: 0.004 second

Submitted On: 2026-09-30 13:28:49

#include <bits/stdc++.h>
using namespace std;
#define ll long long;
int main(){
    string txt1;
    string txt2;
    cin >> txt1;
    cin >> txt2;
    int n;
    int n2;
    n = txt1.length();
    n2 = txt2.length();
    int arr1[100] = {0};
    int arr2[100] = {0};
    int check[100] = {0};
    int cnt = 0;
    for (int i=0;i<n;i++){
        arr1[int(txt1[i])] += 1;
    }
    for (int i=65;i<73;i++){
        cout << arr1[i] << " ";
    }
    cout << "\n";
    for (int i=0;i<n2;i++){
        arr2[int(txt2[i])] += 1;
    }
    for (int i=65;i<73;i++){
        cout << arr2[i] << " ";
    }
    cout << "\n";
    for (int i=65;i<73;i++){
        if (arr1[i]!=arr2[i]){
            check[i]=(abs(arr1[i]-arr2[i]));
        }
    }   
    for (int i=65;i<73;i++){
        cout << check[i] << " ";
        if (check[i] != 0){
            cnt += 1;
        }
    }
    cout << "\n";
    if (cnt > 3){
        cout << "no";
    }
    else{
        cout << "anagram";
    }
}