結果
問題 | No.1419 Power Moves |
ユーザー |
![]() |
提出日時 | 2020-12-20 13:56:50 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 27 ms / 2,000 ms |
コード長 | 4,272 bytes |
コンパイル時間 | 1,934 ms |
コンパイル使用メモリ | 197,052 KB |
最終ジャッジ日時 | 2025-01-17 04:46:08 |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 31 |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll = long long;#define rep(i, n) for (int i = 0; i < (n); i++)#define all(x) (x).begin(), (x).end()template<int m>struct ModInt {public:static constexpr int mod() { return m; }static ModInt raw(int v) {ModInt x;x._v = v;return x;}ModInt() : _v(0) {}ModInt(long long v) {long long x = (long long)(v % (long long)(umod()));if (x < 0) x += umod();_v = (unsigned int)(x);}unsigned int val() const { return _v; }ModInt& operator++() {_v++;if (_v == umod()) _v = 0;return *this;}ModInt& operator--() {if (_v == 0) _v = umod();_v--;return *this;}ModInt operator++(int) {ModInt result = *this;++*this;return result;}ModInt operator--(int) {ModInt result = *this;--*this;return result;}ModInt& operator+=(const ModInt& rhs) {_v += rhs._v;if (_v >= umod()) _v -= umod();return *this;}ModInt& operator-=(const ModInt& rhs) {_v -= rhs._v;if (_v >= umod()) _v += umod();return *this;}ModInt& operator*=(const ModInt& rhs) {unsigned long long z = _v;z *= rhs._v;_v = (unsigned int)(z % umod());return *this;}ModInt& operator^=(long long n) {ModInt x = *this;*this = 1;if (n < 0) x = x.inv(), n = -n;while (n) {if (n & 1) *this *= x;x *= x;n >>= 1;}return *this;}ModInt& operator/=(const ModInt& rhs) { return *this = *this * rhs.inv(); }ModInt operator+() const { return *this; }ModInt operator-() const { return ModInt() - *this; }ModInt pow(long long n) const {ModInt r = *this;r ^= n;return r;}ModInt inv() const {int a = _v, b = umod(), y = 1, z = 0, t;for (; ; ) {t = a / b; a -= t * b;if (a == 0) {assert(b == 1 || b == -1);return ModInt(b * z);}y -= t * z;t = b / a; b -= t * a;if (b == 0) {assert(a == 1 || a == -1);return ModInt(a * y);}z -= t * y;}}friend ModInt operator+(const ModInt& lhs, const ModInt& rhs) { return ModInt(lhs) += rhs; }friend ModInt operator-(const ModInt& lhs, const ModInt& rhs) { return ModInt(lhs) -= rhs; }friend ModInt operator*(const ModInt& lhs, const ModInt& rhs) { return ModInt(lhs) *= rhs; }friend ModInt operator/(const ModInt& lhs, const ModInt& rhs) { return ModInt(lhs) /= rhs; }friend ModInt operator^(const ModInt& lhs, long long rhs) { return ModInt(lhs) ^= rhs; }friend bool operator==(const ModInt& lhs, const ModInt& rhs) { return lhs._v == rhs._v; }friend bool operator!=(const ModInt& lhs, const ModInt& rhs) { return lhs._v != rhs._v; }friend ModInt operator+(long long lhs, const ModInt& rhs) { return (ModInt(lhs) += rhs); }friend ModInt operator-(long long lhs, const ModInt& rhs) { return (ModInt(lhs) -= rhs); }friend ModInt operator*(long long lhs, const ModInt& rhs) { return (ModInt(lhs) *= rhs); }friend ostream &operator<<(ostream& os, const ModInt& rhs) { return os << rhs._v; }private:unsigned int _v;static constexpr unsigned int umod() { return m; }};constexpr int MOD = 1000000007;//constexpr int MOD = 998244353;using mint = ModInt<MOD>;ll pow_mod(ll x, ll k, ll mod) {ll ret = 1;while (k > 0) {if (k&1) {ret = ret*x%mod;}x = x*x%mod;k >>= 1;}return ret;};int main() {int N,K; cin >> N >> K;int q = pow_mod(2,K-1,N);mint p = mint(2).pow(K-1);p -= q;p /= N;vector<mint> ans(N);rep(i,N) {int m = (i*2+1)%N;ans[m] += p;if (i < q) ans[m]++;}auto ansrev = ans;rep(i,N) ans[(N-i)%N] += ansrev[i];mint b = mint(2).pow(-K);rep(i,N) ans[i] *= b;rep(i,N) cout << ans[i] << '\n';}