PAT 甲级 1035. Password (20)
来源:互联网 发布:上帝已死 知乎 编辑:程序博客网 时间:2024/05/24 15:41
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;int main(){ int t; vector<string> v; cin>>t; for(int j=0;j<t;j++){ string s1,s2; int flag=0; cin>>s1>>s2; for(int i=0;i<s2.length();i++){ switch(s2[i]){ case '1':s2[i]='@';flag=1;break; case '0':s2[i]='%';flag=1;break; case 'l':s2[i]='L';flag=1;break; case 'O':s2[i]='o';flag=1;break; } } if(flag){ string s=s1+" "+s2; v.push_back(s); } } int cnt=v.size(); //cout<<cnt<<endl; if(cnt==0&&t==1) cout<<"There is 1 account and no account is modified"<<endl; else if(cnt==0) cout<<"There are "<<t<<" accounts and no account is modified"<<endl; else{ cout<<cnt<<endl; for(int i=0;i<cnt;i++) cout<<v[i]<<endl; } cin>>t; 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)
- jquery获得table当前行中的所有内容
- 蛇形填数
- AndroidUI控件的自定义属性
- python里使用带参数的装饰器
- win7+vs2015+opencv3.1(64位)
- PAT 甲级 1035. Password (20)
- java面试题目03
- Spring分析源码
- C# 中的数组类
- 50个必考SQL语句基础常用面试必备
- Python基本数据类型
- 第一周第一节课 :什么是数据结构
- 如何制作一张海报
- 自定义View系列(8)--越界回弹ScrollView