結果
問題 | No.1419 Power Moves |
ユーザー |
![]() |
提出日時 | 2021-03-05 22:35:16 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 244 ms / 2,000 ms |
コード長 | 2,755 bytes |
コンパイル時間 | 1,942 ms |
コンパイル使用メモリ | 197,184 KB |
最終ジャッジ日時 | 2025-01-19 11:31:33 |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 31 |
ソースコード
#include <bits/stdc++.h>using namespace std;template <int mod = (int)(1e9 + 7)>struct ModInt {int x;constexpr ModInt() : x(0) {}constexpr ModInt(int64_t y): x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}constexpr ModInt &operator+=(const ModInt &p) noexcept {if ((x += p.x) >= mod) x -= mod;return *this;}constexpr ModInt &operator-=(const ModInt &p) noexcept {if ((x += mod - p.x) >= mod) x -= mod;return *this;}constexpr ModInt &operator*=(const ModInt &p) noexcept {x = (int)(1LL * x * p.x % mod);return *this;}constexpr ModInt &operator/=(const ModInt &p) noexcept {*this *= p.inverse();return *this;}constexpr ModInt operator-() const { return ModInt(-x); }constexpr ModInt operator+(const ModInt &p) const noexcept {return ModInt(*this) += p;}constexpr ModInt operator-(const ModInt &p) const noexcept {return ModInt(*this) -= p;}constexpr ModInt operator*(const ModInt &p) const noexcept {return ModInt(*this) *= p;}constexpr ModInt operator/(const ModInt &p) const noexcept {return ModInt(*this) /= p;}constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }constexpr ModInt inverse() const noexcept {int a = x, b = mod, u = 1, v = 0, t = 0;while (b > 0) {t = a / b;swap(a -= t * b, b);swap(u -= t * v, v);}return ModInt(u);}constexpr ModInt pow(int64_t n) const {ModInt res(1), mul(x);while (n) {if (n & 1) res *= mul;mul *= mul;n >>= 1;}return res;}friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {return os << p.x;}friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {int64_t t = 0;is >> t;a = ModInt<mod>(t);return (is);}constexpr int get_mod() { return mod; }};using mint = ModInt<>;int n, k;vector<mint> solve();int main() {cin >> n >> k;auto res = solve();for (auto p : res) cout << p << endl;return 0;}vector<mint> solve() {mint all = mint(2).pow(k).inverse();vector<mint> cnt(n, 0);for (int i = 1; i <= 2 * n; i += 2) cnt[i % n] += 1;mint now = mint(2).pow(k) - 1;int len = 1, b = 2;while (k) {if (k & 1) len = 1LL * len * b % (2 * n);b = 1LL * b * b % (2 * n);k >>= 1;}len = (len - 1 + 2 * n) % (2 * n);now -= len;now /= 2 * n;for (auto &p : cnt) p *= now;for (int i = 1; i <= len; i += 2) cnt[i % n] += 1;vector<mint> res(n);for (int i = 0; i < n; ++i) res[i] = cnt[i] + cnt[(n - i) % n];for (auto &p : res) p *= all;return res;}