1035. Password (20)
来源:互联网 发布:淘宝网店网页制作 编辑:程序博客网 时间:2024/06/14 03:36
题目链接:https://www.patest.cn/contests/pat-a-practise/1035
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:
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<cstdio>#include<cstring>struct User{ char name[15],pwd[15]; bool mod; User(){ mod=false; }};void modify(char pwd[],int len){ for(int i=0;i<len;i++){ if(pwd[i]=='1') pwd[i]='@'; if(pwd[i]=='0') pwd[i]='%'; if(pwd[i]=='l') pwd[i]='L'; if(pwd[i]=='O') pwd[i]='o'; }}int main(){ int N; scanf("%d",&N); User user[N]; for(int i=0;i<N;i++){ scanf("%s %s",user[i].name,user[i].pwd); } int M=0; for(int i=0;i<N;i++){ char temp[15]; strcpy(temp,user[i].pwd); modify(user[i].pwd,strlen(user[i].pwd)); if(strcmp(temp,user[i].pwd)!=0){ user[i].mod=true; M++; } } if(M==0){ if(N==1) printf("There is 1 account and no account is modified\n"); else printf("There are %d accounts and no account is modified\n",N); }else{ printf("%d\n",M); for(int i=0;i<N;i++){ if(user[i].mod==true) printf("%s %s\n",user[i].name,user[i].pwd); } } return 0;}
- 1035. Password (20)
- 【PAT】1035. Password (20)
- 1035. Password (20)-PAT
- 1035. Password (20)
- 1035. Password (20)
- 1035. Password (20)
- PAT 1035. Password (20)
- 1035. Password (20)
- 1035. Password (20)
- 1035. Password (20)
- 1035. Password (20)
- 1035. Password (20)
- 1035. Password (20)
- 1035. Password (20)
- 1035. Password (20)
- 1035. Password (20)
- 1035. Password (20)
- pat 1035. Password (20)
- 奇怪的C语言——C51编程C语言注意事项
- 微服务架构介绍
- _nop_()函数引发的血案
- Spring Boot 菜鸟教程 21 分布式会话
- 【标记】HDU3466 Proud Merchants (0-1背包)
- 1035. Password (20)
- 十六进制转八进制
- javaScript——Object对象
- C++学习笔记:C的继承与超越——const关键字
- NumPy的ndArray——多维数组对象
- 在Java项目中引入日志
- javaScript——其他引用类型对象
- 堆排序
- 欢迎使用CSDN-markdown编辑器