結果
問題 | No.797 Noelちゃんとピラミッド |
ユーザー |
![]() |
提出日時 | 2019-03-15 23:20:13 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 88 ms / 2,000 ms |
コード長 | 3,586 bytes |
コンパイル時間 | 1,851 ms |
コンパイル使用メモリ | 170,472 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-01 21:39:47 |
合計ジャッジ時間 | 6,213 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 60 |
ソースコード
#include<bits/stdc++.h>using namespace std;#define ll long long#define FOR(i,n,m) for(int i=(n);i<(m);i++)#define REP(i,n) for(int i=0;i<(n);i++)#define REPR(i,n) for(int i=(n);i>=0;i--)#define all(vec) vec.begin(),vec.end()using vi=vector<int>;using vvi=vector<vi>;using vl=vector<ll>;using vvl=vector<vl>;using P=pair<ll,ll>;using PP=pair<ll,P>;using vp=vector<P>;using vpp=vector<PP>;using vs=vector<string>;#define fi first#define se second#define pb push_backtemplate<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}template<class T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}template<typename A,typename B>istream&operator>>(istream&is,pair<A,B> &p){is>>p.fi>>p.se;return is;}template<typename A,typename B>ostream&operator<<(ostream&os,const pair<A,B> &p){os<<"("<<p.fi<<","<<p.se<<")";return os;}template<typename T>istream&operator>>(istream&is,vector<T> &t){REP(i,t.size())is>>t[i];return is;}template<typename T>ostream&operator<<(ostream&os,const vector<T>&t){os<<"{";REP(i,t.size()){if(i)os<<",";os<<t[i];}cout<<"}";return os;}const ll MOD=1000000007LL;const int INF=1<<30;const ll LINF=1LL<<60;template<int mod>struct ModInt{int x;ModInt():x(0){}ModInt(long long y):x(y>=0?y%mod:(mod-(-y)%mod)%mod){}ModInt &operator+=(const ModInt &p){if((x+=p.x)>=mod)x-=mod;return *this;}ModInt &operator-=(const ModInt &p){if((x+=mod-p.x)>=mod)x-=mod;return *this;}ModInt &operator*=(const ModInt &p){x=(int)(1LL*x*p.x%mod);return *this;}ModInt &operator/=(const ModInt &p){*this*=p.inverse();return *this;}ModInt operator-()const{return ModInt(-x);}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 x==p.x;}bool operator!=(const ModInt &p)const{return x!=p.x;}ModInt inverse()const{int a=x,b=mod,u=1,v=0,t;while(b>0){t=a/b;a-=t*b;swap(a,b);u-=t*v;swap(u,v);}return ModInt(u);}friend ostream &operator<<(ostream &os,const ModInt<mod> &p){return os<<p.x;}friend istream &operator>>(istream &is,ModInt<mod> &a){long long x;is>>x;a=ModInt<mod>(x);return (is);}};template<int mod>struct Combination{using mint=ModInt<mod>;vector<mint> fact;Combination(int n){n++;fact.resize(n);for(int i=0;i<n;i++){if(!i){fact[i]=1;}else{fact[i]=fact[i-1]*i;}}}mint P(int n,int r){if(n<r){return 0;}return fact[n]/fact[n-r];}mint C(int n,int r){if(n<r){return 0;}return fact[n]/fact[r]/fact[n-r];}mint H(int n,int r){if(!n&&!r){return 1;}if(n+r-1<r){return 0;}return C(n+r-1,r);}};const int mod=1e9+7;using mint=ModInt<mod>;int main(){int n;cin>>n;mint ans=0;Combination<mod> C(n);REP(i,n){mint t;cin>>t;ans+=t*C.C(n-1,i);}cout<<ans<<endl;return 0;}