結果
問題 | No.1035 Color Box |
ユーザー |
![]() |
提出日時 | 2020-04-24 22:49:25 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 652 ms / 2,000 ms |
コード長 | 2,595 bytes |
コンパイル時間 | 2,823 ms |
コンパイル使用メモリ | 193,592 KB |
最終ジャッジ日時 | 2025-01-10 00:19:16 |
ジャッジサーバーID (参考情報) |
judge5 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 36 |
ソースコード
#include<bits/stdc++.h>using namespace std;typedef long long ll;#define F first#define S second#define pii pair<int, int>#define eb emplace_back#define all(v) v.begin(), v.end()#define rep(i, n) for (int i = 0; i < (n); ++i)#define rep3(i, l, n) for (int i = l; i < (n); ++i)#define sz(v) (int)v.size()#define endl '\n'const int inf = 1000000007;const ll INF = 1e18;// int mod = 998244353;int mod = 1000000007;#define abs(x) (x >= 0 ? x : -(x))#define lb(v, x) (int)(lower_bound(all(v), x) - v.begin())#define ub(v, x) (int)(upper_bound(all(v), x) - v.begin())template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return 1; } return 0; }template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return 1; } return 0; }ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }ll pow(ll a, int b) { return b ? pow(a * a, b / 2) * (b % 2 ? a : 1) : 1; }ll modpow(ll a, ll b, ll _mod) { return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1; }template<class T, class U> ostream& operator << (ostream& os, const pair<T, U>& p) { os << p.F << " " << p.S; return os; }template<class T> ostream& operator << (ostream& os, const vector<T>& vec) { rep(i, sz(vec)) { if (i) os << " "; os << vec[i]; } return os; }template<typename T> inline istream& operator >> (istream& is, vector<T>& v) { rep(j, sz(v)) is >> v[j]; return is; }template<class T, class T2> inline void add(T &a, T2 b) { a += b; if (a >= mod) a -= mod; }void solve();int main() {ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);cout << fixed << setprecision(10);int T;// cin >> T;T = 1;while (T--) {solve();}}const int MAX = 2000005;ll fac[MAX], finv[MAX], inv[MAX];// テーブルを作る前処理void COMinit() {fac[0] = fac[1] = 1;finv[0] = finv[1] = 1;inv[1] = 1;for (int i = 2; i < MAX; i++){fac[i] = fac[i - 1] * i % mod;inv[i] = mod - inv[mod % i] * (mod / i) % mod;finv[i] = finv[i - 1] * inv[i] % mod;}}// 二項係数計算ll COM(int n, int k) {if (n < k) return 0;if (n < 0 || k < 0) return 0;return fac[n] * (finv[k] * finv[n - k] % mod) % mod;}void solve() {int n, m;cin >> n >> m;COMinit();ll ans = 0;for (int i = m; i >= 1; --i) {if ((m - i) % 2 == 0) {add(ans, COM(m, i) * modpow(i, n, mod) % mod);} else {add(ans, mod - COM(m, i) * modpow(i, n, mod) % mod);}}cout << ans << endl;}