1035. Password (20)
来源:互联网 发布:什么叫做数据库查询 编辑:程序博客网 时间:2024/06/06 03:33
To prepare for PAT, the judge sometimes has to generate random passwords for the users. The problem is that there are always some confusing passwords since it is hard to distinguish 1 (one) from l (L in lowercase), or 0 (zero) from O (o in uppercase). One solution is to replace 1 (one) by @, 0 (zero) by %, l by L, and O by o. Now it is your job to write a program to check the accounts generated by the judge, and to help the juge modify the confusing passwords.
Input Specification:
Each input file contains one test case. Each case contains a positive integer N (<= 1000), followed by N lines of accounts. Each account consists of a user name and a password, both are strings of no more than 10 characters with no space.
Output Specification:
For each test case, first print the number M of accounts that have been modified, then print in the following M lines the modified accounts info, that is, the user names and the corresponding modified passwords. The accounts must be printed in the same order as they are read in. If no account is modified, print in one line “There are N accounts and no account is modified” where N is the total number of accounts. However, if N is one, you must print “There is 1 account and no account is modified” instead.
Sample Input 1:
3
Team000002 Rlsp0dfa
Team000003 perfectpwd
Team000001 R1spOdfa
Sample Output 1:
2
Team000002 RLsp%dfa
Team000001 R@spodfa
Sample Input 2:
1
team110 abcdefg332
Sample Output 2:
There is 1 account and no account is modified
Sample Input 3:
2
team110 abcdefg222
team220 abcdefg333
Sample Output 3:
There are 2 accounts and no account is modified
输出的时候注意is
are
account
accounts
这些单词的单复数.
#include <iostream> #include <string>#include <vector>using namespace std;struct UserInfo { string name; string password;};int main(){ int N; cin >> N; vector<UserInfo> vec; bool flag = false; for (int i = 0; i < N; ++i) { string name, password; cin >> name >> password; bool temp = false; for (int i1 = 0; i1 < password.length(); ++i1) { if (password[i1] == '1') { password[i1] = '@'; flag = true; temp = true; } else if (password[i1] == '0') { password[i1] = '%'; flag = true; temp = true; } else if (password[i1] == 'l') { password[i1] = 'L'; flag = true; temp = true; } else if (password[i1] == 'O') { password[i1] = 'o'; flag = true; temp = true; } } if (temp) { UserInfo user; user.name = name; user.password = password; vec.push_back(user); } } if (flag) { cout << vec.size() << endl; for (int i = 0; i < vec.size(); ++i) { cout << vec[i].name << " " << vec[i].password << endl; } } else { if (N == 1) cout << "There is " << N << " account and no account is modified" << flush; else cout << "There are " << N << " accounts and no account is modified" << flush; } return 0;}
- 1035. Password (20)
- 【PAT】1035. Password (20)
- 1035. Password (20)-PAT
- 1035. Password (20)
- 1035. Password (20)
- 1035. Password (20)
- PAT 1035. Password (20)
- 1035. Password (20)
- 1035. Password (20)
- 1035. Password (20)
- 1035. Password (20)
- 1035. Password (20)
- 1035. Password (20)
- 1035. Password (20)
- 1035. Password (20)
- 1035. Password (20)
- 1035. Password (20)
- pat 1035. Password (20)
- 第四天:理解arguments对象
- 一心多用多线程-阻塞队列(1)-ArrayBlockingQueue
- TabbarItem没有文字,图片居中
- HDU 3415 Max Sum of Max-K-sub-sequence [单调队列]【杂类】
- 用宏写一个函数可以将一个数字的奇数位和偶数位互换
- 1035. Password (20)
- Ubuntu 14.04解决minidwep-gtk无法启动问题
- 配置JDK环境变量及path和classpath的作用
- C++指针的理解
- Android Studio 签名打包 APK
- UNL系列图——交互图
- jQuery ajax发送POST、JS url跳转、console用法
- 程序员的职业素养
- iOS 两年小猿开始发文