add unsolved

storage/zeta/cpp/10432.cpp

@@ -0,0 +1,57 @@
+#include <iostream>
+#include <vector>
+#define let auto
+#define fn auto
+
+using namespace std;
+
+fn fastio() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+}
+
+fn main() -> int {
+    fastio();
+    size_t p;
+    cin >> p;
+    for (let i = 0; i < p; i++) {
+        size_t t;
+        cin >> t;
+        let arr = vector<int>();
+        for (let j = 0; j < 12; j++) {
+            size_t tmp;
+            cin >> tmp;
+            arr.push_back(tmp);
+        }
+
+        let stack = vector<int>();
+        let res = 0;
+        for (let elem: arr) {
+            if (stack.empty()) {
+                stack.push_back(elem);
+            }
+            let last = stack[stack.size() - 1];
+            if (elem > last) {
+                stack.push_back(elem);
+            }
+            else if (elem == last ) {
+                continue;
+
+            } else {
+                while (stack[stack.size() - 1] <= elem ){
+                    stack.pop_back();
+                    res += 1;
+                }
+
+                let mus_last = stack[stack.size() - 1];
+                
+                
+                if (mus_last < elem) {
+                    stack.push_back(elem);
+                } else if (mus_last == elem) {
+                    
+                }
+            }
+        }
+    }
+}

storage/zeta/cpp/24518.cpp

@@ -0,0 +1,113 @@
+#include <cmath>
+#include <iostream>
+#include <vector>
+
+#define let auto
+#define fn auto
+#define usize size_t
+
+using namespace std;
+
+const usize MOD = 1'000'000'007;
+
+fn fastio() {
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+}
+
+fn well_known_sum_draft(usize n, usize m) -> usize {
+    let res = (usize) 0;
+    for (usize i = 1; i <= n; i++) {
+        res += (n / i) * (i % m);
+        res %= MOD;
+    }
+    return res;
+}
+
+fn well_known_subarr_sum(usize d, usize lo, usize hi /* exclusive */, usize m) -> usize {
+    // surely lo < hi
+    let res = (usize) 0;
+
+    let lo_margin = lo % m;
+    let hi_margin = hi % m;
+    if (lo / m == hi / m) {
+        res += ((hi_margin * (hi_margin - 1) / 2) - (lo_margin * (lo_margin - 1) / 2)) * d;
+        res %= MOD;
+        // printf("%lld %lld %lld %lld\n", lo, hi, d, res);
+        return res;
+    }
+
+    res += (hi_margin * (hi_margin - 1) / 2) * d;
+    res %= MOD;
+
+    res += (m * (m - 1) / 2 - lo_margin * (lo_margin - 1) / 2) * d;
+    res %= MOD;
+
+    let d_cycle = (d * (m * (m - 1) / 2) % MOD) % MOD;
+    let cycle_cnt = (hi - lo - (hi_margin + m - lo_margin)) / m;
+    // printf("%lld %lld %lld %lld\n", lo, hi, d, res);
+    res += cycle_cnt * d_cycle;
+    res %= MOD;
+    return res;
+}
+
+fn well_known_sum(usize n, usize m) -> usize {
+    let res = (usize) 0;
+    let steps = vector<usize>();
+    steps.push_back(n + 1);
+    for (usize i = 2; i <= (usize) pow(n, 0.5) + 1; i++) {
+        steps.push_back(n / i + 1);
+    }
+
+    let k = (usize) pow(n, 0.5);
+    if (k * k == n) {
+        for (usize i = 1; i <= k; i++) {
+            res += (n / i) * (i % m);
+            res %= MOD;
+        }
+    } else {
+        for (usize i = 1; i <= k; i++) {
+            res += (n / i) * (i % m);
+            res %= MOD;
+        }
+    }
+
+    let step_size = steps.size();
+    for (usize i = 0; i < step_size - 1; i++) {
+        let temp = well_known_subarr_sum(i + 1, steps[i + 1], steps[i], m);
+        res += temp;
+        res %= MOD;
+    }
+
+    return res;
+}
+
+fn main() -> int {
+    fastio();
+    usize n;
+    usize m;
+
+    cin >> n;
+    cin >> m;
+
+    if (n <= 10) {
+        cout << well_known_sum_draft(n, m) << endl;
+    } else if (m == 1) {
+        cout << 0 << endl;
+    } else {
+        let x = well_known_sum_draft(n, m);
+        let y = well_known_sum(n, m);
+        cout << x << endl;
+        cout << y << endl;
+        for (usize i = 12; i < 100; i++) {
+            for (usize j = 12; j < 100; j++) {
+                let x = well_known_sum_draft(i, j);
+                let y = well_known_sum(i, j);
+                if (x != y) {
+                    printf("%lld %lld\n", i, j);
+                }
+            }
+        }
+    }
+    return 0;
+}