結果
問題 | No.1035 Color Box |
ユーザー |
👑 |
提出日時 | 2024-01-20 02:51:44 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 54 ms / 2,000 ms |
コード長 | 3,685 bytes |
コンパイル時間 | 1,084 ms |
コンパイル使用メモリ | 124,104 KB |
最終ジャッジ日時 | 2025-02-18 21:45:45 |
ジャッジサーバーID (参考情報) |
judge4 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 36 |
ソースコード
//yukicoder@cpp17#include <iostream>#include <iomanip>#include <algorithm>#include <cmath>#include <cctype>#include <climits>#include <cassert>#include <string>#include <vector>#include <set>#include <stack>#include <queue>#include <map>#include <random>#include <bitset>#include <complex>#include <utility>#include <numeric>#include <functional>using namespace std;using ll = long long;using P = pair<ll,ll>;const ll MOD = 998244353;const ll MODx = 1000000007;const int INF = (1<<30)-1;const ll LINF = (1LL<<62LL)-1;const double EPS = (1e-10);P ar4[4] = {{0,1},{0,-1},{1,0},{-1,0}};P ar8[8] = {{-1,-1},{-1,0},{-1,1},{0,-1},{0,1},{1,-1},{1,0},{1,1}};template <typename T> vector<T> make_vector(size_t a, T b) { return vector<T>(a, b); }template <typename... Ts> auto make_vector(size_t a, Ts... ts) { return vector<decltype(make_vector(ts...))>(a, make_vector(ts...)); }/*確認ポイントcout << fixed << setprecision(n) << 小数計算//n桁の小数表記になる計算量は変わらないが楽できるシリーズmin(max)_element(iter,iter)で一番小さい(大きい)値のポインタが帰ってくるcount(iter,iter,int)でintがiterからiterの間にいくつあったかを取得できる*//*function corner below*//*Function corner above*//* comment outed because can cause bugs__attribute__((constructor))void initial() {cin.tie(0);ios::sync_with_stdio(false);}*/template <int mod>struct ModInt{int n;ModInt():n(0){}ModInt(long long n_):n(n_ >= 0 ? n_%mod : mod - ((-n_)%mod) ){}ModInt(int n_):n(n_ >= 0 ? n_%mod : mod - ((-n_)%mod) ){}ModInt &operator+=(const ModInt &p){if((n+=p.n) >= mod)n-=mod;return *this;}ModInt &operator-=(const ModInt &p){n+=mod-p.n;if(n >= mod)n-=mod;return *this;}ModInt &operator*=(const ModInt &p){n = (int) ((1LL*n*p.n)%mod);return *this;}ModInt &operator/=(const ModInt &p){*this *= p.inverse();return *this;}ModInt operator-() const {return ModInt(-n);}ModInt operator+(const ModInt &p) const {return ModInt(*this) += p;}ModInt operator-(const ModInt &p) const {return ModInt(*this) -= p;}ModInt operator*(const ModInt &p) const {return ModInt(*this) *= p;}ModInt operator/(const ModInt &p) const {return ModInt(*this) /= p;}bool operator==(const ModInt &p) const {return n==p.n;}bool operator<(const ModInt &p) const {return n<p.n;}bool operator>(const ModInt &p) const {return n>p.n;}bool operator>=(const ModInt &p) const {return n>=p.n;}bool operator<=(const ModInt &p) const {return n<=p.n;}bool operator!=(const ModInt &p) const {return n!=p.n;}ModInt inverse() const {int a = n,b = mod,u = 1,v = 0;while(b){int t = a/b;a -= t*b; swap(a,b);u -= t*v; swap(u,v);}return ModInt(u);}ModInt pow(int64_t z) const {ModInt ret(1),mul(n);while(z > 0){if(z & 1) ret *= mul;mul *= mul;z >>= 1;}return ret;}friend ostream &operator<<(ostream &os, const ModInt &p){return os << p.n;}friend istream &operator>>(istream &is, ModInt &a){int64_t t;is >> t;a = ModInt<mod> ((long long)t);return (is);}};using mint = ModInt<MODx>;mint kaijo[100010];int main(){int n,m;cin>>n>>m;kaijo[0] = 1;for(int i = 1; n >= i; i++){kaijo[i] = kaijo[i-1]*i;}mint ans = 0;for(int i = 0; m >= i; i++){if((m-i)%2 == 0){ans += kaijo[m]/kaijo[m-i]/kaijo[i]*((mint)i).pow(n);}else{ans -= kaijo[m]/kaijo[m-i]/kaijo[i]*((mint)i).pow(n);}}cout << ans << endl;return 0;}