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: Enumerate Quotients (verify/number_theory/quotients.test.cpp)

Depends on

Code

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

using namespace std;
using namespace cp_algo::math;

void solve() {
    int64_t n;
    cin >> n;
    auto res = floors(n) | views::drop(1);
    cout << size(res) << "\n";
    for(auto it: res) {
        cout << it << " ";
    }
    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++ example_00 :heavy_check_mark: AC 6 ms 4 MB
g++ max_00 :heavy_check_mark: AC 104 ms 4 MB
g++ min_00 :heavy_check_mark: AC 5 ms 4 MB
g++ min_01 :heavy_check_mark: AC 4 ms 4 MB
g++ min_02 :heavy_check_mark: AC 4 ms 4 MB
g++ min_03 :heavy_check_mark: AC 4 ms 4 MB
g++ min_04 :heavy_check_mark: AC 4 ms 4 MB
g++ min_05 :heavy_check_mark: AC 4 ms 4 MB
g++ min_06 :heavy_check_mark: AC 4 ms 4 MB
g++ min_07 :heavy_check_mark: AC 4 ms 4 MB
g++ min_08 :heavy_check_mark: AC 4 ms 4 MB
g++ polynom_p1p1m1_00 :heavy_check_mark: AC 117 ms 4 MB
g++ polynom_p1p1m1_01 :heavy_check_mark: AC 50 ms 4 MB
g++ polynom_p1p1z_00 :heavy_check_mark: AC 100 ms 4 MB
g++ polynom_p1p1z_01 :heavy_check_mark: AC 58 ms 4 MB
g++ polynom_p1zm1_00 :heavy_check_mark: AC 122 ms 4 MB
g++ polynom_p1zm1_01 :heavy_check_mark: AC 58 ms 4 MB
g++ random_00 :heavy_check_mark: AC 59 ms 4 MB
g++ random_01 :heavy_check_mark: AC 70 ms 4 MB
g++ random_small_00 :heavy_check_mark: AC 5 ms 4 MB
g++ random_small_01 :heavy_check_mark: AC 5 ms 4 MB
g++ random_small_02 :heavy_check_mark: AC 4 ms 4 MB
g++ random_small_03 :heavy_check_mark: AC 4 ms 4 MB
g++ random_small_04 :heavy_check_mark: AC 4 ms 4 MB
g++ square_00 :heavy_check_mark: AC 41 ms 4 MB
g++ square_01 :heavy_check_mark: AC 49 ms 4 MB
Back to top page