Merge branch 'master' of https://git.puffypony.party/Segcolt/cses-solutions

.gdb_history

@@ -1,103 +1,3 @@
-p pref[i - a]
-break 94
-run
-next
-p anms
-p ans
-next
-p i - a
-p pref[i - a]
-p i
-next
-p ansd
-p ans
-next
-p var
-break 127
-ru
-p log
-next
-p log
-p l
-p r
-p r - (1 << log)
-sparse
-p sparse
-break 128
-run
-p sparse
-continue
-run
-p sparse[l][log]
-p l
-p r
-break 128
-run
-break 154
-run
-p seg[0 + fds.size()]
-p segl[0 + fds.size()]
-p segl[1 + fds.size()]
-p segl[1 + fds.size()]
-p segl[2 + fds.size()]
-p segl[3 + fds.size()]
-p segl[4 + fds.size()]
-p segl[5 + fds.size()]
-next
-p i
-p fds[i]
-p sparsequery(i, i)
-p ans
-p i
-next
-p segr[8 + fds.size()]
-p segr[7 + fds.size()]
-p segr[8 + fds.size()]
-p segr[9 + fds.size()]
-break 178
-ru
-p segr
-p segr[5 + fds.size()]
-break 138
-run
-nextr
-next
-pi 
-p i
-p i
-p i
-continue
-necxt
-nexty
-next
-continue
-next
-continue
-next
-next
-p seg[6 + fds.size()]
-break 139
-run
-continue
-next
-p ans
-break 126
-run
-p count
-p n
-break 109
-run
-next
-p ans
-p count
-break 90
-run
-next
-p sum
-next
-p i
-next
-break 110
 run
 p sum
 p count
@@ -254,3 +154,103 @@ p bit
 next
 break 156
 run
+break 97
+run
+p a
+next
+p 
+p n
+next
+p cur
+break 97
+run
+next
+p i
+p cur
+next
+p cur
+next
+p cur
+p ans
+break  98
+ru
+next
+p cur
+p ans
+p a[j]
+p a
+p n / 17
+next
+p cur
+p n / (a[0] * a[1])
+next
+p cur
+next
+next
+p ans
+next
+break 100
+run
+continue
+next
+p cur
+p i
+p n / a[2]
+next
+p cur
+p n / (a[0] * a[2])
+next
+p cur
+p i
+n / (a[1] * a[2])
+p n / (a[1] * a[2])
+next
+p ans
+next
+p cur
+p i
+p n / (a[0] * a[1] * a[2])
+next
+p cur
+next
+p n / a[3]
+next
+p cur
+p i
+p n / (a[0] * a[3])
+p ans
+next
+p ans
+next
+p cur
+p n / (a[1] * a[3])
+next
+p cur
+next
+p cur
+p i
+p n / (a[2] * a[3])
+next
+p cur
+next
+p cur
+next
+pc ur
+next
+p ans
+break 101
+run
+next
+continue
+next
+p cur
+p cur2
+p n / cur2
+p cur
+next
+p cur
+p cur2
+p ans + cur
+p ans2 + n / cur2
+p n / cur2
+p cur

CSES Problem Set/Fibonacci Numbers.cpp

@@ -0,0 +1,151 @@
+/* Problem URL: https://cses.fi/problemset/task/1722 */
+
+#include <bits/stdc++.h>
+#include <ext/pb_ds/assoc_container.hpp>
+#include <ext/pb_ds/tree_policy.hpp>
+
+using namespace std;
+using namespace __gnu_pbds;
+
+template <class T, class comp = less<>>
+using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;
+
+#define V vector
+
+#define rmin(a, b) a = min(a, b)
+#define rmax(a, b) a = max(a, b)
+
+#define rep(i, lim) for (int i = 0; i < (lim); i++)
+#define nrep(i, s, lim) for (int 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;
+}
+
+const int oo = INT32_MAX >> 1;
+const ll OO = INT64_MAX >> 1;
+
+
+void pre()
+{
+
+}
+
+#define TEST 0
+
+void solve()
+{
+    ll n;
+    cin >> n;
+
+    if (n == 0) {
+        cout << "0\n";
+        return;
+    }
+
+    const ll mod = 1e9 + 7;
+
+    auto mul = [&](vvl &a, vvl &b) {
+        vvl c(a.size(), vl(b[0].size()));
+
+        rep(i, c.size()) {
+            rep(j, c[i].size()) {
+                rep(k, b.size()) {
+                    c[i][j] = (c[i][j] + a[i][k] * b[k][j] % mod) % mod;
+                }
+            }
+        }
+
+        return c;
+    };
+
+    auto fpow = [&](ll p) {
+        vvl ans = {
+            {0},
+            {1}
+        };
+
+        vvl po = {
+            {0, 1},
+            {1, 1}
+        };
+
+        rep(i, 61) {
+            if ((p >> i) & 1) {
+                ans = mul(po, ans);
+            }
+            po = mul(po, po);
+        }
+
+        return ans;
+    };
+
+    cout << fpow(n - 1)[1] << '\n';
+}
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    pre();
+
+    int t;
+    (TEST && cin >> t) || (t = 1);
+    while (t--) {
+        solve();
+    }
+}

CSES Problem Set/Graph Paths I.cpp

@@ -0,0 +1,152 @@
+/* Problem URL: https://cses.fi/problemset/task/1723 */
+ 
+#include <bits/stdc++.h>
+#include <ext/pb_ds/assoc_container.hpp>
+#include <ext/pb_ds/tree_policy.hpp>
+ 
+using namespace std;
+using namespace __gnu_pbds;
+ 
+template <class T, class comp = less<>>
+using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;
+ 
+#define V vector
+ 
+#define rmin(a, b) a = min(a, b)
+#define rmax(a, b) a = max(a, b)
+ 
+#define rep(i, lim) for (int i = 0; i < (lim); i++)
+#define nrep(i, s, lim) for (int 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;
+}
+ 
+const int oo = INT32_MAX >> 1;
+const ll OO = INT64_MAX >> 1;
+ 
+ 
+void pre()
+{
+ 
+}
+ 
+#define TEST 0
+ 
+void solve()
+{
+    int n, m, k;
+    cin >> n >> m >> k;
+ 
+    vvl adj(n, vl(n));
+ 
+    while (m--) {
+        int a, b;
+        cin >> a >> b;
+        adj[a - 1][b - 1]++;
+    }
+ 
+    ll mod = 1e9 + 7;
+ 
+    auto mul = [&](vvl &a, vvl &b) {
+        vvl c(a.size(), vl(b[0].size()));
+ 
+        rep(i, c.size()) {
+            rep(j, c[0].size()) {
+                rep(k, b.size()) {
+                    c[i][j] += a[i][k] * b[k][j];
+                    c[i][j] %= mod;
+                }
+            }
+        }
+ 
+        return c;
+    };
+ 
+    auto fpow = [&]() {
+        vvl ans(n, vl(n));
+        rep(i, n) {
+            ans[i][i] = 1;
+        }
+ 
+        rep(i, 30) {
+            if ((k >> i) & 1) {
+                ans = mul(ans, adj);
+            }
+            adj = mul(adj, adj);
+        }
+ 
+        return ans;
+    };
+ 
+    auto ans = fpow();
+ 
+    cout << ans[0][n - 1] << '\n';
+}
+ 
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+ 
+    pre();
+ 
+    int t;
+    (TEST && cin >> t) || (t = 1);
+    while (t--) {
+        solve();
+    }
+}

CSES Problem Set/Graph Paths II.cpp

@@ -0,0 +1,149 @@
+/* Problem URL: https://cses.fi/problemset/task/1724 */
+ 
+#include <bits/stdc++.h>
+#include <ext/pb_ds/assoc_container.hpp>
+#include <ext/pb_ds/tree_policy.hpp>
+ 
+using namespace std;
+using namespace __gnu_pbds;
+ 
+template <class T, class comp = less<>>
+using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;
+ 
+#define V vector
+ 
+#define rmin(a, b) a = min(a, b)
+#define rmax(a, b) a = max(a, b)
+ 
+#define rep(i, lim) for (int i = 0; i < (lim); i++)
+#define nrep(i, s, lim) for (int 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;
+}
+ 
+const int oo = INT32_MAX >> 1;
+const ll OO = INT64_MAX >> 1;
+ 
+ 
+void pre()
+{
+ 
+}
+ 
+#define TEST 0
+ 
+void solve()
+{
+    int n, m, k;
+    cin >> n >> m >> k;
+ 
+    vvl adj(n, vl(n, OO));
+ 
+    while (m--) {
+        int a, b, c;
+        cin >> a >> b >> c;
+        a--, b--;
+        rmin(adj[a][b], (ll)c);
+    }
+ 
+    auto mul = [&](vvl &a, vvl &b) {
+        vvl c(a.size(), vl(b[0].size(), OO));
+ 
+        rep(i, c.size()) {
+            rep(j, c[0].size()) {
+                rep(k, b.size()) {
+                    rmin(c[i][j], a[i][k] + b[k][j]);
+                }
+            }
+        }
+ 
+        return c;
+    };
+ 
+    auto fpow = [&]() {
+        vvl ans(n, vl(n, OO));
+        rep(i, n) {
+            ans[i][i] = 0;
+        }
+ 
+        rep(i, 30) {
+            if ((k >> i) & 1) {
+                ans = mul(ans, adj);
+            }
+            adj = mul(adj, adj);
+        }
+ 
+        return ans;
+    };
+ 
+    ll ans = fpow()[0][n - 1];
+    cout << (ans == OO ? -1 : ans) << '\n';
+}
+ 
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+ 
+    pre();
+ 
+    int t;
+    (TEST && cin >> t) || (t = 1);
+    while (t--) {
+        solve();
+    }
+}

CSES Problem Set/Next Prime.cpp

@@ -0,0 +1,133 @@
+/* Problem URL: https://cses.fi/problemset/task/3396 */
+
+#include <bits/stdc++.h>
+#include <ext/pb_ds/assoc_container.hpp>
+#include <ext/pb_ds/tree_policy.hpp>
+
+using namespace std;
+using namespace __gnu_pbds;
+
+template <class T, class comp = less<>>
+using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;
+
+#define V vector
+
+#define rmin(a, b) a = min(a, b)
+#define rmax(a, b) a = max(a, b)
+
+#define rep(i, lim) for (int i = 0; i < (lim); i++)
+#define nrep(i, s, lim) for (int 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;
+}
+
+const int oo = INT32_MAX >> 1;
+const ll OO = INT64_MAX >> 1;
+
+
+void pre()
+{
+
+}
+
+#define TEST 1
+
+void solve()
+{
+    ll n;
+    cin >> n;
+
+    n++;
+    if (n == 2) {
+        cout << "2\n";
+        return;
+    }
+
+    if (~n & 1) {
+        n++;
+    }
+
+    auto isprime = [&]() {
+        for (ll i = 2; i * i <= n; i++) {
+            if (n % i == 0) {
+                return false;
+            }
+        }
+
+        return true;
+    };
+
+    while (!isprime()) {
+        n += 2;
+    }
+
+    cout << n << '\n';
+}
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    pre();
+
+    int t;
+    (TEST && cin >> t) || (t = 1);
+    while (t--) {
+        solve();
+    }
+}

CSES Problem Set/Prime Multiples.cpp

@@ -0,0 +1,132 @@
+/* Problem URL: https://cses.fi/problemset/task/2185 */
+
+#include <bits/stdc++.h>
+#include <ext/pb_ds/assoc_container.hpp>
+#include <ext/pb_ds/tree_policy.hpp>
+
+using namespace std;
+using namespace __gnu_pbds;
+
+template <class T, class comp = less<>>
+using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;
+
+#define V vector
+
+#define rmin(a, b) a = min(a, b)
+#define rmax(a, b) a = max(a, b)
+
+#define rep(i, lim) for (int i = 0; i < (lim); i++)
+#define nrep(i, s, lim) for (int 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;
+}
+
+const int oo = INT32_MAX >> 1;
+const ll OO = INT64_MAX >> 1;
+
+
+void pre()
+{
+
+}
+
+#define TEST 0 
+
+void solve()
+{
+    ll n;
+    int k;
+    cin >> n >> k;
+
+    vl a(k);
+    cin >> a;
+
+    __int128 ans = 0;
+    nrep(i, 1, 1 << k) {
+        long double cur = n;
+        ll cur2 = 1;
+        rep(j, k) {
+            if ((i >> j) & 1) {
+                cur /= a[j];
+                cur2 *= a[j];
+            }
+        }
+
+        if (~__builtin_popcount(i) & 1) {
+            cur = -cur;
+            cur2 = -cur2;
+        }
+
+        ans += (ll)cur;
+    }
+
+    cout << (ll)ans << '\n';
+}
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    pre();
+
+    int t;
+    (TEST && cin >> t) || (t = 1);
+    while (t--) {
+        solve();
+    }
+}