CodeForces 1721A

最新推荐文章于 2024-11-17 20:38:28 发布

willem248

最新推荐文章于 2024-11-17 20:38:28 发布

阅读量95

点赞数

分类专栏： CodeForces 文章标签：算法 c++ 数据结构

转载请注明出处，谢谢。

本文链接：https://blog.csdn.net/lxylluvio/article/details/126565971

版权

CodeForces 专栏收录该内容

17 篇文章 1 订阅

订阅专栏

#include <bits/stdc++.h>

using namespace std;

signed main() {
  int T;
  cin >> T;
  while (T --) {
    string ss, tt;
    cin >> ss >> tt;
    char a[4];
    for (int i = 0; i < 2; i ++)
      a[i] = ss[i];
    for (int i = 0; i < 2; i ++)
      a[i + 2] = tt[i];
    int cnt[26] = {0};
    for (int i = 0; i < 4; i ++) {
      int j = a[i] - 'a';
      cnt[j] ++;
    }
    int mx = 0;
    for (int i = 0; i < 26; i ++)
      mx = max(mx, cnt[i]);
    if (mx == 1)
      cout << "3\n";
    else if (mx == 2) {
      int c = 0;
      for (int i = 0; i < 26; i ++)
        if (mx == cnt[i])
          c ++;
      if (c == 1)
        cout << "2\n";
      else
        cout << "1\n";
    }
    else if (mx == 3)
      cout << "1\n";
    else
      cout << "0\n";
  }
  return 0;
}