7-143 4204 W密码
强度挺高的模拟题,不会单测的有福了(
#include <algorithm>
#include <cstdint>
#include <iostream>
#include <limits>
#include <numeric>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using i32 = std::int32_t;
using i64 = std::int64_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
using pii = std::pair<i32, i32>;
using pll = std::pair<i64, i64>;
using vi = std::vector<i32>;
using vll = std::vector<i64>;
using vpii = std::vector<pii>;
using vpll = std::vector<pll>;
void solve();
int main()
{
std::cin.tie(nullptr)->sync_with_stdio(false);
solve();
}
struct group_info
{
vi group1, group2, group3;
};
group_info get_group(const std::string &str)
{
group_info info;
for (u64 i = 0; i < str.length(); ++i)
{
if ('a' <= str[i] && str[i] <= 'i')
{
info.group1.emplace_back(i);
}
else if ('j' <= str[i] && str[i] <= 'r')
{
info.group2.emplace_back(i);
}
else
{
info.group3.emplace_back(i);
}
}
return info;
}
std::string single_group_apply(const std::string &str, const vi &group, i32 k)
{
vi new_group{group};
for (u64 i = 0; i < group.size(); ++i)
{
u64 index{(i + k) % group.size()};
new_group[index] = group[i];
}
std::string result{str};
for (u64 i = 0; i < group.size(); ++i)
{
result[group[i]] = str[new_group[i]];
}
return result;
}
std::string decrypt(const std::string &str, i32 k1, i32 k2, i32 k3)
{
std::string result{str};
result = single_group_apply(result, get_group(result).group1, k1);
result = single_group_apply(result, get_group(result).group2, k2);
result = single_group_apply(result, get_group(result).group3, k3);
return result;
}
void solve()
{
i32 k1, k2, k3;
bool endl{false};
while (std::cin >> k1 >> k2 >> k3)
{
if (k1 == 0 && k2 == 0 && k3 == 0)
{
return;
}
if (endl)
{
std::cout << '\n';
}
std::string data;
std::cin >> data;
std::cout << decrypt(data, k1, k2, k3);
endl = true;
}
}

浙公网安备 33010602011771号