解法一：模拟

  1. #include <bits/stdc++.h>
  3. using namespace std;
  5. vector<pair<string, string>> ans;
  7. int main() {
  8.     ios::sync_with_stdio(false);
  9.     cin.tie(0);
  11.     int N, M = 0;
  13.     cin >> N;
  14.     string name, password;
  15.     for (int i = 0; i < N; ++i) {
  16.         cin >> name >> password;
  17.         bool flag = false;
  18.         for (auto &it:password) {
  19.             switch (it) {
  20.                 case '0':
  21.                     it = '%';
  22.                     flag = true;
  23.                     break;
  24.                 case 'O':
  25.                     it = 'o';
  26.                     flag = true;
  27.                     break;
  28.                 case '1':
  29.                     it = '@';
  30.                     flag = true;
  31.                     break;
  32.                 case 'l':
  33.                     flag = true;
  34.                     it = 'L';
  35.                     break;
  36.             }
  37.         }
  38.         if (flag) {
  39.             ans.emplace_back(make_pair(name, password));
  40.         }
  41.     }
  42.     if (ans.empty()) {
  43.         if (N == 1) {
  44.             cout << "There is 1 account and no account is modified\n";
  45.         } else {
  46.             cout << "There are " << N << " accounts and no account is modified\n";
  47.         }
  48.     } else {
  49.         cout << ans.size() << '\n';
  50.         for (auto &it:ans) {
  51.             cout << it.first << " " << it.second << '\n';
  52.         }
  53.     }
  54. }