[PAT解题报告] Password
简单题,给定密码替换的规则——比如把1换成@,把0换成%…… 问有多少个密码没改过。 还有注意输出有单数复数之分。
#include <cstdio>
#include <cstring>
#include <string>
using namespace std;
pair<string,string> a[1002];
char team[22],s[22],p[22];
void modify() {
strcpy(p, s);
for (int i = 0; p[i]; ++i) {
switch(p[i]) {
case '1':
p[i] = '@';
break;
case '0':
p[i] = '%';
break;
case 'l':
p[i] = 'L';
break;
case 'O':
p[i] = 'o';
}
}
}
int main() {
int n, m = 0;
scanf("%d",&n);
for (int i = 0; i < n; ++i) {
scanf("%s%s",team, s);
modify();
if (strcmp(p, s)) {
a[m++] = make_pair((string) team, (string) p);
}
}
if (m) {
printf("%d\n",m);
for (int i = 0; i < m; ++i) {
printf("%s %s\n",a[i].first.c_str(), a[i].second.c_str());
}
}
else {
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);
}
}
return 0;
}
原题链接: http://www.patest.cn/contests/pat-a-practise/1035