CP-Algorithms Library

This documentation is automatically generated by competitive-verifier/competitive-verifier

View the Project on GitHub cp-algorithms/cp-algorithms-aux

:heavy_check_mark: Dirichlet Inverse and Prefix Sums (verify/number_theory/dirichlet_inv.test.cpp)

Depends on

Code

// @brief Dirichlet Inverse and Prefix Sums
#define PROBLEM "https://judge.yosupo.jp/problem/dirichlet_inverse_and_prefix_sums"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#include <iostream>
//#include "blazingio/blazingio.min.hpp"
#include "cp-algo/util/big_alloc.hpp"
#include "cp-algo/number_theory/modint.hpp"
#include "cp-algo/number_theory/dirichlet.hpp"
#include <bits/stdc++.h>

using namespace std;
using namespace cp_algo::math;
using base = modint<998244353>;

void solve() {
    int64_t n;
    cin >> n;
    auto [_, m] = floor_stats(n);
    cp_algo::big_vector<base> G(m+1);
    for (int i = 1; i <= m; ++i) {
        cin >> G[i];
    }
    auto F = Dirichlet_div(views::repeat(base(1)), G, n);
    for (int i = 1; i <= m; ++i) {
        cout << F[i] << " \n"[i == m];
    }
}

signed main() {
    //freopen("input.txt", "r", stdin);
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
    cin >> t;
    while(t--) {
        solve();
    }
}
Traceback (most recent call last):
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj_resolve/resolver.py", line 181, in resolve
    bundled_code = language.bundle(path, basedir=basedir)
                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus.py", line 252, in bundle
    bundler.update(path)
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 327, in update
    assert len(lines) == len(uncommented_lines)
           ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
AssertionError

Test cases

Env Name Status Elapsed Memory
g++ example_00 :heavy_check_mark: AC 5 ms 4 MB
g++ example_01 :heavy_check_mark: AC 4 ms 4 MB
g++ many_00 :heavy_check_mark: AC 215 ms 4 MB
g++ many_01 :heavy_check_mark: AC 203 ms 4 MB
g++ many_02 :heavy_check_mark: AC 225 ms 4 MB
g++ max_00 :heavy_check_mark: AC 3767 ms 19 MB
g++ max_01 :heavy_check_mark: AC 3741 ms 19 MB
g++ max_02 :heavy_check_mark: AC 3788 ms 19 MB
g++ max_03 :heavy_check_mark: AC 3673 ms 19 MB
g++ max_04 :heavy_check_mark: AC 3695 ms 19 MB
g++ random_00 :heavy_check_mark: AC 1385 ms 11 MB
g++ random_01 :heavy_check_mark: AC 2195 ms 14 MB
g++ random_02 :heavy_check_mark: AC 554 ms 7 MB
g++ random_03 :heavy_check_mark: AC 3558 ms 19 MB
g++ random_04 :heavy_check_mark: AC 2873 ms 17 MB
g++ small_00 :heavy_check_mark: AC 6 ms 4 MB
g++ small_01 :heavy_check_mark: AC 5 ms 4 MB
g++ small_02 :heavy_check_mark: AC 4 ms 4 MB
g++ small_03 :heavy_check_mark: AC 5 ms 4 MB
g++ small_04 :heavy_check_mark: AC 5 ms 4 MB
g++ very_small_00 :heavy_check_mark: AC 4 ms 4 MB
g++ very_small_01 :heavy_check_mark: AC 4 ms 4 MB
g++ very_small_02 :heavy_check_mark: AC 4 ms 4 MB
g++ very_small_03 :heavy_check_mark: AC 4 ms 4 MB
g++ very_small_04 :heavy_check_mark: AC 4 ms 4 MB
Back to top page