PAT甲级1035. Password (20)
来源:互联网 发布:c读取txt文件存入数组 编辑:程序博客网 时间:2024/05/19 02:04
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 judge 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:
3
Team000002 Rlsp0dfa
Team000003 perfectpwd
Team000001 R1spOdfa
Sample Output 1:
2
Team000002 RLsp%dfa
Team000001 R@spodfa
Sample Input 2:
1
team110 abcdefg332
Sample Output 2:
There is 1 account and no account is modified
Sample Input 3:
2
team110 abcdefg222
team220 abcdefg333
Sample Output 3:
There are 2 accounts and no account is modified
#include <iostream>#include <string>#include <vector>using namespace std;struct account{ string name; string password; account(string x,string y):name(x),password(y){ }};int main(){ int N; cin>>N; vector<account> V; //存储modified account int flag=0; for(int i=0;i<N;i++){ string User_name,Password; cin>>User_name>>Password; flag=0; for(int j=0;j<Password.length();j++){ if(Password[j]=='1') { Password[j]='@'; flag=1; } else if(Password[j]=='0'){ Password[j]='%'; flag=1; } else if(Password[j]=='l') { Password[j]='L'; flag=1; } else if(Password[j]=='O'){ Password[j]='o'; flag=1; } else continue; } if(flag) V.push_back(account(User_name,Password)); } if(N==1&&V.size()==0) cout<<"There is 1 account and no account is modified"<<endl; else if(V.size()==0) cout<<"There are "<<N<<" accounts and no account is modified"<<endl; else { cout<<V.size()<<endl; for(int i=0;i<V.size();i++){ cout<<V[i].name<<" "<<V[i].password<<endl; } } 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)
- SQL高级语句-CREATE TABLE 用于创建数据库中的表
- GridLayout 居中显示
- 通过Hibernate操纵对象(上)
- codeforces 777E Hanoi Factory
- VMware下网络配置三种模式对比(桥接模式,主机模式,网络地址转换)
- PAT甲级1035. Password (20)
- 关于HTTP协议,一篇就够了
- nmap网络发现工具记录
- 【C++】《C++ Primer Plus》笔记(3)——数组
- 《云计算架构技术与实践》连载23:2.4.8 电信NFV云
- jQuery基础
- numpy使用技巧之数组过滤
- monkey自动化测试
- Java四类八种数据类型