func_code_string: #include <bits/stdc++.h>   using namespace std;   long long ans1, ans2;   int n;   char s[111111];   long long a[111111], pa[111111], b[111111], pb[111111];   inline long long get(long long x, int first) {     long long t = first, ans = 0;     while (t <= x) {       ans += (x + 1 - t);       t += 2;     }     return ans;   }   inline void solve(long long *a, long long *b, int n) {     long long sum1 = 0, sum2 = 0;     for (int i = 1; i <= n; i++) {       if (b[i] % 2 == 0) {         int r = b[i] + a[i] - 1;         if (r % 2 == 0)           sum1 += a[i] / 2, sum2 += a[i] / 2 + 1;         else if (r % 2 == 1)           sum1 += a[i] / 2, sum2 += a[i] / 2;       } else if (b[i] % 2 == 1) {         int r = b[i] + a[i] - 1;         if (r % 2 == 0)           sum1 += a[i] / 2, sum2 += a[i] / 2;         else if (r % 2 == 1)           sum1 += a[i] / 2 + 1, sum2 += a[i] / 2;       }     }     for (int i = 1; i <= n; i++) {       int r = b[i] + a[i] - 1;       if (b[i] % 2 == 0) {         if (r % 2 == 0)           sum1 -= a[i] / 2, sum2 -= a[i] / 2 + 1;         else if (r % 2 == 1)           sum1 -= a[i] / 2, sum2 -= a[i] / 2;       } else if (b[i] % 2 == 1) {         if (r % 2 == 0)           sum1 -= a[i] / 2, sum2 -= a[i] / 2;         else if (r % 2 == 1)           sum1 -= a[i] / 2 + 1, sum2 -= a[i] / 2;       }       if (b[i] % 2 == 0) {         if (r % 2 == 0)           ans2 += (a[i] / 2) * sum2, ans2 += (a[i] / 2 + 1) * sum1,               ans1 += (a[i] / 2) * sum1, ans1 += (a[i] / 2 + 1) * sum2;         else if (r % 2 == 1)           ans2 += (a[i] / 2) * sum2, ans2 += (a[i] / 2) * sum1,               ans1 += (a[i] / 2) * sum1, ans1 += (a[i] / 2) * sum2;       } else if (b[i] % 2 == 1) {         if (r % 2 == 0)           ans2 += (a[i] / 2) * sum2, ans2 += (a[i] / 2) * sum1,               ans1 += (a[i] / 2) * sum1, ans1 += (a[i] / 2) * sum2;         else if (r % 2 == 1)           ans2 += (a[i] / 2) * sum1, ans2 += (a[i] / 2 + 1) * sum2,               ans1 += (a[i] / 2) * sum2, ans1 += (a[i] / 2 + 1) * sum1;       }       ans1 += get(a[i], 1);       ans2 += get(a[i], 2);     }   }   int main() {     scanf( %s , s);     int len = strlen(s);     int t = 1;     a[1] = 1;     pa[1] = 0;     for (int i = 1; i < len; i++)       if (s[i - 1] == s[i])         a[t]++;       else         a[++t] = 1, pa[t] = i;     int t1 = 0;     for (int i = 1; i <= t; i++)       if (i % 2 == 1) b[++t1] = a[i], pb[t1] = pa[i];     ans1 = 0, ans2 = 0;     solve(b, pb, t1);     t1 = 0;     for (int i = 1; i <= t; i++)       if (i % 2 == 0) b[++t1] = a[i], pb[t1] = pa[i];     solve(b, pb, t1);     cout << ans2 <<     << ans1 << endl;     return 0;   }   