| 25 | } |
| 26 | |
| 27 | int main() { |
| 28 | // �z��̏������ifact[i] �� i �̊K��� 1000000007 �Ŋ������]��j |
| 29 | fact[0] = 1; |
| 30 | for (int i = 1; i <= 200000; i++) fact[i] = 1LL * i * fact[i - 1] % mod; |
| 31 | |
| 32 | // ���� |
| 33 | cin >> N; |
| 34 | for (int i = 1; i <= N; i++) cin >> A[i]; |
| 35 | |
| 36 | // ���������߂� �� �����̏o�� |
| 37 | for (int i = 1; i <= N; i++) { |
| 38 | Answer += A[i] * ncr(N - 1, i - 1); |
| 39 | Answer %= mod; |
| 40 | } |
| 41 | cout << Answer << endl; |
| 42 | return 0; |
| 43 | } |