PAT甲级 1035. Password (20)
来源:互联网 发布:企业内部数据共享方案 编辑:程序博客网 时间:2024/06/09 14:36
题目:
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:
3Team000002 Rlsp0dfaTeam000003 perfectpwdTeam000001 R1spOdfaSample Output 1:
2Team000002 RLsp%dfaTeam000001 R@spodfaSample Input 2:
1team110 abcdefg332Sample Output 2:
There is 1 account and no account is modifiedSample Input 3:
2team110 abcdefg222team220 abcdefg333Sample Output 3:
There are 2 accounts and no account is modified思路:
这道题很简单,只是简单地将字符串中特定的字符进行替换
代码:
#include<iostream>#include<string>#include<vector>using namespace std;struct user{string name;string password;};int main(){
//输入int N;cin >> N;vector<user> users(N);int i = 0;for (; i < N; ++i){cin >> users[i].name >> users[i].password;}//替换int j;vector<user> modified;bool flag = 0;for (i = 0; i < N; ++i){flag = 0;for (j = 0; j < users[i].password.size(); ++j){switch (users[i].password[j]){case '1':{flag = 1;users[i].password[j] = '@';break;}case '0':{flag = 1;users[i].password[j] = '%';break;}case 'l':{flag = 1;users[i].password[j] = 'L';break;}case 'O':{flag = 1;users[i].password[j] = 'o';break;}}}if (flag){modified.push_back(users[i]);}}//输出if (modified.size() == 0){if (users.size() == 1)cout << "There is 1 account and no account is modified" << endl;elsecout << "There are " << N << " accounts and no account is modified" << endl;}else{cout << modified.size() << endl;for (i = 0; i < modified.size(); ++i){cout << modified[i].name << " " << modified[i].password << endl;}}system("pause");return 0;}
- PAT甲级.1035. Password (20)
- 【PAT甲级】1035. Password (20)
- 1035. Password (20)PAT 甲级
- PAT甲级1035. Password (20)
- PAT 甲级 1035. Password (20)
- PAT甲级 1035. Password (20)
- 1035. Password (20)-PAT甲级真题
- PAT(甲级)1035. Password (20)
- PAT甲级练习1035. Password (20)
- 【PAT】1035. Password (20)
- 1035. Password (20)-PAT
- PAT 1035. Password (20)
- pat 1035. Password (20)
- PAT 1035. Password (20)
- PAT 1035. Password (20)
- PAT 1035. Password (20)
- PAT (Advanced) 1035. Password (20)
- PAT A 1035. Password (20)
- spring boot的一些配置应用
- 自定义Annotation及AnnotationDao的设计
- NOIP模拟 road【tarjan】
- Mysql之查询
- 【网络流算法模板】最大流:dinic模板
- PAT甲级 1035. Password (20)
- 刷紫书第六章例题
- List / Map / Collection 常用的方法
- 锁屏广播
- LeetCode 37. Sudoku Solver--回溯法
- (HDOJ)数塔(动态规划)
- 相对路径和绝对路径
- sudo命令:解决使用Linux命令行时出现的错误提示
- 一图流说明word2vec