【华为OJ】简单密码破解
2016-09-09 11:53
330 查看
写得比较。。。
#include <iostream>
#include <string>
using namespace std;
int main()
{
string str1;
cin >> str1;
int length = str1.size();
char *str2 = new char[length];
for (int i = 0;i < length;i++)
{
if( str1[i] == 'a'|| str1[i] == 'b'||str1[i]=='c')
str2[i] = '2';
if (str1[i] == 'd' || str1[i] == 'e' || str1[i] == 'f')
str2[i] = '3';
if (str1[i] == 'g' || str1[i] == 'h' || str1[i] == 'i')
str2[i] = '4';
if (str1[i] == 'j' || str1[i] == 'k' || str1[i] == 'l')
str2[i] = '5';
if (str1[i] == 'm' || str1[i] == 'n' || str1[i] == 'o')
str2[i] = '6';
if (str1[i] == 'p' || str1[i] == 'q' || str1[i] == 'r'||str1[i]=='s')
str2[i] = '7';
if (str1[i] == 't' || str1[i] == 'u' || str1[i] == 'v')
str2[i] = '8';
if (str1[i] == 'w' || str1[i] == 'x' || str1[i] == 'y'||str1[i]=='z')
str2[i] = '9';
if (str1[i] >= '0'&&str1[i] <= '9')
str2[i] = str1[i];
if (str1[i] >= 'A'&&str1[i] < 'Z')
str2[i] = str1[i] - 'A' + 'b' ;
if (str1[i] == 'Z')
str2[i] = 'a';
}
cout << str2;
delete str2;
return 0;
}
#include <iostream>
#include <string>
using namespace std;
int main()
{
string str1;
cin >> str1;
int length = str1.size();
char *str2 = new char[length];
for (int i = 0;i < length;i++)
{
if( str1[i] == 'a'|| str1[i] == 'b'||str1[i]=='c')
str2[i] = '2';
if (str1[i] == 'd' || str1[i] == 'e' || str1[i] == 'f')
str2[i] = '3';
if (str1[i] == 'g' || str1[i] == 'h' || str1[i] == 'i')
str2[i] = '4';
if (str1[i] == 'j' || str1[i] == 'k' || str1[i] == 'l')
str2[i] = '5';
if (str1[i] == 'm' || str1[i] == 'n' || str1[i] == 'o')
str2[i] = '6';
if (str1[i] == 'p' || str1[i] == 'q' || str1[i] == 'r'||str1[i]=='s')
str2[i] = '7';
if (str1[i] == 't' || str1[i] == 'u' || str1[i] == 'v')
str2[i] = '8';
if (str1[i] == 'w' || str1[i] == 'x' || str1[i] == 'y'||str1[i]=='z')
str2[i] = '9';
if (str1[i] >= '0'&&str1[i] <= '9')
str2[i] = str1[i];
if (str1[i] >= 'A'&&str1[i] < 'Z')
str2[i] = str1[i] - 'A' + 'b' ;
if (str1[i] == 'Z')
str2[i] = 'a';
}
cout << str2;
delete str2;
return 0;
}
相关文章推荐
- 华为oj【简单密码破解】
- 华为OJ(简单密码破解)
- 华为OJ中级题-简单密码破解
- 华为OJ 中级 简单密码破解
- 华为 oj 简单密码破解&&汽水瓶&&删除字符串中出现次数最少的字符&&字符串排序
- 华为oj中级 简单密码破解
- 简单密码破解-华为OJ题
- 【华为oj】简单密码破解
- OJ习题:简单密码破解 (JAVA大小写转换)
- 【华为 OJ】简单密码
- Java - 华为机试训练 - 简单密码破解
- oj 1901: 简单密码破解
- 牛客网_华为机试_021_简单密码破解(字符映射)
- 【华为OJ】【020-简单密码】
- 华为机试:简单密码破解、字符串通配符
- Java - 华为机试训练 - 简单密码破解
- OJ------简单密码破解
- 华为OJ——简单密码
- [华为机试练习题]4.简单密码破解
- 华为OJ——简单密码