結果

問題 No.573 a^2[i] = a[i]
ユーザー はまやんはまやんはまやんはまやん
提出日時 2017-10-07 00:09:59
言語 C++14
(gcc 11.1.0 + boost 1.77.0)
結果
AC  
実行時間 44 ms / 2,000 ms
コード長 3,544 Byte
コンパイル時間 1,511 ms
使用メモリ 3,896 KB
最終ジャッジ日時 2021-08-25 20:17:36
合計ジャッジ時間 5,912 ms
ジャッジサーバーID
(参考情報)
judge11 / judge15
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 36 ms
3,896 KB
testcase_01 AC 36 ms
3,840 KB
testcase_02 AC 36 ms
3,716 KB
testcase_03 AC 36 ms
3,680 KB
testcase_04 AC 36 ms
3,760 KB
testcase_05 AC 36 ms
3,876 KB
testcase_06 AC 36 ms
3,712 KB
testcase_07 AC 36 ms
3,832 KB
testcase_08 AC 36 ms
3,832 KB
testcase_09 AC 36 ms
3,720 KB
testcase_10 AC 36 ms
3,632 KB
testcase_11 AC 36 ms
3,732 KB
testcase_12 AC 37 ms
3,632 KB
testcase_13 AC 36 ms
3,716 KB
testcase_14 AC 36 ms
3,764 KB
testcase_15 AC 36 ms
3,832 KB
testcase_16 AC 36 ms
3,732 KB
testcase_17 AC 37 ms
3,832 KB
testcase_18 AC 37 ms
3,828 KB
testcase_19 AC 37 ms
3,760 KB
testcase_20 AC 37 ms
3,832 KB
testcase_21 AC 36 ms
3,836 KB
testcase_22 AC 36 ms
3,836 KB
testcase_23 AC 36 ms
3,764 KB
testcase_24 AC 36 ms
3,836 KB
testcase_25 AC 36 ms
3,832 KB
testcase_26 AC 36 ms
3,728 KB
testcase_27 AC 37 ms
3,716 KB
testcase_28 AC 37 ms
3,712 KB
testcase_29 AC 37 ms
3,872 KB
testcase_30 AC 36 ms
3,832 KB
testcase_31 AC 36 ms
3,732 KB
testcase_32 AC 36 ms
3,680 KB
testcase_33 AC 36 ms
3,720 KB
testcase_34 AC 36 ms
3,832 KB
testcase_35 AC 36 ms
3,892 KB
testcase_36 AC 36 ms
3,876 KB
testcase_37 AC 36 ms
3,676 KB
testcase_38 AC 36 ms
3,876 KB
testcase_39 AC 36 ms
3,636 KB
testcase_40 AC 36 ms
3,892 KB
testcase_41 AC 36 ms
3,836 KB
testcase_42 AC 37 ms
3,832 KB
testcase_43 AC 36 ms
3,896 KB
testcase_44 AC 37 ms
3,788 KB
testcase_45 AC 37 ms
3,608 KB
testcase_46 AC 44 ms
3,876 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
//---------------------------------------------------------------------------------------------------
template<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u); }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
template<typename T, int FAC_MAX> struct Comb { vector<T> fac, ifac;
    Comb() {fac.resize(FAC_MAX, 1); ifac.resize(FAC_MAX, 1);rep(i, 1, FAC_MAX) fac[i] = fac[i - 1] * i;
        rep(i, 1, FAC_MAX) ifac[i] = T(1) / fac[i];}
    T aPb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b]; }
    T aCb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b] * ifac[b]; }
    T nHk(int n, int k) { if (n == 0 && k == 0) return T(1); if (n <= 0 || k < 0) return 0;
        return aCb(n + k - 1, k); }
};
typedef ModInt<1000000007> mint;
/*---------------------------------------------------------------------------------------------------
            ∧_∧  
      ∧_∧  (´<_` )  Welcome to My Coding Space!
     ( ´_ゝ`) /  ⌒i     
    /   \     | |     
    /   / ̄ ̄ ̄ ̄/  |  
  __(__ニつ/     _/ .| .|____  
     \/____/ (u ⊃  
---------------------------------------------------------------------------------------------------*/


int N;
Comb<mint, 101010> com;
//---------------------------------------------------------------------------------------------------
void _main() {
    cin >> N;

    mint ans = 0;
    rep(i, 1, N + 1) {
        mint a = com.aCb(N, i);
        mint b = mint(i) ^ (N - i);
        mint d = a * b;
        //cout << "[" << i << "]" << d << "(" << a << "," << b << ")" << endl;
        ans += d;
    }
    cout << ans << endl;
}
0