PAT(甲级)1035
来源:互联网 发布:mysql btree索引原理 编辑:程序博客网 时间:2024/05/21 08:53
1035. Password (20)
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 <vector>using namespace std;bool check(char *p){bool flag =false;while(*p !='\0'){switch (*p){case '1' :{flag=true;*p ='@';break;}case '0':{flag=true;*p = '%';break;}case 'l':{flag=true;*p='L';break;}case 'O':{flag=true;*p='o';break;}default: ;}p++;}return flag;}vector<string> s;int main(){char usr[16];char pwd[16];int N,i,count=0;cin >>N;bool flag = true;bool change;for(i=1;i<=N;i++){change =false;cin >>usr >>pwd;change =check(pwd);if(change){s.push_back(usr);s.push_back(pwd);count++;}}if(count==0){if(N==1) printf("There is %d account and no account is modified\n",N); else printf("There are %d accounts and no account is modified\n",N);return 0;} cout <<count <<endl;vector<string>::iterator iter=s.begin();while(iter !=s.end()){cout <<*iter <<' ' ;iter++;cout <<*iter <<endl;iter++;}return 0;}
- PAT(甲级)1035
- 浙大PAT甲级 1035
- PAT甲级1035
- PAT甲级 1035 -- 没有注释
- PAT 甲级
- PAT甲级 A1025.PAT RANKING
- PAT 甲级 1025 PAT Ranking
- PAT(甲级)1003
- PAT(甲级)1004
- PAT(甲级)1005
- PAT(甲级)1006
- PAT(甲级)1007
- PAT(甲级)1008
- PAT(甲级)1009
- PAT(甲级)1010
- PAT(甲级)1011
- PAT(甲级)1012
- PAT(甲级)1013
- PAT(甲级)1034
- leetcode:Sort List 使用归并排序的解决思路
- Vmware虚拟机下三种网络模式配置
- 3.3.3 Differ对象
- HDU 1181 DFS
- PAT(甲级)1035
- 静态成员函数的作用与静态数据成员的初始化
- PAT(甲级)1036
- LeetCode 19_Remove Nth Node From End of List
- 我读过的好书
- phpt文件说明,php官方自动测试方法,run-test.php命令用法
- 工具提示
- PAT(甲级)1037
- HDU - 1024 Max Sum Plus Plus(DP + 滚动数组)