func_code_string: #include <bits/stdc++.h>   using namespace std;   const int SIZE = 100005;   int gap, tmp[SIZE * 2];   class SuffixArray {    public:     int sa[SIZE], rk[SIZE], ht[SIZE];     static bool cmp(int x, int y) {       if (tmp[x] != tmp[y]) return tmp[x] < tmp[y];       return tmp[x + gap] < tmp[y + gap];     }     void gao(const char* s, int n) {       copy(s, s + n + 1, rk);       for (gap = 1; gap <= n; gap <<= 1) {         for (int i = 0; i <= n; i++) sa[i] = i;         copy(rk, rk + n + 1, tmp);         sort(sa, sa + n + 1, cmp);         for (int i = rk[*sa] = 0; i < n; i++)           rk[sa[i + 1]] = rk[sa[i]] + cmp(sa[i], sa[i + 1]);       }       for (int i = gap = ht[*sa] = 0; i < n; i++) {         if (gap) --gap;         while (s[i + gap] == s[sa[rk[i] - 1] + gap]) gap++;         ht[rk[i]] = gap;       }     }   };   char str[SIZE];   SuffixArray SA;   int main() {     int n = strlen(gets(str));     long long ans = n * (n + 1ll) / 2, cnt = 0;     SA.gao(str, n);     vector<int> u = {0};     for (int i = 1; i <= n; i++) {       while (SA.ht[i] < SA.ht[u.back()]) {         cnt -= SA.ht[u.back()] * (u.back() - u[u.size() - 2]);         u.pop_back();       }       u.push_back(i);       cnt += SA.ht[u.back()] * (u.back() - u[u.size() - 2]);       ans += cnt;     }     printf( %I64d n , ans);   }   