func_code_string: #include <bits/stdc++.h>   using namespace std;   long long pwr(long long base, long long p, long long mod = (1000000007LL)) {     long long ans = 1;     while (p) {       if (p & 1) ans = (ans * base) % mod;       base = (base * base) % mod;       p /= 2;     }     return ans;   }   long long gcd(long long a, long long b) {     if (b == 0) return a;     return gcd(b, a % b);   }   long long nCr(long long n, long long r) {     long long C[r + 1];     memset(C, 0, sizeof(C));     C[0] = 1;     for (long long i = 1; i <= n; i++)       for (long long j = min(i, r); j > 0; j--) C[j] = C[j] + C[j - 1];     return C[r];   }   bool isPrime(long long n) {     if (n <= 1) return false;     if (n == 2) return true;     if (n % 2 == 0) return false;     long long m = sqrt(n);     for (long long i = 3; i <= m; i += 2)       if (n % i == 0) return false;     return true;   }   long long M(long long a) { return (a % (1000000007LL)); }   bool isPowerOfTwo(long long x) { return x && (!(x & (x - 1))); }   int main() {     ios::sync_with_stdio(false);     cin.tie(NULL);     cout.tie(0);     int n;     cin >> n;     vector<int> v(n);     for (long long i = 0; i < (long long)(n); ++i) cin >> v[i];     vector<int> ans(n + 1);     for (long long i = 0; i < (long long)(n); ++i) {       vector<int> color_total(n + 1);       int best = 0;       for (int j = i; j < n; j++) {         color_total[v[j]]++;         if (color_total[v[j]] > color_total[best]) {           best = v[j];         } else if (color_total[v[j]] == color_total[best]) {           if (v[j] < best) {             best = v[j];           }         }         ans[best]++;       }     }     for (long long i = 1; i <= (long long)(n); ++i) {       cout << ans[i] <<    ;     }     return 0;   }   