1035. Password (20)
来源:互联网 发布:java 干10年工资多少 编辑:程序博客网 时间:2024/05/01 18:20
考察对应字符转化以及信息记录
#include<iostream>#include<string.h>#include<vector>typedef struct user{char name[20];char password[20];bool modified;}User;bool IsModified(User& a){int len = strlen(a.password);bool ret = false;for(int i = 0; i < len; ++i){if(a.password[i] == '1'){a.password[i] = '@';ret = true;}else if(a.password[i] == '0'){a.password[i] = '%';ret = true;}else if(a.password[i] == 'l'){a.password[i] = 'L';ret = true;}else if(a.password[i] == 'O'){a.password[i] = 'o';ret = true;}}return ret;}int main(){int N;while(scanf("%d", &N) != EOF){std::vector<User> userVec(N);int modifiedCnt = 0;for(int i = 0; i < N; ++i){scanf("%s %s",userVec[i].name, userVec[i].password);if( IsModified(userVec[i]) ){userVec[i].modified = true;modifiedCnt++;}else userVec[i].modified = false;}//outputif(modifiedCnt == 0){if(N <= 1)printf("There is %d account and no account is modified\n", N);elseprintf("There are %d accounts and no account is modified\n", N);}else{printf("%d\n", modifiedCnt);for(int i = 0; i < N; ++i){if(true == userVec[i].modified){printf("%s %s\n", userVec[i].name, userVec[i].password);}}}}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)
- 1033. To Fill or Not to Fill (25)
- sql存储过程
- 1034. Head of a Gang (30)
- 安卓 异步方法总结
- Notifiction
- 1035. Password (20)
- firebreah开发插件(同时适用IE和chrome、firefox等非IE)
- 八皇后问题回溯算法
- 二进制,八进制,十进制,十六进制之间转换问题
- hdu4333——拓展kmp
- POJ3062:Celebrity jeopardy
- 1036. Boys vs Girls (25)
- DAY01
- 找出N个数中最大的K个不同的浮点数