Codeforces 894B Ralph And His Magic Field

最新推荐文章于 2020-12-05 16:43:43 发布

原创最新推荐文章于 2020-12-05 16:43:43 发布 · 1k 阅读

0 ·

CC 4.0 BY-SA版权

数论专栏收录该内容

12 篇文章

订阅专栏

探讨了一个n*m的矩阵中填入数字，使每行每列的乘积为1或-1的问题。通过分析得出，只需关注(n-1)*(m-1)个格子的填法，最终的答案为2的(n-1)*(m-1)次方模10^9+7。

Ralph has a magic field which is divided into n × m blocks. That is to say, there are n rows and m columns on the field. Ralph can put an integer in each block. However, the magic field doesn't always work properly. It works only if the product of integers in each row and each column equals to k, where k is either 1 or -1.

Now Ralph wants you to figure out the number of ways to put numbers in each block in such a way that the magic field works properly. Two ways are considered different if and only if there exists at least one block where the numbers in the first way and in the second way are different. You are asked to output the answer modulo 1000000007 = 109 + 7.

Note that there is no range of the numbers to put in the blocks, but we can prove that the answer is not infinity.

Input

The only line contains three integers n, m and k (1 ≤ n, m ≤ 1018, k is either 1 or -1).

Output

Print a single number denoting the answer modulo 1000000007.

Examples

input
1 1 -1

output
1

input
1 3 1

output
1

input
3 3 -1

output
16

Note

In the first example the only way is to put -1 into the only block.

In the second example the only way is to put 1 into every block.

题目大意：给你n*m的格子，让你在里面填数字，使得每一行每一列的乘积为k，k可以是1或-1，求有多少种填数字的办法

每个格子填的肯定只有1或-1，从每一行看，不管前面填的是什么，最后都一定有办法填一个数使得乘积满足题目要求，每一列也是如此。所以填数的办法就是(n-1)*(m-1)个，又因为只能填1或-1，所有答案就是2的(n-1)*(m-1)次方。又因为n和m都特别大，所以需要自己写一个快速幂。如果n和m的奇偶性不同且k是-1，就一定没有办法填数

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
ll q_pow(ll a,ll b){
	ll ans=1;
	while(b){
		if(b&1) ans=ans*a%mod;
		b>>=1;
		a=a*a%mod;
	}
	return ans;
}
int main(){
	ll n,m,k;
	while(cin>>n>>m>>k){
		if(((n%2)!=(m%2))&&k==-1) cout<<0<<endl;
		else cout<<q_pow(q_pow(2,n-1),m-1)<<endl;
	}
}