제출 #1100847

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1100847		vincentbucourt1	Calvinball championship (CEOI15_teams)	C++14	0 / 100	2 ms	336 KiB

teams

#include <bits/stdc++.h>
using namespace std;
void fastIO() {
    ios_base::sync_with_stdio(false), cin.tie(0);
}
#define int long long

const int MOD = 1e9 + 7;
const int MAXN = 10001;

int N;
int vals[MAXN];

int ans = 0;

long long modular(long long base, long long exp, int mod) {
   long long res = 1;
   while (exp > 0) {
      if (exp % 2 == 1)
         res= (res * base) % mod;
      exp = exp >> 1;
      base = (base * base) % mod;
   }
   return res;
}

signed main() {
    fastIO();

    cin >> N;
    for (int i = 0; i < N; i++) {
        cin >> vals[i];
    }
    reverse(vals, vals + N);

    for (int i = 0; i < N; i++) {
        ans += ((vals[i] - 1) * modular(N, i, MOD)) % MOD;
        ans %= MOD;
    }
    cout << ans << "\n";
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10