PAT A1035
来源:互联网 发布:模拟外汇交易软件 编辑:程序博客网 时间:2024/04/29 16:49
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 R1spOdfa
Sample Output 1:2Team000002 RLsp%dfaTeam000001 R@spodfa
Sample Input 2:1team110 abcdefg332
Sample Output 2:There is 1 account and no account is modified
Sample Input 3:2team110 abcdefg222team220 abcdefg333
Sample Output 3:There are 2 accounts and no account is modified
#include <iostream>using namespace std;struct User{ string name; string password;}user[1005], temp;int main(){ int N, jl = 0; cin>>N; for(int i = 0; i < N; i++){ bool k = false; cin>>temp.name>>temp.password; for(int j = 0; j < temp.password.length(); j++){ if(temp.password[j] == '1'){ temp.password[j] = '@'; k = true; } if(temp.password[j] == '0'){ temp.password[j] = '%'; k = true; } if(temp.password[j] == 'l'){ temp.password[j] = 'L'; k = true; } if(temp.password[j] == 'O'){ temp.password[j] = 'o'; k = true; } } if(k){ user[jl].name = temp.name; user[jl++].password = temp.password; } } if(jl == 0){ if(N == 1) cout<<"There is 1 account and no account is modified"<<endl; if(N > 1) cout<<"There are "<<N<<" accounts and no account is modified"<<endl; }else{ cout<<jl<<endl; for(int i = 0; i < jl; i++){ cout<<user[i].name<<" "<<user[i].password<<endl; } } return 0;}
- PAT A1035
- PAT-A1035
- PAT A1035. Password (20)
- 【PAT】A1035. Password (20)
- PAT---A1035. Password (20)
- PAT A1035. Password (20)
- PAT a1035题解
- PAT:A1035. Password (20/20)
- PAT A1035 Password 三个经验仔细看!
- PAT-A1035. Password (20)(模拟)
- A1035. 素数之和
- A1035. Password (20)
- 刷清橙OJ--A1035.素数之和
- 清橙OJ A1035 素数之和
- Tsinsen 清橙 A1035. 素数之和
- pat
- 【PAT】
- PAT
- Jstl存储集合
- OpenCV学习笔记(十四)圆检测技术
- 我的linux笔记——配置jdk/tomcat/mysql
- 开发技巧小结
- Activity遮罩效果的实现
- PAT A1035
- Windows下启动/关闭oracle、执行SQL的bat脚本
- PAT —–B1016 部分A + B
- 集合 - Array && ArrayList
- 前后端分离架构中的接口设计
- Linux 系统启动过程
- 如何使应用程序只运行一个实例
- MatConvnet工具箱文档翻译理解一
- 需求分析