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.

Input
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.

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

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的因数由大到小排列，每次反转前n的相应因数的长度。解密就是把因数从小到大排列，每次反转前相应因数个字符。

tip：是n的因数不是n每次除2的数

#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
#include <stdlib.h>
#include <stack>
#include <queue>
#include <cstdio>
#include <string>
#include <string.h>
#include <math.h>
#define N 400010
using namespace std;
int main()
{
    int n,m;
    string s;
    cin>>n;
    cin>>s;
    queue<int>q;
    for(int i=1; i<=n; i++)//求n的因数
    {
        if(n%i==0)
        {
            q.push(i);
        }

    }
    while(!q.empty())
    {
        reverse(s.begin(),s.begin()+q.front());
        q.pop();
    }
    cout<<s<<endl;
    return 0;
}