:warning: library/math/FactorialNumberSystem.hpp

Depends on

Code

#pragma once
#include "library/datastructure/FenwickTree.hpp"
namespace factorial_number_system {
// std::vector<int> で表す
// v[i]*i! の総和を表現している(0<=v[i]<=i)
// 特に v[0]=0 は確定

// N 桁の階乗進数 K に対して、N の順列で 0-indexed K 番目を返す
static std::vector<int> to_permutation(const std::vector<int> &v) {
    int N = v.size();
    std::vector<int> p(N);
    FenwickTree<GroupAdd<int>> ft(std::vector<int>(N, 1));
    for (int i = 0; i < N; i++) {
        p[i] = ft.kth(v[N - 1 - i]);
        ft.add(p[i], -1);
    }
    return p;
}

// N の順列が 0-indexed K 番目であるとき、N 桁の階乗進数 K を返す
static std::vector<int> to_factorial(const std::vector<int> &p) {
    int N = p.size();
    std::vector<int> v(N);
    FenwickTree<GroupAdd<int>> ft(std::vector<int>(N, 1));
    for (int i = 0; i < N; i++) {
        int k = ft.sum(p[i]);
        v[N - 1 - i] = k;
        ft.add(p[i], -1);
    }
    return v;
}

// N 桁の階乗進数の和 mod N!
std::vector<int> sum(std::vector<int> p, const std::vector<int> &q) {
    int N = p.size();
    assert(q.size() == N);
    for (int i = 0; i < N; i++) {
        p[i] += q[i];
        if (p[i] > i) {
            p[i] -= i + 1;
            if (i + 1 < N)
                p[i + 1]++;
        }
    }
    return p;
}

// sum(p,q)=0 となる q を返す
std::vector<int> inv(std::vector<int> p) {
    int N = p.size();
    std::vector<int> q(N);
    for (int i = 0; i < N; i++) {
        if (p[i]) {
            q[i] = i + 1 - p[i];
            if (i + 1 < N)
                p[i + 1]++;
        } else
            q[i] = 0;
    }
    return q;
}
} // namespace factorial_number_system
Traceback (most recent call last):
  File "/opt/hostedtoolcache/Python/3.14.0/x64/lib/python3.14/site-packages/onlinejudge_verify/documentation/build.py", line 71, in _render_source_code_stat
    bundled_code = language.bundle(stat.path, basedir=basedir, options={'include_paths': [basedir]}).decode()
                   ~~~~~~~~~~~~~~~^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/opt/hostedtoolcache/Python/3.14.0/x64/lib/python3.14/site-packages/onlinejudge_verify/languages/cplusplus.py", line 187, in bundle
    bundler.update(path)
    ~~~~~~~~~~~~~~^^^^^^
  File "/opt/hostedtoolcache/Python/3.14.0/x64/lib/python3.14/site-packages/onlinejudge_verify/languages/cplusplus_bundle.py", line 401, in update
    self.update(self._resolve(pathlib.Path(included), included_from=path))
    ~~~~~~~~~~~^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/opt/hostedtoolcache/Python/3.14.0/x64/lib/python3.14/site-packages/onlinejudge_verify/languages/cplusplus_bundle.py", line 401, in update
    self.update(self._resolve(pathlib.Path(included), included_from=path))
    ~~~~~~~~~~~^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/opt/hostedtoolcache/Python/3.14.0/x64/lib/python3.14/site-packages/onlinejudge_verify/languages/cplusplus_bundle.py", line 312, in update
    raise BundleErrorAt(path, i + 1, "#pragma once found in a non-first line")
onlinejudge_verify.languages.cplusplus_bundle.BundleErrorAt: library/algebra/group/Concepts.hpp: line 3: #pragma once found in a non-first line
Back to top page