1575K - Knitting Batik - CodeForces Solution


implementation math *2200

Please click on ads to support us..

C++ Code:

#include <cstdio>
const long long MOD = 1000000007;
long long POWER(long long a, long long b, long long c)
{
	long long r = 1 % c;
	for (; b; b >>= 1)
	{
		if (b & 1)
			r = r * a % c;
		a = a * a % c;
	}
	return r;
}
int main()
{
	int n, m, k, r, c;
	scanf("%d%d%d%d%d", &n, &m, &k, &r, &c);
	int ax, ay, bx, by;
	scanf("%d%d%d%d", &ax, &ay, &bx, &by);
	if (ax == bx && ay == by)
		printf("%lld\n", POWER(k, (long long)n * m % (MOD - 1), MOD));
	else
		printf("%lld\n", POWER(k, ((long long)n * m - (long long)r * c) % (MOD - 1), MOD));
	return 0;
}


Comments

Submit
0 Comments
More Questions

979A - Pizza Pizza Pizza
731A - Night at the Museum
742A - Arpa’s hard exam and Mehrdad’s naive cheat
1492A - Three swimmers
1360E - Polygon
1517D - Explorer Space
1230B - Ania and Minimizing
1201A - Important Exam
676A - Nicholas and Permutation
431A - Black Square
474B - Worms
987B - High School Become Human
1223A - CME
1658B - Marin and Anti-coprime Permutation
14B - Young Photographer
143A - Help Vasilisa the Wise 2
320A - Magic Numbers
1658A - Marin and Photoshoot
514A - Chewbaсca and Number
382A - Ksenia and Pan Scales
734B - Anton and Digits
1080A - Petya and Origami
1642D - Repetitions Decoding
1440A - Buy the String
1658F - Juju and Binary String
478A - Initial Bet
981A - Antipalindrome
365A - Good Number
1204B - Mislove Has Lost an Array
1409D - Decrease the Sum of Digits