Add a bunch of other problems.

Some are not finished...

Codeforces Round 1017 (Div. 4)/A. Trippi Troppi.cpp

@@ -0,0 +1,85 @@
+/* Problem URL: https://codeforces.com/contest/2094/problem/A */
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define V vector
+
+#define rmin(a, b) a = min(a, b)
+#define rmax(a, b) a = max(a, b)
+
+#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
+#define nrep(i, s, lim) for (size_t i = s; i < (lim); i++)
+
+#define repv(i, v) for (auto &i : (v))
+#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
+#define sortv(v) sort(v.begin(), v.end())
+#define all(v) (v).begin(), (v).end()
+
+using vi = vector<int>;
+using vvi = vector<vi>;
+using vvvi = vector<vvi>;
+using vvvvi = vector<vvvi>;
+
+using ll = long long;
+
+using vl = vector<ll>;
+using vvl = vector<vl>;
+using vvvl = vector<vvl>;
+using vvvvl = vector<vvvl>;
+
+template<class v>
+auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
+    os << vec[0];
+    for (size_t i = 1; i < vec.size(); i++) {
+        os << ' ' << vec[i];
+    }
+    os << '\n';
+    return os;
+}
+
+template<class v>
+auto operator>>(istream &is, vector<v> &vec)->istream& {
+    for (auto &i : vec) {
+        is >> i;
+    }
+    return is;
+}
+
+template<class v>
+auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
+    for (auto &i : vec) {
+        os << i[0];
+        for (size_t j = 1; j < i.size(); j++) {
+            os << ' ' << i[j];
+        }
+        os << '\n';
+    }
+    return os;
+}
+
+template<class v>
+auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
+    for (auto &i : vec) {
+        for (auto &j : i) {
+            is >> j;
+        }
+    }
+    return is;
+}
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int t;
+    cin >> t;
+    while (t--) {
+        string a, b, c;
+        cin >> a >> b >> c;
+
+        cout << a[0] << b[0] << c[0] << '\n';
+    }
+}

Codeforces Round 1017 (Div. 4)/B. Bobritto Bandito.cpp

@@ -0,0 +1,95 @@
+/* Problem URL: https://codeforces.com/contest/2094/problem/B */
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define V vector
+
+#define rmin(a, b) a = min(a, b)
+#define rmax(a, b) a = max(a, b)
+
+#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
+#define nrep(i, s, lim) for (size_t i = s; i < (lim); i++)
+
+#define repv(i, v) for (auto &i : (v))
+#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
+#define sortv(v) sort(v.begin(), v.end())
+#define all(v) (v).begin(), (v).end()
+
+using vi = vector<int>;
+using vvi = vector<vi>;
+using vvvi = vector<vvi>;
+using vvvvi = vector<vvvi>;
+
+using ll = long long;
+
+using vl = vector<ll>;
+using vvl = vector<vl>;
+using vvvl = vector<vvl>;
+using vvvvl = vector<vvvl>;
+
+template<class v>
+auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
+    os << vec[0];
+    for (size_t i = 1; i < vec.size(); i++) {
+        os << ' ' << vec[i];
+    }
+    os << '\n';
+    return os;
+}
+
+template<class v>
+auto operator>>(istream &is, vector<v> &vec)->istream& {
+    for (auto &i : vec) {
+        is >> i;
+    }
+    return is;
+}
+
+template<class v>
+auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
+    for (auto &i : vec) {
+        os << i[0];
+        for (size_t j = 1; j < i.size(); j++) {
+            os << ' ' << i[j];
+        }
+        os << '\n';
+    }
+    return os;
+}
+
+template<class v>
+auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
+    for (auto &i : vec) {
+        for (auto &j : i) {
+            is >> j;
+        }
+    }
+    return is;
+}
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int t;
+    cin >> t;
+    while (t--) {
+        int n, m, l, r;
+        cin >> n >> m >> l >> r;
+
+        while (l < 0 && n > m) {
+            l++;
+            n--;
+        }
+
+        while (r > 0 && n > m) {
+            r--;
+            n--;
+        }
+
+        cout << l << ' ' << r << '\n';
+    }
+}

Codeforces Round 1017 (Div. 4)/C. Brr Brrr Patapim.cpp

@@ -0,0 +1,109 @@
+/* Problem URL: https://codeforces.com/contest/2094/problem/C */
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define V vector
+
+#define rmin(a, b) a = min(a, b)
+#define rmax(a, b) a = max(a, b)
+
+#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
+#define nrep(i, s, lim) for (size_t i = s; i < (lim); i++)
+
+#define repv(i, v) for (auto &i : (v))
+#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
+#define sortv(v) sort(v.begin(), v.end())
+#define all(v) (v).begin(), (v).end()
+
+using vi = vector<int>;
+using vvi = vector<vi>;
+using vvvi = vector<vvi>;
+using vvvvi = vector<vvvi>;
+
+using ll = long long;
+
+using vl = vector<ll>;
+using vvl = vector<vl>;
+using vvvl = vector<vvl>;
+using vvvvl = vector<vvvl>;
+
+template<class v>
+auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
+    os << vec[0];
+    for (size_t i = 1; i < vec.size(); i++) {
+        os << ' ' << vec[i];
+    }
+    os << '\n';
+    return os;
+}
+
+template<class v>
+auto operator>>(istream &is, vector<v> &vec)->istream& {
+    for (auto &i : vec) {
+        is >> i;
+    }
+    return is;
+}
+
+template<class v>
+auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
+    for (auto &i : vec) {
+        os << i[0];
+        for (size_t j = 1; j < i.size(); j++) {
+            os << ' ' << i[j];
+        }
+        os << '\n';
+    }
+    return os;
+}
+
+template<class v>
+auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
+    for (auto &i : vec) {
+        for (auto &j : i) {
+            is >> j;
+        }
+    }
+    return is;
+}
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int t;
+    cin >> t;
+    while (t--) {
+        int n;
+        cin >> n;
+
+        V<bool> exists(2 * n, false);
+        vvi perm(n, vi(n));
+        cin >> perm;
+
+        vi ans(2 * n);
+
+        rep(i, n) {
+            ans[i + 1] = perm[0][i];
+            exists[perm[0][i] - 1] = true;
+        }
+
+        nrep(i, 1, n) {
+            rep(j, n) {
+                ans[i + j + 1] = perm[i][j];
+                exists[perm[i][j] - 1] = true;
+            }
+        }
+        
+        rep(i, 2 * n) {
+            if (!exists[i]) {
+                ans[0] = i + 1;
+            }
+        }
+
+        cout << ans;
+    }
+}

Codeforces Round 1017 (Div. 4)/D. Tung Tung Sahur.cpp

@@ -0,0 +1,150 @@
+/* Problem URL: https://codeforces.com/contest/2094/problem/D */
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define V vector
+
+#define rmin(a, b) a = min(a, b)
+#define rmax(a, b) a = max(a, b)
+
+#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
+#define nrep(i, s, lim) for (size_t i = s; i < (lim); i++)
+
+#define repv(i, v) for (auto &i : (v))
+#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
+#define sortv(v) sort(v.begin(), v.end())
+#define all(v) (v).begin(), (v).end()
+
+using vi = vector<int>;
+using vvi = vector<vi>;
+using vvvi = vector<vvi>;
+using vvvvi = vector<vvvi>;
+
+using ll = long long;
+
+using vl = vector<ll>;
+using vvl = vector<vl>;
+using vvvl = vector<vvl>;
+using vvvvl = vector<vvvl>;
+
+template<class v>
+auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
+    os << vec[0];
+    for (size_t i = 1; i < vec.size(); i++) {
+        os << ' ' << vec[i];
+    }
+    os << '\n';
+    return os;
+}
+
+template<class v>
+auto operator>>(istream &is, vector<v> &vec)->istream& {
+    for (auto &i : vec) {
+        is >> i;
+    }
+    return is;
+}
+
+template<class v>
+auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
+    for (auto &i : vec) {
+        os << i[0];
+        for (size_t j = 1; j < i.size(); j++) {
+            os << ' ' << i[j];
+        }
+        os << '\n';
+    }
+    return os;
+}
+
+template<class v>
+auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
+    for (auto &i : vec) {
+        for (auto &j : i) {
+            is >> j;
+        }
+    }
+    return is;
+}
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int t;
+    cin >> t;
+    while (t--) {
+        string s, t;
+        cin >> s >> t;
+
+        V<pair<int, char>> acts;
+        V<pair<int, char>> actt;
+
+        char prev = 0;
+        int count = 0;
+
+        rep(i, s.size()) {
+            if (prev == 0) {
+                prev = s[i];
+                count = 1;
+                continue;
+            }
+
+            if (prev != s[i]) {
+                acts.emplace_back(count, prev);
+                prev = s[i];
+                count = 1;
+                continue;
+            }
+
+            count++;
+        }
+
+        acts.emplace_back(count, prev);
+
+        prev = 0;
+        count = 0;
+
+        rep(i, t.size()) {
+            if (prev == 0) {
+                prev = t[i];
+                count = 1;
+                continue;
+            }
+
+            if (prev != t[i]) {
+                actt.emplace_back(count, prev);
+                prev = t[i];
+                count = 1;
+                continue;
+            }
+
+            count++;
+        }
+
+        actt.emplace_back(count, prev);
+
+        if (acts.size() != actt.size()) {
+            cout << "NO\n";
+            continue;
+        }
+
+        bool pos = true;
+        rep(i, acts.size()) {
+            if (acts[i].second != actt[i].second) {
+                pos = false;
+                break;
+            }
+
+            if (actt[i].first < acts[i].first || actt[i].first > acts[i].first * 2) {
+                pos = false;
+                break;
+            }
+        }
+
+        cout << (pos ? "YES\n" : "NO\n");
+    }
+}

Codeforces Round 1017 (Div. 4)/E. Boneca Ambalabu.cpp

@@ -0,0 +1,108 @@
+/* Problem URL: https://codeforces.com/contest/2094/problem/E */
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define V vector
+
+#define rmin(a, b) a = min(a, b)
+#define rmax(a, b) a = max(a, b)
+
+#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
+#define nrep(i, s, lim) for (size_t i = s; i < (lim); i++)
+
+#define repv(i, v) for (auto &i : (v))
+#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
+#define sortv(v) sort(v.begin(), v.end())
+#define all(v) (v).begin(), (v).end()
+
+using vi = vector<int>;
+using vvi = vector<vi>;
+using vvvi = vector<vvi>;
+using vvvvi = vector<vvvi>;
+
+using ll = long long;
+
+using vl = vector<ll>;
+using vvl = vector<vl>;
+using vvvl = vector<vvl>;
+using vvvvl = vector<vvvl>;
+
+template<class v>
+auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
+    os << vec[0];
+    for (size_t i = 1; i < vec.size(); i++) {
+        os << ' ' << vec[i];
+    }
+    os << '\n';
+    return os;
+}
+
+template<class v>
+auto operator>>(istream &is, vector<v> &vec)->istream& {
+    for (auto &i : vec) {
+        is >> i;
+    }
+    return is;
+}
+
+template<class v>
+auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
+    for (auto &i : vec) {
+        os << i[0];
+        for (size_t j = 1; j < i.size(); j++) {
+            os << ' ' << i[j];
+        }
+        os << '\n';
+    }
+    return os;
+}
+
+template<class v>
+auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
+    for (auto &i : vec) {
+        for (auto &j : i) {
+            is >> j;
+        }
+    }
+    return is;
+}
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int t;
+    cin >> t;
+    while (t--) {
+        int n;
+        cin >> n;
+
+        vi nums(n);
+        cin >> nums;
+
+        vvl bits(31, vl(2, 0));
+
+        repv(i, nums) {
+            rep(j, 31) {
+                int bit = (i >> j) & 1;
+                bits[j][bit]++;
+            }
+        }
+
+        ll ans = 0;
+        repv(i, nums) {
+            ll attempt = 0;
+            rep(j, 31) {
+                int bit = (i >> j) & 1;
+                attempt += (bits[j][!bit] << j);
+            }
+
+            rmax(ans, attempt);
+        }
+        
+        cout << ans << '\n';
+    }
+}

Codeforces Round 1017 (Div. 4)/F. Trulimero Trulicina.cpp

@@ -0,0 +1,134 @@
+/* Problem URL: https://codeforces.com/contest/2094/problem/F */
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define V vector
+
+#define rmin(a, b) a = min(a, b)
+#define rmax(a, b) a = max(a, b)
+
+#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
+#define nrep(i, s, lim) for (size_t i = s; i < (lim); i++)
+
+#define repv(i, v) for (auto &i : (v))
+#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
+#define sortv(v) sort(v.begin(), v.end())
+#define all(v) (v).begin(), (v).end()
+
+using vi = vector<int>;
+using vvi = vector<vi>;
+using vvvi = vector<vvi>;
+using vvvvi = vector<vvvi>;
+
+using ll = long long;
+
+using vl = vector<ll>;
+using vvl = vector<vl>;
+using vvvl = vector<vvl>;
+using vvvvl = vector<vvvl>;
+
+template<class v>
+auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
+    os << vec[0];
+    for (size_t i = 1; i < vec.size(); i++) {
+        os << ' ' << vec[i];
+    }
+    os << '\n';
+    return os;
+}
+
+template<class v>
+auto operator>>(istream &is, vector<v> &vec)->istream& {
+    for (auto &i : vec) {
+        is >> i;
+    }
+    return is;
+}
+
+template<class v>
+auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
+    for (auto &i : vec) {
+        os << i[0];
+        for (size_t j = 1; j < i.size(); j++) {
+            os << ' ' << i[j];
+        }
+        os << '\n';
+    }
+    return os;
+}
+
+template<class v>
+auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
+    for (auto &i : vec) {
+        for (auto &j : i) {
+            is >> j;
+        }
+    } return is;
+}
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int t;
+    cin >> t;
+    while (t--) {
+        int n, m, k;
+        cin >> n >> m >> k;
+
+        vvi ans(n, vi(m));
+
+        if (k == n) {
+            rep(i, m) {
+                int act = i % k;
+                rep(j, act) {
+                    ans[j][i] = j + n - act + 1;
+                }
+                nrep(j, act, n) {
+                    ans[j][i] = j - act + 1;
+                }
+            }
+
+            cout << ans;
+            continue;
+        }
+
+        if (k == m) {
+            rep(i, n) {
+                int act = i % k;
+
+                rep(j, act) {
+                    ans[i][j] = j + m - act + 1;
+                }
+                nrep(j, act, m) {
+                    ans[i][j] = j - act + 1;
+                }
+            }
+            
+            cout << ans;
+            continue;
+        }
+
+        if (m % k == 0) {
+            rep(i, n) {
+                rep(j, m) {
+                    ans[i][j] = 1 + (m * i + j + (i & 1)) % k;
+                }
+            }
+
+            cout << ans;
+            continue;
+        }
+
+        rep(i, n) {
+            rep(j, m) {
+                ans[i][j] = 1 + (m * i + j) % k;
+            }
+        }
+
+        cout << ans;
+    }
+}

Codeforces Round 1017 (Div. 4)/G. Chimpanzini Bananini.cpp

@@ -0,0 +1,131 @@
+/* Problem URL: https://codeforces.com/contest/2094/problem/G */
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define V vector
+
+#define rmin(a, b) a = min(a, b)
+#define rmax(a, b) a = max(a, b)
+
+#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
+#define nrep(i, s, lim) for (size_t i = s; i < (lim); i++)
+
+#define repv(i, v) for (auto &i : (v))
+#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
+#define sortv(v) sort(v.begin(), v.end())
+#define all(v) (v).begin(), (v).end()
+
+using vi = vector<int>;
+using vvi = vector<vi>;
+using vvvi = vector<vvi>;
+using vvvvi = vector<vvvi>;
+
+using ll = long long;
+
+using vl = vector<ll>;
+using vvl = vector<vl>;
+using vvvl = vector<vvl>;
+using vvvvl = vector<vvvl>;
+
+template<class v>
+auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
+    os << vec[0];
+    for (size_t i = 1; i < vec.size(); i++) {
+        os << ' ' << vec[i];
+    }
+    os << '\n';
+    return os;
+}
+
+template<class v>
+auto operator>>(istream &is, vector<v> &vec)->istream& {
+    for (auto &i : vec) {
+        is >> i;
+    }
+    return is;
+}
+
+template<class v>
+auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
+    for (auto &i : vec) {
+        os << i[0];
+        for (size_t j = 1; j < i.size(); j++) {
+            os << ' ' << i[j];
+        }
+        os << '\n';
+    }
+    return os;
+}
+
+template<class v>
+auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
+    for (auto &i : vec) {
+        for (auto &j : i) {
+            is >> j;
+        }
+    }
+    return is;
+}
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int t;
+    cin >> t;
+    while (t--) {
+        int q;
+        cin >> q;
+        list<ll> fds;
+        ll n = 0;
+        ll nums = 0;
+        ll total = 0;
+        ll act = 0;
+        bool rev = false;
+        while (q--) {
+            int op;
+            cin >> op;
+            if (op == 1) {
+                ll num = fds.back();
+                if (rev) {
+                    num = fds.front();
+                }
+                total -= num * n;
+                total += nums - num;
+                total += num;
+                if (rev) {
+                    fds.push_back(num);
+                    fds.pop_front();
+                } else {
+                    fds.push_front(num);
+                    fds.pop_back();
+                }
+                cout << total << '\n';
+            } else if (op == 2) {
+                ll tmp = total - nums;
+                total = act - tmp;
+
+                rev = !rev;
+
+                cout << total << '\n';
+            } else {
+                ll num;
+                cin >> num;
+
+                n++;
+                if (rev) {
+                    fds.push_front(num);
+                } else {
+                    fds.push_back(num);
+                }
+                act += num * n + nums;
+                nums += num;
+                total += num * n;
+                cout << total << '\n';
+            }
+        }
+    }
+}

Codeforces Round 1017 (Div. 4)/H. La Vaca Saturno Saturnita.cpp

@@ -0,0 +1,157 @@
+/* Problem URL: https://codeforces.com/contest/2094/problem/H */
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define V vector
+
+#define rmin(a, b) a = min(a, b)
+#define rmax(a, b) a = max(a, b)
+
+#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
+#define nrep(i, s, lim) for (size_t i = s; i < (lim); i++)
+
+#define repv(i, v) for (auto &i : (v))
+#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
+#define sortv(v) sort(v.begin(), v.end())
+#define all(v) (v).begin(), (v).end()
+
+using vi = vector<int>;
+using vvi = vector<vi>;
+using vvvi = vector<vvi>;
+using vvvvi = vector<vvvi>;
+
+using ll = long long;
+
+using vl = vector<ll>;
+using vvl = vector<vl>;
+using vvvl = vector<vvl>;
+using vvvvl = vector<vvvl>;
+
+template<class v>
+auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
+    os << vec[0];
+    for (size_t i = 1; i < vec.size(); i++) {
+        os << ' ' << vec[i];
+    }
+    os << '\n';
+    return os;
+}
+
+template<class v>
+auto operator>>(istream &is, vector<v> &vec)->istream& {
+    for (auto &i : vec) {
+        is >> i;
+    }
+    return is;
+}
+
+template<class v>
+auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
+    for (auto &i : vec) {
+        os << i[0];
+        for (size_t j = 1; j < i.size(); j++) {
+            os << ' ' << i[j];
+        }
+        os << '\n';
+    }
+    return os;
+}
+
+template<class v>
+auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
+    for (auto &i : vec) {
+        for (auto &j : i) {
+            is >> j;
+        }
+    }
+    return is;
+}
+
+int inf = INT32_MAX >> 1;
+
+static vvi vec(1e5 + 1);
+
+struct persistent_vector {
+    set<int> used;
+
+    void insert(int num, int i) {
+        used.insert(num);
+        vec[num].push_back(i);
+    }
+
+    int get(int num, int i) {
+        auto itr = lower_bound(all(vec[num]), i);
+        if (itr == vec[num].end()) {
+            return inf;
+        }
+
+        return *itr;
+    }
+
+    ~persistent_vector() {
+        for (auto i : used) {
+            vec[i].clear();
+        }
+    }
+};
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    vvi muls(1e5 + 1);
+    nrep(i, 2, 1e5 + 1) {
+        for (int j = i; j <= 1e5; j += i) {
+            muls[j].push_back(i);
+        }
+    }
+
+    int t;
+    cin >> t;
+    while (t--) {
+        int n, q;
+        cin >> n >> q;
+
+        vi nums(n);
+        cin >> nums;
+
+        persistent_vector divs;
+        rep(i, n) {
+            divs.insert(nums[i], i);
+        }
+
+        while (q--) {
+            ll k, l, r;
+            cin >> k >> l >> r;
+
+            l--, r--;
+
+            int now = l;
+            ll ans = 0;
+            while (now <= r) {
+                ll tmp = inf;
+                for (auto i : muls[k]) {
+                    rmin(tmp, (ll)divs.get(i, now));
+                }
+                rmin(tmp, r);
+                ans += k * (tmp - now);
+                while (k % nums[tmp] == 0) {
+                    k /= nums[tmp];
+                }
+
+                now = tmp + 1;
+                ans += k;
+
+                if (k == 1) {
+                    ans += r - now + 1;
+                    break;
+                }
+            }
+
+            cout << ans << '\n';
+        }
+    }
+}