BOJ 6996 - 애너그램 [C++]

문제

링크

풀이

#include <iostream>
#include <string>
#include <vector>
using namespace std;
 
void solve(void) {
  string a, b; cin >> a >> b;
  vector<int> cnt(26, 0);
  for (char c : a) cnt[c-'a']++;
  for (char c : b) cnt[c-'a']--;
 
  for (int n : cnt) {
    if (n != 0) {
      cout << a << " & " << b << " are NOT anagrams.\n";
      return;
    }
  }
  cout << a << " & " << b << " are anagrams.\n";
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  int t; cin >> t;
  while (t--) solve();
  return 0;
}