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: Factorize (verify/number_theory/factorize.test.cpp)

Depends on

Code

// @brief Factorize
#define PROBLEM "https://judge.yosupo.jp/problem/factorize"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#include "cp-algo/number_theory/factorize.hpp"
#include <bits/stdc++.h>

using namespace std;
using namespace cp_algo::math;

void solve() {
    int64_t m;
    cin >> m;
    auto res = to<cp_algo::big_vector<int64_t>>(factorize(m));
    ranges::sort(res);
    cout << size(res) << " ";
    ranges::copy(res, ostream_iterator<int64_t>(cout, " "));
    cout << "\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

Test cases

Env Name Status Elapsed Memory
g++ 4295098369_00 :heavy_check_mark: AC 5 ms 4 MB
g++ 999381247093216751_00 :heavy_check_mark: AC 58 ms 4 MB
g++ big2_00 :heavy_check_mark: AC 59 ms 4 MB
g++ big2_01 :heavy_check_mark: AC 56 ms 4 MB
g++ big2_02 :heavy_check_mark: AC 56 ms 4 MB
g++ big2_worse_00 :heavy_check_mark: AC 61 ms 4 MB
g++ big_semiprime_gen_00 :heavy_check_mark: AC 55 ms 4 MB
g++ big_semiprime_gen_01 :heavy_check_mark: AC 49 ms 4 MB
g++ big_semiprime_random_00 :heavy_check_mark: AC 45 ms 4 MB
g++ big_semiprime_random_01 :heavy_check_mark: AC 48 ms 4 MB
g++ carmichael_00 :heavy_check_mark: AC 8 ms 4 MB
g++ example_00 :heavy_check_mark: AC 3 ms 4 MB
g++ fixed_RNG_buster_00 :heavy_check_mark: AC 3 ms 4 MB
g++ hack00_00 :heavy_check_mark: AC 3 ms 4 MB
g++ max_00 :heavy_check_mark: AC 7 ms 4 MB
g++ pow2_00 :heavy_check_mark: AC 10 ms 4 MB
g++ pow2_01 :heavy_check_mark: AC 8 ms 4 MB
g++ pow2_02 :heavy_check_mark: AC 11 ms 4 MB
g++ prime_test_special_00 :heavy_check_mark: AC 5 ms 4 MB
g++ prime_test_special_01 :heavy_check_mark: AC 5 ms 4 MB
g++ prime_test_special_02 :heavy_check_mark: AC 6 ms 4 MB
g++ prime_test_special_03 :heavy_check_mark: AC 4 ms 4 MB
g++ prime_test_special_bug_00 :heavy_check_mark: AC 4 ms 4 MB
g++ prime_test_special_bug_01 :heavy_check_mark: AC 5 ms 4 MB
g++ prime_test_special_bug_02 :heavy_check_mark: AC 3 ms 4 MB
g++ random_00 :heavy_check_mark: AC 4 ms 4 MB
g++ random_01 :heavy_check_mark: AC 5 ms 4 MB
g++ random_02 :heavy_check_mark: AC 5 ms 4 MB
g++ small_00 :heavy_check_mark: AC 3 ms 4 MB
g++ small_01 :heavy_check_mark: AC 3 ms 4 MB
g++ small_02 :heavy_check_mark: AC 3 ms 4 MB
Back to top page