func_code_string: #include <bits/stdc++.h>   #pragma GCC optimize( Ofast )   using namespace std;   long long max(long long a, long long b) {     if (a > b) {       return a;     } else {       return b;     }   }   long long min(long long a, long long b) {     if (a < b) {       return a;     } else {       return b;     }   }   long long power(long long b, long long e) {     if (e == 0) return 1;     if (e % 2)       return ((b * power((b) * (b), (e - 1) / 2)));     else       return power((b) * (b), e / 2);   }   long long modpower(long long b, long long e, long long q) {     long long MOD = q;     if (e == 0) return 1;     if (e % 2)       return ((b % MOD) * modpower((b % MOD) * (b % MOD), (e - 1) / 2, q)) % MOD;     else       return modpower((b % MOD) * (b % MOD), e / 2, q) % MOD;   }   void dpv(vector<long long> v) {     for (long long i = 0; i < v.size(); i++) {       cout << v[i] <<    ;     }     cout <<   n ;   }   void dpv(vector<pair<long long, long long> > v) {     for (long long i = 0; i < v.size(); i++) {       cout << v[i].first <<     << v[i].second <<   n ;     }   }   void dpv(set<long long> v) {     for (auto i : v) {       cout << i <<    ;     }     cout <<   n ;   }   void oblivious() {     string s;     cin >> s;     long long p = 0, ans = 0, q = 1;     for (long long i = 0; i <= s.length(); i++) {       if (s[i] ==  +  || s[i] ==  -  || i == s.length()) {         ans += p * q;         p = 0;         if (i == s.length()) {           continue;         }         if (s[i] ==  + ) {           q = 1;         } else if (s[i] ==  - ) {           q = -1;         }       } else {         p = (10 * p + s[i] -  0 );       }     }     long long u = ans;     long long y = 0;     string s1;     if (u == 0) {       s1.push_back( 0 );     } else {       while (u != 0) {         s1.push_back(u % 10 +  0 );         u = u / 10;       }     }     reverse(s1.begin(), s1.end());     for (long long i = 0; i < s1.length(); i++) {       long long z = s1[i];       while (z--) {         cout <<  + ;       }       cout <<  .> ;       cout <<   n ;     }   }   signed main() {     ios_base::sync_with_stdio(0);     cin.tie(0);     cout.tie(0);     long long t = 1;     while (t--) {       oblivious();     }     return 0;   }   