PAT 1035. Password

2019-11-14 09:06:31

字体：大中小

来源：转载

供稿：网友

https://www.patest.cn/contests/pat-a-PRactise/1035 纯模拟做做水题陶冶情操反正我也不会做难题了 = =

#include <bits/stdc++.h>using namespace std;int main(){ int N; scanf("%d/n", &N); vector<pair<string, string> > ans; for (int i = 0; i < N; i++) { string accout, pwd; cin >> accout >> pwd; bool flag = true; for (int i = 0; i < pwd.size(); i++) { if (pwd[i] == '1') pwd[i] = '@', flag = false; else if (pwd[i] == '0') pwd[i] = '%', flag = false; else if (pwd[i] == 'l') pwd[i] = 'L', flag = false; else if (pwd[i] == 'O') pwd[i] = 'o', flag = false; } if (!flag) { ans.push_back(make_pair(accout, pwd)); } } if (ans.size() == 0) { if (N == 1) { cout << "There is 1 account and no account is modified" << endl; } else cout << "There are " << N << " accounts and no account is modified" << endl; } else { cout << ans.size() << endl; for (auto e : ans) { cout << e.first << ' ' << e.second << endl; } }}

上一篇：Java线程池执行原理分析

下一篇：1035. 插入与归并(25)