列变位法解密
Accepts: 296
Submissions: 904
Time Limit: 2000/1000 MS (Java/Others)
Memory Limit: 65536/65536 K (Java/Others)
结题报告:
模拟题,做一下坐标转换就行了。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <set>
#include <queue>
#include <vector>
using namespace std;
#define max(x, y) ((x) > (y) ? (x) : (y))
#define min(x, y) ((x) < (y) ? (x) : (y))
int n;
#define maxn 100010
char input[maxn];
char output[maxn];
void Solve()
{
int len = strlen(input);
int mod = len % n;
int flag = len / n;
int maxFlag = mod ? flag + 1 : flag;
int x = 0, y = 0;
for (int i = 0; i < len; ++i)
{
output[x*n+y] = input[i];
++x;
if (x == maxFlag)
{
x = 0;
++y;
}
if (y >= mod)
{
maxFlag = flag;
}
}
output[len] = 0;
printf("%s\n", output);
}
int main()
{
//freopen("input.txt", "r", stdin);
int times;
scanf("%d", ×);
for (int i = 1; i <= times; ++i)
{
printf("Case #%d:\n", i);
getchar();
gets(input);
scanf("%d", &n);
Solve();
}
return 0;
}