1035. Password (20)
2015-11-30 20:32
351 查看
1035. Password (20)
时间限制400 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
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>
#include <vector>
using namespace std;
bool check(char* str) {
for (int i = 0; str[i]; ++i)
if (str[i] == '1' || str[i] == '0' || str[i] == 'l' || str[i] == 'O')
return false;
return true;
}
void change(char* str) {
for (int i = 0; str[i]; ++i) {
if (str[i] == '1') str[i] = '@';
else if (str[i] == '0') str[i] = '%';
else if (str[i] == 'l') str[i] = 'L';
else if (str[i] == 'O') str[i] = 'o';
}
}
struct node{
char name[20], pwd[20];
};
int main() {
vector<node> v;
struct node tmp;
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%s%s", tmp.name, tmp.pwd);
if (check(tmp.pwd) == false) {
change(tmp.pwd);
v.push_back(tmp);
}
}
if (v.size() == 0) {
if (n == 1)
puts("There is 1 account and no account is modified");
else
printf("There are %d accounts and no account is modified\n", n);
}
else {
printf("%ld\n", v.size());
for (int i = 0; i < v.size(); ++i)
printf("%s %s\n", v[i].name, v[i].pwd);
}
return 0;
}
相关文章推荐
- UITableView
- 【Java EE (Struts2 + Spring + Hibernate)开发】:Struts2(二)之【控制文件上传和下载】
- C语言根据路径打开文件内容
- win32api大全
- C library function - tmpfile()
- NYOJ 108士兵杀敌(一)
- 真的有一生顺遂没有挫折苦难的人生吗?
- 有用的dede表单代码
- 《算法竞赛入门经典2ndEdition 》例题3-6 环状序列(Circular Sequence, Uva1584)
- 十一月英语总结——英语需要每天都保持热情
- sql.Date与util.Date日期格式化和转换
- 汉诺塔IV
- 找出无向图汇总的相连要素
- xcode常见报错调试【转载】
- 关于java中的值传递问题
- Bootstrap历练实例:简单的可折叠
- 子类和父类构造方法的执行先后问题
- 以蓝牙开发的视觉解读微信Airsync协议
- https 双向认证开发实践
- 使用appcompat这个包之后出现Attribute "height" has already been defined这个问题。