Reversing Encryption

http://codeforces.com/contest/999/problem/B

问题描述：

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\dots 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" $\to$"secrofedoc" $\to$ "orcesfedoc" $\to$ "rocesfedoc" $\to$ "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\le n\le 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$.

问题分析：题目大意就是从1到n遍历，遇到n的因子就把字符串翻转。

AC代码:：

#include <iostream>
#include<iomanip>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<set>
#include<stack>
#include<queue>
using namespace std;

const int N = 1005;

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n;
	string s;
	cin>>n>>s;
	
	for(int i = 1;i <= n;i++){
		if(n % i == 0){
			reverse(s.begin(),s.begin()+i);
		}
	}
	cout<<s<<endl;
	return 0;
}

python:

n, t = int(input()), input()
for i in range(1, n+1):
    if n % i == 0: t = t[i-1::-1] + t[i:]
print(t)