Submit Info #2731

Problem Lang User Status Time Memory
Montmort Number cpp emthrm AC 86 ms 13.92 MiB

ケース詳細
Name Status Time Memory
example_00 AC 2 ms 0.67 MiB
example_01 AC 1 ms 0.67 MiB
max_00 AC 86 ms 13.53 MiB
max_01 AC 81 ms 13.67 MiB
max_02 AC 78 ms 13.92 MiB
random_00 AC 35 ms 5.55 MiB
random_01 AC 40 ms 6.42 MiB
random_02 AC 49 ms 8.30 MiB
random_03 AC 35 ms 6.30 MiB
random_04 AC 66 ms 11.17 MiB

#define _USE_MATH_DEFINES #include <bits/stdc++.h> using namespace std; #define FOR(i,m,n) for(int i=(m);i<(n);++i) #define REP(i,n) FOR(i,0,n) #define ALL(v) (v).begin(),(v).end() using ll = long long; template <typename T> using posteriority_queue = priority_queue<T, vector<T>, greater<T> >; const int INF = 0x3f3f3f3f; const ll LINF = 0x3f3f3f3f3f3f3f3fLL; const double EPS = 1e-8; const int MOD = 1000000007; // const int MOD = 998244353; const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1}; // const int dy[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx[] = {0, -1, -1, -1, 0, 1, 1, 1}; template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; } template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; } template <typename T> void unique(vector<T> &a) { a.erase(unique(ALL(a)), a.end()); } struct IOSetup { IOSetup() { cin.tie(nullptr); ios_base::sync_with_stdio(false); cout << fixed << setprecision(20); } } iosetup; int mod = MOD; struct ModInt { unsigned val; ModInt(): val(0) {} ModInt(ll x) : val(x >= 0 ? x % mod : x % mod + mod) {} ModInt pow(ll exponent) { ModInt tmp = *this, res = 1; while (exponent > 0) { if (exponent & 1) res *= tmp; tmp *= tmp; exponent >>= 1; } return res; } ModInt &operator+=(const ModInt &x) { if((val += x.val) >= mod) val -= mod; return *this; } ModInt &operator-=(const ModInt &x) { if((val += mod - x.val) >= mod) val -= mod; return *this; } ModInt &operator*=(const ModInt &x) { val = static_cast<unsigned long long>(val) * x.val % mod; return *this; } ModInt &operator/=(const ModInt &x) { return *this *= x.inv(); } bool operator==(const ModInt &x) const { return val == x.val; } bool operator!=(const ModInt &x) const { return val != x.val; } bool operator<(const ModInt &x) const { return val < x.val; } bool operator<=(const ModInt &x) const { return val <= x.val; } bool operator>(const ModInt &x) const { return val > x.val; } bool operator>=(const ModInt &x) const { return val >= x.val; } ModInt &operator++() { if (++val == mod) val = 0; return *this; } ModInt operator++(int) { ModInt res = *this; ++*this; return res; } ModInt &operator--() { val = (val == 0 ? mod : val) - 1; return *this; } ModInt operator--(int) { ModInt res = *this; --*this; return res; } ModInt operator+() const { return *this; } ModInt operator-() const { return ModInt(val ? mod - val : 0); } ModInt operator+(const ModInt &x) const { return ModInt(*this) += x; } ModInt operator-(const ModInt &x) const { return ModInt(*this) -= x; } ModInt operator*(const ModInt &x) const { return ModInt(*this) *= x; } ModInt operator/(const ModInt &x) const { return ModInt(*this) /= x; } friend ostream &operator<<(ostream &os, const ModInt &x) { return os << x.val; } friend istream &operator>>(istream &is, ModInt &x) { ll val; is >> val; x = ModInt(val); return is; } private: ModInt inv() const { // assert(__gcd(val, mod) == 1); unsigned a = val, b = mod; int x = 1, y = 0; while (b) { unsigned tmp = a / b; swap(a -= tmp * b, b); swap(x -= tmp * y, y); } return ModInt(x); } }; ModInt abs(const ModInt &x) { return x; } struct Combinatorics { int val; // "val!" and "mod" must be disjoint. vector<ModInt> fact, fact_inv, inv; Combinatorics(int val = 10000000) : val(val), fact(val + 1), fact_inv(val + 1), inv(val + 1) { fact[0] = 1; FOR(i, 1, val + 1) fact[i] = fact[i - 1] * i; fact_inv[val] = ModInt(1) / fact[val]; for (int i = val; i > 0; --i) fact_inv[i - 1] = fact_inv[i] * i; FOR(i, 1, val + 1) inv[i] = fact[i - 1] * fact_inv[i]; } ModInt nCk(int n, int k) { if (n < 0 || n < k || k < 0) return ModInt(0); // assert(n <= val && k <= val); return fact[n] * fact_inv[k] * fact_inv[n - k]; } ModInt nPk(int n, int k) { if (n < 0 || n < k || k < 0) return ModInt(0); // assert(n <= val); return fact[n] * fact_inv[n - k]; } ModInt nHk(int n, int k) { if (n < 0 || k < 0) return ModInt(0); return (k == 0 ? ModInt(1) : nCk(n + k - 1, k)); } }; template <typename T> vector<T> montmort_number(int val) { vector<T> montmort(val + 1, 0); if (val >= 2) montmort[2] = 1; FOR(i, 3, val + 1) montmort[i] = (montmort[i - 1] + montmort[i - 2]) * (i - 1); return montmort; } int main() { int n, m; cin >> n >> m; mod = m; vector<ModInt> b = montmort_number<ModInt>(n); FOR(i, 1, n + 1) cout << b[i] << " \n"[i == n]; return 0; }