This documentation is automatically generated by competitive-verifier/competitive-verifier
// @brief Sum of Totient Function
#define PROBLEM "https://judge.yosupo.jp/problem/sum_of_totient_function"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#include <iostream>
//#include "blazingio/blazingio.min.hpp"
#include "cp-algo/number_theory/modint.hpp"
#include "cp-algo/number_theory/dirichlet.hpp"
#include "cp-algo/util/big_alloc.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 H = floors(n) | views::transform([](int64_t k) {
return base(k) * base(k + 1) / 2;
}) | ranges::to<cp_algo::big_vector<base>>();
auto G = floors(n) | views::transform([](int64_t k) {
return base(k);
}) | ranges::to<cp_algo::big_vector<base>>();
auto F = Dirichlet_div(H, G, n);
cout << F.back() << "\n";
}
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
| Env | Name | Status | Elapsed | Memory |
|---|---|---|---|---|
| g++ | boundaryA_00 |
|
55 ms | 4 MB |
| g++ | boundaryA_01 |
|
120 ms | 6 MB |
| g++ | boundaryA_02 |
|
158 ms | 6 MB |
| g++ | boundaryA_03 |
|
171 ms | 6 MB |
| g++ | boundaryA_04 |
|
111 ms | 5 MB |
| g++ | boundaryA_05 |
|
101 ms | 5 MB |
| g++ | boundaryA_06 |
|
161 ms | 6 MB |
| g++ | boundaryA_07 |
|
195 ms | 6 MB |
| g++ | boundaryA_08 |
|
79 ms | 5 MB |
| g++ | boundaryA_09 |
|
113 ms | 5 MB |
| g++ | boundaryB_00 |
|
55 ms | 4 MB |
| g++ | boundaryB_01 |
|
120 ms | 6 MB |
| g++ | boundaryB_02 |
|
158 ms | 6 MB |
| g++ | boundaryB_03 |
|
171 ms | 6 MB |
| g++ | boundaryB_04 |
|
110 ms | 5 MB |
| g++ | boundaryB_05 |
|
101 ms | 5 MB |
| g++ | boundaryB_06 |
|
161 ms | 6 MB |
| g++ | boundaryB_07 |
|
197 ms | 6 MB |
| g++ | boundaryB_08 |
|
79 ms | 5 MB |
| g++ | boundaryB_09 |
|
113 ms | 5 MB |
| g++ | example_00 |
|
4 ms | 4 MB |
| g++ | example_01 |
|
4 ms | 4 MB |
| g++ | example_02 |
|
4 ms | 4 MB |
| g++ | handmade_00 |
|
4 ms | 4 MB |
| g++ | handmade_01 |
|
4 ms | 4 MB |
| g++ | handmade_02 |
|
4 ms | 4 MB |
| g++ | handmade_03 |
|
4 ms | 4 MB |
| g++ | max_00 |
|
197 ms | 6 MB |
| g++ | max_01 |
|
196 ms | 6 MB |
| g++ | max_02 |
|
196 ms | 6 MB |
| g++ | max_03 |
|
196 ms | 6 MB |
| g++ | max_04 |
|
195 ms | 6 MB |
| g++ | max_05 |
|
197 ms | 6 MB |
| g++ | max_06 |
|
197 ms | 6 MB |
| g++ | max_07 |
|
196 ms | 6 MB |
| g++ | max_08 |
|
196 ms | 6 MB |
| g++ | max_09 |
|
196 ms | 6 MB |
| g++ | random_00 |
|
56 ms | 4 MB |
| g++ | random_01 |
|
121 ms | 6 MB |
| g++ | random_02 |
|
159 ms | 6 MB |
| g++ | random_03 |
|
173 ms | 6 MB |
| g++ | random_04 |
|
111 ms | 5 MB |
| g++ | random_05 |
|
101 ms | 5 MB |
| g++ | random_06 |
|
161 ms | 6 MB |
| g++ | random_07 |
|
195 ms | 6 MB |
| g++ | random_08 |
|
79 ms | 5 MB |
| g++ | random_09 |
|
113 ms | 5 MB |
| g++ | small_00 |
|
4 ms | 4 MB |