Cod sursa(job #2089513)
Utilizator | Baies Cosmin minut1 | Data | 16 decembrie 2017 17:45:13 |
---|---|---|---|
Problema | Matrice5 | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <iostream>
using namespace std;
int v[1005];
long long exponent(long long x, long long n)
{
long long a = 1;
while(n > 0)
{
if(n % 2 == 1)
{
a *= x;
n--;
}
x *= x;
n /= 2;
}
return a % 10007;
}
int main()
{
int n,m,p,k,t,i;
cin >> t;
for(i = 1; i <= t; i++)
{
cin >> n >> m >> p >> k;
cout << exponent(k*p, (n-1)*(m-1)) * exponent(p, n+m-1) % 10007 << "\n";
}
return 0;
}