제출 #1104658

#제출 시각아이디문제언어결과실행 시간메모리
1104658ezzzayCalvinball championship (CEOI15_teams)C++14
0 / 100
3 ms2640 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define ff first #define ss second #define pb push_back const int N=3e5+5; const int mod=1e9+7; int a[N]; int po[N]; signed main(){ int n; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; } po[n+1]=1; int p=0; for(int i=n;i>=1;i--){ po[i]=po[i+1]*i%mod; } for(int i=1;i<=n;i++){ p+= (a[i]-1)*po[i+1]; p%=mod; } cout<<p; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...