题意:求下列程序结果。
int res = 0;
for( i1 = 0; i1 < n; i1++ ) {
for( i2 = 0; i2 < n; i2++ ) {
for( i3 = 0; i3 < n; i3++ ) {
...
for( iK = 0; iK < n; iK++ ) {
res = ( res + A[i1] + A[i2] + ... + A[iK] ) % MOD;
}
...
}
}
}
题解:排列组合
对于A[i1],总共出现nk-1个sum,总共k个,答案就是nk-1sumk。
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<fstream>
#include<map>
#define ll long long
using namespace std;
ll fastpow(ll base, ll n, ll mod) {
ll ans = 1;
while (n) {
if (n & 1) ans *= base % mod, ans %= mod;
base *= base, base %= mod;
n >>= 1;
}
return ans % mod;
}
int t, n, k, mod, a[1111];
int main() {
scanf("%d", &t);
int cas = 0;
while (t--) {
scanf("%d%d%d", &n, &k, &mod);
ll sum = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
sum += a[i], sum %= mod;
}
cout << "Case " << ++cas << ": ";
cout << (k * fastpow(n, k - 1, mod) * sum) % mod << endl;
}
return 0;
}