If you think codes, eat codes then sometimes you may get stressed. In your dreams you may see huge codes, as I have seen once. Here is the code I saw in my dream.
#include <stdio.h>
int cases, caseno;
int n, K, MOD;
int A[1001];
int main() {
scanf("%d", &cases);
while( cases-- ) {
scanf("%d %d %d", &n, &K, &MOD);
int i, i1, i2, i3, ... , iK;
for( i = 0; i < n; i++ ) scanf("%d", &A[i]);
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;
}
...
}
}
}
printf("Case %d: %d\n", ++caseno, res);
}
return 0;
}
Actually the code was about: 'You are given three integers n, K, MOD and n integers: A0, A1, A2 ... An-1, you have to write K nested loops and calculate the summation of all Ai where i is the value of any nested loop variable.'
Input
Input starts with an integer T (≤ 100), denoting the number of test cases.
Each case starts with three integers: n (1 ≤ n ≤ 1000), K (1 ≤ K < 231), MOD (1 ≤ MOD ≤ 35000). The next line contains n non-negative integers denoting A0, A1, A2 ... An-1. Each of these integers will be fit into a 32 bit signed integer.
Output
For each case, print the case number and result of the code.
Sample Input
2
3 1 35000
1 2 3
2 3 35000
1 2
Sample Output
Case 1: 6
Case 2: 36
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll pow_mod(ll a, ll n, ll m)
{
if(n == 0) return 1;
ll x = pow_mod(a, n/2, m);
long long ans = (long long)x * x % m;
if(n % 2 == 1) ans = ans *a % m;
return ans;//
}
ll a[600000];
int main()
{
//<<log10(10)<<endl;
int t;
scanf("%d",&t);
int f=0;
while(t--)
{
ll n,k,mod;
scanf("%lld%lld%lld",&n,&k,&mod);
ll sum=0;
for(ll i=1;i<=n;i++)
{
scanf("%lld",&a[i]);
sum+=a[i];
sum%=mod;
}
ll s1=pow_mod(n,k-1,mod);
ll s=s1*sum*k%mod;
printf("Case %d: %lld\n",++f,s);//±ðÍü*100
}
}