This documentation is automatically generated by competitive-verifier/competitive-verifier
// @brief Primitive Root
#define PROBLEM "https://judge.yosupo.jp/problem/primitive_root"
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("tune=native")
#include "cp-algo/number_theory/euler.hpp"
#include <bits/stdc++.h>
using namespace std;
using namespace cp_algo;
using namespace math;
using base = dynamic_modint<>;
void solve() {
int64_t p;
cin >> p;
cout << primitive_root(p) << "\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++ | 223092870x_plus_1_00 |
![]() |
28 ms | 4 MB |
g++ | example_00 |
![]() |
4 ms | 4 MB |
g++ | example_01 |
![]() |
5 ms | 4 MB |
g++ | large_least_primitive_root_00 |
![]() |
17 ms | 4 MB |
g++ | less_1000000000_00 |
![]() |
8 ms | 4 MB |
g++ | less_1000000000_01 |
![]() |
8 ms | 4 MB |
g++ | less_1000000000_02 |
![]() |
8 ms | 4 MB |
g++ | random_00 |
![]() |
14 ms | 4 MB |
g++ | random_01 |
![]() |
14 ms | 4 MB |
g++ | random_02 |
![]() |
12 ms | 4 MB |
g++ | safe_prime_00 |
![]() |
7 ms | 4 MB |
g++ | small_00 |
![]() |
6 ms | 4 MB |
g++ | small_01 |
![]() |
6 ms | 4 MB |
g++ | small_02 |
![]() |
6 ms | 4 MB |