Reversing Encryption（不同的思路：数学方法&&找规律）

题目描述
A string s of length n can be encrypted by the following algorithm:

iterate over all divisors of n in decreasing order (i.e. from n to 1),
for each divisor d, reverse the substring s[1…d] (i.e. the substring which starts at position 1 and ends at position d).
For example, the above algorithm applied to the string s=“codeforces” leads to the following changes: “codeforces” → “secrofedoc” → “orcesfedoc” → “rocesfedoc” → “rocesfedoc” (obviously, the last reverse operation doesn’t change the string because d=1).

You are given the encrypted string t. Your task is to decrypt this string, i.e., to find a string s such that the above algorithm results in string t. It can be proven that this string s always exists and is unique.

输入
The first line of input consists of a single integer n (1≤n≤100) — the length of the string t. The second line of input consists of the string t. The length of t is n, and it consists only of lowercase Latin letters.

输出
Print a string s such that the above algorithm results in t.

样例
输入
10
rocesfedoc
输出
codeforces
输入
16
plmaetwoxesisiht
输出
thisisexampletwo
输入
1
z
输出
z

思路
题目意思就很清楚，解密的过程是按降序将n的因子反转，所以加密的过程应该反过来，即按升序。我从一开始理解错误，弄成了解密过程，但我觉得肯定有规律，就一直找规律，结果wa了好几发，就看了下别人ac的代码，结果全是用函数reverse去做的，没有其他的做法。本来这个题有点水，但因为没有人用这种方法，我就发出来了。可能也有跟我有一样想法的人，给他们做参考。

推理过程
10的因子：2，5，10

rocesfedoc ------k的初始值就是a[i]的初始位置，a[0]为r的位置变换记录
即k数组的值是：0，1，2，3，4，5，6，7，8，9

d=2