CodeForces - 999B

最新推荐文章于 2018-11-07 23:14:48 发布

原创最新推荐文章于 2018-11-07 23:14:48 发布 · 218 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一种字符串加密算法——G-ReversingEncryption，并提供了一个具体的实现示例。该算法通过按长度的约数逆序子串来加密字符串。文章详细解释了算法流程，并展示了如何使用C++编程语言实现这一加密过程。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

G - Reversing Encryption

CodeForces - 999B

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 nn (1≤n≤1001≤n≤100) — the length of the string tt. The second line of input consists of the string tt. The length of ttis 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

#include"iostream"
#include"algorithm"
#include"vector"
#include"stack"
#include"queue"
#include"map"
#include"string"
#include"cstdio"
using namespace std;
int main()
{
   int i,a;
   string n;
   cin>>a>>n;
   for(i=1;i<=a;i++)
   {
       if(a%i==0)
       reverse(n.begin(),n.begin()+i);
   }
   cout<<n<<endl;
   return 0;
}