Submission

Score: 100

User: Zailagend1

Problemset: อะนาแกรม 2

Language: cpp

Time: 0.003 second

Submitted On: 2026-06-19 00:19:46

#include <bits/stdc++.h>
using namespace std;

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> pii;

#define pb push_back
#define all(v) v.begin(), v.end()
string t;
string q;
unordered_map<char, int> character = {
    {'A', 0},
    {'B', 0},
    {'C', 0},
    {'D',0},
    {'E',0},
    {'F',0},
    {'G',0},
    {'H',0}
    };
unordered_map<char, int> character2 = {
    {'A', 0},
    {'B', 0},
    {'C', 0},
    {'D',0},
    {'E',0},
    {'F',0},
    {'G',0},
    {'H',0}
    };
  vi  sigma;
  vi sigma2;
  vi sigma3;
  int counter = 0;
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> t;
    cin >> q;
    if ((t.find_first_not_of("ABCDEFGH") != std::string::npos) || t.size() > 10000 || (q.find_first_not_of("ABCDEFGH") != std::string::npos) || q.size() > 10000){return 0;}
  
    for(char x:t){
      if(islower(x)){return 0;}
      character[x] += 1;
    }
    for(char x:q){
      if(islower(x)){return 0;}
      character2[x] += 1;
    }
    for (const auto& [_, character] : character) {
      sigma.push_back(character) ;
    }
    for (const auto& [_, character] : character2) {
      sigma2.push_back(character) ;
    }
    reverse(all(sigma));
    reverse(all(sigma2));
    for(int i = 0;i<sigma.size();i++){
      sigma3.push_back(abs(sigma[i]-sigma2[i]));
      counter+=sigma3[i];
    }
    for(int x :sigma){
      cout << x << " ";
    }
    cout << '\n';
    for(int x :sigma2){
      cout << x << " ";
    }
    cout << '\n';
    for(int x :sigma3){
      cout << x << " ";
    }
    cout << '\n';
    if(counter <= 3){
      cout << "anagram";
    }else{cout << "no";}
    return 0;
}