func_code_string: #include <bits/stdc++.h>   using namespace std;   const int maxn = 2e5 + 5;   int a[maxn];   int t[maxn], l[maxn], r[maxn];   int n, m, ans;   void solve(int k) {     int tot = 0;     if (k == 1) {       for (int i = 2; i <= n; i++)         if (a[i] < a[i - 1]) tot++;     } else {       for (int i = 2; i <= n; i++) {         int p = i / k;         if (i % k > 1) p++;         if (a[i] < a[p]) tot++;       }     }     printf( %d  , tot);   }   void prepare() {     l[1] = 2, r[1] = m + 1;     for (int i = l[1]; i <= r[1]; i++)       if (a[i] < a[1]) ans++;     for (int i = l[1]; i <= r[1]; i++) {       l[i] = m * (i - 1) + 2;       if (l[i] > n) l[i] = n + 1;       r[i] = m * i + 1;       if (r[i] > n) r[i] = n;       for (int j = l[i]; j <= r[i]; j++)         if (a[j] < a[i]) ans++;     }     printf( %d  , ans);   }   void deal(int k) {     for (int i = 1; i <= m + 1; i++) {       if (l[i] > r[i]) break;       for (int j = 1; j < i; j++)         if (l[i] <= r[i] && a[l[i]++] < a[i]) ans--;       for (int j = 1; j <= i; j++)         if (r[i] < n && a[++r[i]] < a[i]) ans++;     }     printf( %d  , ans);   }   int main() {     scanf( %d , &n);     for (int i = 1; i <= n; i++) scanf( %d , &a[i]);     m = sqrt(n) + 1;     for (int i = 1; i < m; i++) solve(i);     if (m > n - 1) return 0;     prepare();     for (int i = m + 1; i < n; i++) deal(i);     return 0;   }   