func_code_string: #include <bits/stdc++.h>   using namespace std;   long long solve() {     pair<long long, long long> init, final;     cin >> init.first >> init.second >> final.first >> final.second;     long long n;     cin >> n;     string s;     cin >> s;     pair<long long, long long> pre[n], cur = {0, 0};     map<char, pair<long long, long long> > dir;     dir[ L ] = make_pair(-1, 0);     dir[ R ] = make_pair(1, 0);     dir[ U ] = make_pair(0, 1);     dir[ D ] = make_pair(0, -1);     for (long long i = 0; i < n; ++i)       cur.first += dir[s[i]].first, cur.second += dir[s[i]].second, pre[i] = cur;     long long l = 0, r = 1e18;     while (r - l > 1) {       long long mid = (r + l) / 2;       long long x = init.first + (mid / n) * pre[n - 1].first,                 y = init.second + (mid / n) * pre[n - 1].second;       if (mid % n) x += (pre[mid % n - 1].first), y += (pre[mid % n - 1].second);       if (abs(x - final.first) + abs(y - final.second) <= mid)         r = mid;       else         l = mid;     }     if (r > 1e17) r = -1;     cout << r <<   n ;     return 0;   }   signed main() {     ios::sync_with_stdio(0);     cin.tie(0);     cout.tie(0);     solve();     return 0;   }   