E、Bogo Sort

import math
n = int(input())
a = list(map(int,input().split()))
vis = [0]*100005
ans = 1
b = []
for i in range(n):
    j = i
    cnt = 0
    while vis[j] == 0:
        vis[j] = 1
        j = a[j] - 1
        cnt += 1
    if cnt:
        b.append(cnt)
for i in b:
    ans = ans // math.gcd(ans,i) * i
print(ans)

F、DPS

#pragma GCC target("avx,sse2,sse3,sse4,popcnt")
#pragma GCC optimize("O2,O3,Ofast,inline,unroll-all-loops,-ffast-math")
#include <bits/stdc++.h>
using namespace std;
#define js ios::sync_with_stdio(false);cin.tie(0); cout.tie(0)
#define all(__vv__) (__vv__).begin(), (__vv__).end()
#define endl "\n"
#define pai pair<int, int>
#define mk(__x__,__y__) make_pair(__x__,__y__)
#define ms(__x__,__val__) memset(__x__, __val__, sizeof(__x__))
typedef long long ll; typedef unsigned long long ull; typedef long double ld;
inline ll read() { ll s = 0, w = 1; char ch = getchar(); for (; !isdigit(ch); ch = getchar()) if (ch == '-') w = -1; for (; isdigit(ch); ch = getchar())    s = (s << 1) + (s << 3) + (ch ^ 48); return s * w; }
inline void print(ll x) { if (!x) { putchar('0'); return; } char F[40]; ll tmp = x > 0 ? x : -x; if (x < 0)putchar('-');    int cnt = 0;    while (tmp > 0) { F[cnt++] = tmp % 10 + '0';        tmp /= 10; }    while (cnt > 0)putchar(F[--cnt]); }
inline ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll qpow(ll a, ll b) { ll ans = 1;    while (b) { if (b & 1)    ans *= a;        b >>= 1;        a *= a; }    return ans; }    ll qpow(ll a, ll b, ll mod) { ll ans = 1; while (b) { if (b & 1)(ans *= a) %= mod; b >>= 1; (a *= a) %= mod; }return ans % mod; }
inline int lowbit(int x) { return x & (-x); }
const int dir[][2] = { {0,1},{1,0},{0,-1},{-1,0},{1,1},{1,-1},{-1,1},{-1,-1} };
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;

const int N = 100 + 7;
int d[N];
int c[N];

int main() {
    int n = read();
    for (int i = 1; i <= n; ++i)    d[i] = read();
    int maxi = *max_element(d + 1, d + 1 + n);
    for (int i = 1; i <= n; ++i)
        c[i] = ceil(50.0 * d[i] / maxi);
    for (int i = 1; i <= n; ++i) {
        putchar('+');
        for (int j = 1; j <= c[i]; ++j)    putchar('-');
        puts("+");
        putchar('|');
        for (int j = 1; j < c[i]; ++j)    putchar(' ');
        if (d[i] == maxi)    putchar('*'); //这里注意是d[i]不是c[i]。有可能最高输出宽度一样但是伤害不一样
        else if (c[i]) putchar(' ');
        putchar('|');
        print(d[i]), putchar(10);
        putchar('+');
        for (int j = 1; j <= c[i]; ++j)    putchar('-');
        puts("+");
    }
    return 0;
}