結果
問題 | No.1050 Zero (Maximum) |
ユーザー |
|
提出日時 | 2020-05-08 22:49:59 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 32 ms / 2,000 ms |
コード長 | 3,714 bytes |
コンパイル時間 | 2,520 ms |
コンパイル使用メモリ | 205,092 KB |
最終ジャッジ日時 | 2025-01-10 09:07:38 |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 15 |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll = long long;using ld = long double;using VI = vector<int>;using VL = vector<ll>;using VS = vector<string>;template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;#define FOR(i,a,n) for(int (i)=(a);(i)<(n);++(i))#define eFOR(i,a,n) for(int (i)=(a);(i)<=(n);++(i))#define rFOR(i,a,n) for(int (i)=(n)-1;(i)>=(a);--(i))#define erFOR(i,a,n) for(int (i)=(n);(i)>=(a);--(i))#define each(i, a) for(auto &i : a)#define SORT(i) sort((i).begin(),(i).end())#define rSORT(i,a) sort((i).begin(),(i).end(),(a))#define all(i) (i).begin(),(i).end()#define out(y,x) ((y) < 0 || h <= (y) || (x) < 0 || w <= (x))#define line cout << "-----------------------------\n"#define ENDL(i,n) ((i) == (n) - 1 ? "\n" : " ")#define stop system("pause")constexpr ll INF = 1000000000;constexpr ll LLINF = 1LL << 60;constexpr ll mod = 1000000007;constexpr ll MOD = 998244353;constexpr ld eps = 1e-10;constexpr ld pi = 3.1415926535897932;template<class T>inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; }return false; }template<class T>inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; }return false; }inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }inline void print() { cout << "\n"; }template<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << " "; print(ts...); }template<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? "\n" : " "); }template<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }template<class T> struct matrix {int n, m;vector<vector<T>> dat;matrix(const vector<vector<T>>& _a) : dat(_a) {n = dat.size(), m = dat.front().size();}matrix(const int& _n, const int& _m) : n(_n), m(_m) {dat = vec<T>(n, m);}matrix() {}matrix operator*=(const matrix& a) {assert(m == a.n);matrix ret = matrix(vec<T>(n, a.m));FOR(i, 0, n)FOR(j, 0, a.m)FOR(k, 0, m) {(ret[i][j] += dat[i][k] * a.dat[k][j] % mod) %= mod;}return *this = ret;}matrix operator*(const matrix& a) { return matrix(*this) *= a; }matrix pow(ll k) {assert(n == m);matrix ret = matrix(vec<ll>(n, n)), a = dat;FOR(i, 0, n)ret[i][i] = 1;for (; 0 < k; k >>= 1) {if (k & 1)ret = ret * a;a = a * a;}return matrix(ret);}T sum() {ll ret = 0;FOR(i, 0, n)FOR(j, 0, m)(ret += dat[i][j]) %= mod;return ret;}vector<T>& operator[](int i) { return dat[i]; }};int main() {init();int m, k; cin >> m >> k;matrix<ll> x(m, m), y(m, m);x.dat[0][0] = 1;FOR(i, 0, m)FOR(j, 0, m) {++y.dat[(i + j) % m][i];++y.dat[(i * j) % m][i];}print((x* y.pow(k)).dat[0][0]);}