competitive-programming/solved-lightOj/1213.cpp at master · the-redback/competitive-programming · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
/**
 *                                   ____
 *       ____ ___  ____ ________  __/ __/
 *      / __ `__ \/ __ `/ ___/ / / / /_
 *     / / / / / / /_/ / /  / /_/ / __/
 *    /_/ /_/ /_/\__,_/_/   \__,_/_/
 *
 *    @link : https://the-redback.com
 */

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long llu;

#define ft        first
#define sd        second
#define mp        make_pair
#define pb(x)     push_back(x)
#define all(x)    x.begin(), x.end()
#define allr(x)   x.rbegin(), x.rend()
#define mem(a, b) memset(a, b, sizeof(a))
#define inf       1e9
#define eps       1e-9
#define mod       1000000007
#define NN        100010

#define read(a) scanf("%lld", &a)

/*

sum=a[0]+a[1]+....+a[n];

answer=(sum*(n^(k-1))*k)%mod;

*/

//(m^n)%p;
ll check(ll m, ll n, ll p) {
    int sum;
    if (n == 0) return 1;
    if (n % 2 == 0) {
        sum = check(m, n / 2, p);
        return ((sum % p) * (sum % p)) % p;
    } else {
        sum = check(m, n - 1, p);
        return ((m % p) * (sum % p)) % p;
    }
}

int main() {
// ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef redback
    freopen("C:\\Users\\Maruf\\Desktop\\in.txt", "r", stdin);
#endif

    ll t = 1, tc;
    read(tc);
    ll i, j, k, l, m, n;
    while (tc--) {
        read(n);
        read(k);
        read(m);

        ll sum = 0, ans = 0;

        for (i = 0; i < n; i++) {
            read(l);
            sum += l;
        }

        ans = ((sum % m * check(n, k - 1, m)) % m * k % m) % m;

        printf("Case %lld: %lld\n", t++, ans);
    }
    return 0;
}