test/yosupo/math/montmort_number.test.cpp

• View this file on GitHub
• Last update: 2024-07-11 17:20:00+09:00
• Problem: https://judge.yosupo.jp/problem/montmort_number_mod

Code

// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/montmort_number_mod
#include <cstdint>
#include <iostream>
#include <vector>

int main(void) {
    int n, m;
    std::cin >> n >> m;
    std::int64_t sum = 0;
    std::vector<int> ans(n);
    for (int i = 0; i < n; ++i) {
        ans[i] = sum;
        sum *= i + 2;
        if (i & 1) sum += m - 1;
        else ++sum;
        sum %= m;
    }
    for (int i = 0; i < (int)ans.size(); ++i)
        std::cout << ans[i] << (i == (int)ans.size() - 1 ? '\n' : ' ');

    return 0;
}

#line 1 "test/yosupo/math/montmort_number.test.cpp"
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/montmort_number_mod
#include <cstdint>
#include <iostream>
#include <vector>

int main(void) {
    int n, m;
    std::cin >> n >> m;
    std::int64_t sum = 0;
    std::vector<int> ans(n);
    for (int i = 0; i < n; ++i) {
        ans[i] = sum;
        sum *= i + 2;
        if (i & 1) sum += m - 1;
        else ++sum;
        sum %= m;
    }
    for (int i = 0; i < (int)ans.size(); ++i)
        std::cout << ans[i] << (i == (int)ans.size() - 1 ? '\n' : ' ');

    return 0;
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	example_00	AC	2 ms	3 MB
g++	example_01	AC	2 ms	3 MB
g++	max_00	AC	72 ms	7 MB
g++	max_01	AC	71 ms	7 MB
g++	max_02	AC	96 ms	7 MB
g++	random_00	AC	39 ms	5 MB
g++	random_01	AC	46 ms	5 MB
g++	random_02	AC	57 ms	6 MB
g++	random_03	AC	40 ms	5 MB
g++	random_04	AC	55 ms	6 MB

Back to top page