Reversing Encryption(Reverse函数的应用)

A string ss of length nn can be encrypted by the following algorithm:

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

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

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

Output
Print a string ss such that the above algorithm results in tt.

Examples
Input
10
rocesfedoc
Output
codeforces
Input
16
plmaetwoxesisiht
Output
thisisexampletwo
Input
1
z
Output
z
Note
The first example is described in the problem statement.
题意:给出一个n长度大小的字符串s,经过他的因子个数的就进行几次翻转，让你求最初的字符串。
题解：模拟 那就从2开始判断是不是n的因子，是的话，就翻转从前面到因子的字符串

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
int main()
{
    int n;
    char s[110];
    while(scanf("%d",&n)!=EOF)
    {
        scanf("%s",s);
        for(int i=1; i<=n; i++)
        {
            if(n%i == 0)
            {
                reverse(s,s+i);
            }
        }
        cout<<s<<endl;
    }
    return 0;
}