結果
問題 | No.1081 和の和 |
ユーザー |
|
提出日時 | 2020-06-19 21:26:28 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 4 ms / 2,000 ms |
コード長 | 5,097 bytes |
コンパイル時間 | 2,890 ms |
コンパイル使用メモリ | 197,692 KB |
最終ジャッジ日時 | 2025-01-11 05:42:35 |
ジャッジサーバーID (参考情報) |
judge1 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 8 |
ソースコード
#include <bits/stdc++.h>/*** @title Modint* @docs mint.md*/template <uint32_t M> class ModInt{public:constexpr static uint32_t MOD = M;uint64_t val;constexpr ModInt(): val(0){}constexpr ModInt(int64_t n){if(n >= M) val = n % M;else if(n < 0) val = n % M + M;else val = n;}inline constexpr auto operator+(const ModInt &a) const {return ModInt(val + a.val);}inline constexpr auto operator-(const ModInt &a) const {return ModInt(val - a.val);}inline constexpr auto operator*(const ModInt &a) const {return ModInt(val * a.val);}inline constexpr auto operator/(const ModInt &a) const {return ModInt(val * a.inv().val);}inline constexpr auto& operator=(const ModInt &a){val = a.val; return *this;}inline constexpr auto& operator+=(const ModInt &a){if((val += a.val) >= M) val -= M; return *this;}inline constexpr auto& operator-=(const ModInt &a){if(val < a.val) val += M; val -= a.val; return *this;}inline constexpr auto& operator*=(const ModInt &a){(val *= a.val) %= M; return *this;}inline constexpr auto& operator/=(const ModInt &a){(val *= a.inv().val) %= M; return *this;}inline constexpr bool operator==(const ModInt &a) const {return val == a.val;}inline constexpr bool operator!=(const ModInt &a) const {return val != a.val;}inline constexpr auto& operator++(){*this += 1; return *this;}inline constexpr auto& operator--(){*this -= 1; return *this;}inline constexpr auto operator++(int){auto t = *this; *this += 1; return t;}inline constexpr auto operator--(int){auto t = *this; *this -= 1; return t;}inline constexpr static ModInt power(int64_t n, int64_t p){if(p < 0) return power(n, -p).inv();int64_t ret = 1, e = n % M;for(; p; (e *= e) %= M, p >>= 1) if(p & 1) (ret *= e) %= M;return ret;}inline constexpr static ModInt inv(int64_t a){int64_t b = M, u = 1, v = 0;while(b){int64_t t = a / b;a -= t * b; std::swap(a,b);u -= t * v; std::swap(u,v);}u %= M;if(u < 0) u += M;return u;}inline constexpr static auto frac(int64_t a, int64_t b){return ModInt(a) / ModInt(b);}inline constexpr auto power(int64_t p) const {return power(val, p);}inline constexpr auto inv() const {return inv(val);}friend inline constexpr auto operator-(const ModInt &a){return ModInt(-a.val);}friend inline constexpr auto operator+(int64_t a, const ModInt &b){return ModInt(a) + b;}friend inline constexpr auto operator-(int64_t a, const ModInt &b){return ModInt(a) - b;}friend inline constexpr auto operator*(int64_t a, const ModInt &b){return ModInt(a) * b;}friend inline constexpr auto operator/(int64_t a, const ModInt &b){return ModInt(a) / b;}friend std::istream& operator>>(std::istream &s, ModInt<M> &a){s >> a.val; return s;}friend std::ostream& operator<<(std::ostream &s, const ModInt<M> &a){s << a.val; return s;}template <int N>inline static auto div(){static auto value = inv(N);return value;}explicit operator int32_t() const noexcept {return val;}explicit operator int64_t() const noexcept {return val;}};/*** @title Precalculation for combinatotion* @docs combinatorics.md* @attention 使用前にinit関数を呼び出す*/template <typename T> class Combinatorics{public:static std::vector<T> facto;static std::vector<T> ifacto;static void init(int N){facto.assign(N+1, 1);ifacto.assign(N+1, 1);for(int i = 1; i <= N; ++i){facto[i] = facto[i-1] * i;}ifacto[N] = facto[N].inv();for(int i = N-1; i >= 0; --i){ifacto[i] = ifacto[i+1] * (i+1);}}static T f(int64_t i){assert(i < facto.size());return facto[i];}static T finv(int64_t i){assert(i < ifacto.size());return ifacto[i];}static T P(int64_t n, int64_t k);static T C(int64_t n, int64_t k);static T H(int64_t n, int64_t k);static T stirling_number(int64_t n, int64_t k);static T bell_number(int64_t n, int64_t k);static std::vector<T> bernoulli_number(int64_t n);static T catalan_number(int64_t n);};template <typename T> std::vector<T> Combinatorics<T>::facto = std::vector<T>();template <typename T> std::vector<T> Combinatorics<T>::ifacto = std::vector<T>();template <typename T> T Combinatorics<T>::P(int64_t n, int64_t k){if(n < k or n < 0 or k < 0) return 0;return f(n) * finv(n-k);}template <typename T> T Combinatorics<T>::C(int64_t n, int64_t k){if(n < k or n < 0 or k < 0) return 0;return P(n,k) * finv(k);}template <typename T> T Combinatorics<T>::H(int64_t n, int64_t k){if(n == 0 and k == 0) return 1;return C(n+k-1, k);}using mint = ModInt<1000000007>;using C = Combinatorics<mint>;int main(){C::init(300);int N;while(std::cin >> N){std::vector<int> A(N);for(int i = 0; i < N; ++i) std::cin >> A[i];mint ans = 0;for(int i = 0; i < N; ++i){ans += C::C(N-1, i) * A[i];}std::cout << ans << "\n";}return 0;}