加密策略已给出,直接模拟硬搞吧。。没什么技术含量,耐心读题细节上不要错了,J的话就直接当成I处理,在最开始就预处理掉,然后任意相邻字母如果相同就插入Q,如果相同字母是Q就插入Z,最后字串长度若为奇数则最后插入Q,最后字母是Q的话就插Z,弄完之后再在矩阵里找相应的密文。。总之有点小繁琐,绕的晕死
#include<cstdio>
#include<cstring>
#include<vector>
#include<map>
using namespace std;
int main()
{
char key[100], s[100], c[5][5];
bool flag[26];
vector<char> v;
vector<char> res;
map<char, pair<int, int> > mp;
while (gets(key), strcmp("999", key))
{
gets(s);
for (int i = 0; key[i] != '\0'; i++)
if (key[i] == 'J')
key[i] = 'I';
for (int i = 0; s[i] != '\0'; i++)
if (s[i] == 'J')
s[i] = 'I';
memset(flag, 0, sizeof(flag));
flag['J' - 'A'] = true;
v.clear();
res.clear();
mp.clear();
for (int i = 0; key[i] != '\0'; i++)
if (!flag[key[i] - 'A'])
{
flag[key[i] - 'A'] = true;
v.push_back(key[i]);
}
for (int i = 0; i < 26; i++)
if (!flag[i])
v.push_back('A' + i);
for (int i = 0; i < 5; i++)
for (int j = 0; j < 5; j++)
{
c[i][j] = v[i * 5 + j];
mp[v[i * 5 + j]] = make_pair(i, j);
}
for (int i = 0; s[i] != '\0'; i++)
{
if (s[i] == ' ')
continue;
if (!res.empty() && res.back() == s[i])
res.push_back(s[i] == 'Q' ? 'Z' : 'Q');
res.push_back(s[i]);
}
if (res.size() % 2)
res.push_back(res.back() == 'Q' ? 'Z' : 'Q');
int r1, c1, r2, c2;
char ch1, ch2;
for (size_t i = 0; i < res.size(); i += 2)
{
r1 = mp[res[i]].first;
c1 = mp[res[i]].second;
r2 = mp[res[i + 1]].first;
c2 = mp[res[i + 1]].second;
if (c1 == c2)
{
ch1 = c[(r1 + 1) % 5][c1];
ch2 = c[(r2 + 1) % 5][c2];
}
else if (r1 == r2)
{
ch1 = c[r1][(c1 + 1) % 5];
ch2 = c[r2][(c2 + 1) % 5];
}
else
{
ch1 = c[r1][c2];
ch2 = c[r2][c1];
}
printf(i ? " %c%c" : "%c%c", ch1, ch2);
}
puts("");
}
return 0;
}