[PAT (Advanced Level) ]1035. Password 解题文档
来源:互联网 发布:翻墙 for mac 编辑:程序博客网 时间:2024/06/07 05:48
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
分析:此题没难度,注意输出即可。
C++代码如下。
#include<iostream>#include<string>#include<vector>using namespace std;int main(){ int N; cin>>N; int sum=0; vector<string> name; vector<string> pw; for(int i=0;i<N;i++){ string NameTemp; string PwTemp; cin>>NameTemp>>PwTemp; bool flag=false; for(int j=0;j<PwTemp.size();j++){ if(PwTemp[j]=='1'){ PwTemp[j]='@'; flag=true; } if(PwTemp[j]=='0'){ PwTemp[j]='%'; flag=true; } if(PwTemp[j]=='l'){ PwTemp[j]='L'; flag=true; } if(PwTemp[j]=='O'){ PwTemp[j]='o'; flag=true; } } if(flag){ sum++; name.push_back(NameTemp); pw.push_back(PwTemp); } } if(sum==0&&N>1) cout<<"There are "<<N<<" accounts and no account is modified"<<endl; else if(sum==0&&N==1) cout<<"There is "<<N<<" account and no account is modified"<<endl; else if(sum>0){ cout<<sum<<endl; for(int i=0;i<sum;i++) cout<<name[i]<<" "<<pw[i]<<endl; } return 0;}
测试点都通过。
- [PAT (Advanced Level) ]1035. Password 解题文档
- PAT (Advanced Level) 1035. Password (20) 解题报告
- [PAT (Advanced Level) ]1003. Emergency 解题文档
- [PAT (Advanced Level) ]1008. Elevator 解题文档
- 【c++】PAT (Advanced Level)1035. Password (20)
- 【PAT】【Advanced Level】1035. Password (20)
- [PAT (Advanced Level) ]1004. Counting Leaves解题文档
- [PAT (Advanced Level) ]1005. Spell It Right解题文档
- [PAT (Advanced Level) ]1015. Reversible Primes 解题文档
- [PAT (Advanced Level) ]1031.Hello World for U 解题文档
- [PAT (Advanced Level) ]1019. General Palindromic Number 解题文档
- [PAT (Advanced Level) ]1081. Rational Sum 解题文档
- [PAT (Advanced Level) ]1027. Colors in Mars 解题文档
- [PAT (Advanced Level) ]1023. Have Fun with Numbers 解题文档
- [PAT (Advanced Level) ]1007. Maximum Subsequence Sum 解题文档
- [PAT (Advanced Level) ]1009. Product of Polynomials 解题文档
- [PAT (Advanced Level) ]1011. World Cup Betting 解题文档
- [PAT (Advanced Level) ]1012. The Best Rank 解题文档
- [Linux学习]安装LNMP/LAMP一键安装包
- NSDictionary Class Reference
- POJ - 1160 Post Office(四边形优化)
- js逻辑运算的特殊之处
- JAVA异常解析
- [PAT (Advanced Level) ]1035. Password 解题文档
- 百度_2015_校招_笔试题_题来了
- android第一课:android开发环境搭建
- SQL Server 2012 新功能
- 计数排序
- Xcode实用工具:Code Snippets
- 乱记-3
- UVA 11174 - Stand in a Line(组合递归计数)
- 重新设置oracle登录账号和密码