ACM-ICPC 2018 徐州赛区网络预赛-A-Hard to prepare（瞎搞）

After Incident, a feast is usually held in Hakurei Shrine. This time Reimu asked Kokoro to deliver a Nogaku show during the feast. To enjoy the show, every audience has to wear a Nogaku mask, and seat around as a circle.

There are N guests Reimu serves. Kokoro has 2^k2k masks numbered from 0,1,\cdots,0,1,⋯, 2^k - 12k−1, and every guest wears one of the masks. The masks have dark power of Dark Nogaku, and to prevent guests from being hurt by the power, two guests seating aside must ensure that if their masks are numbered ii and jj , then ii XNOR jj must be positive. (two guests can wear the same mask). XNOR means ~(ii^jj) and every number has kk bits. (11 XNOR 1 = 11=1, 00 XNOR 0 = 10=1, 11 XNOR 0 = 00=0)

You may have seen 《A Summer Day's dream》, a doujin Animation of Touhou Project. Things go like the anime, Suika activated her ability, and the feast will loop for infinite times. This really troubles Reimu: to not make her customers feel bored, she must prepare enough numbers of different Nogaku scenes. Reimu find that each time the same guest will seat on the same seat, and She just have to prepare a new scene for a specific mask distribution. Two distribution plans are considered different, if any guest wears different masks.

In order to save faiths for Shrine, Reimu have to calculate that to make guests not bored, how many different Nogaku scenes does Reimu and Kokoro have to prepare. Due to the number may be too large, Reimu only want to get the answer modules 1e9+71e9+7 . Reimu did never attend Terakoya, so she doesn't know how to calculate in module. So Reimu wishes you to help her figure out the answer, and she promises that after you succeed she will give you a balloon as a gift.

Input

First line one number TT , the number of testcases; (T \le 20)(T≤20) .

Next TT lines each contains two numbers, NN and k(0<N, k \le 1e6)k(0<N,k≤1e6) .

Output

For each testcase output one line with a single number of scenes Reimu and Kokoro have to prepare, the answer modules 1e9+71e9+7 .

样例输入复制

2
3 1
4 2

样例输出复制

2
84

题目来源

ACM-ICPC 2018 徐州赛区网络预赛

题意：n个人组成一个环，现在有数字从1到2^k-1,每个人可以选择一个数字，相邻两个人选择的数字同或值不能为0，问你有多少分配方案

题解：很容易想到，我们可以固定一个位置和倒数第2个位置，则对于这两个位置夹着的位置有两种情况，要么两边的数一样，要么不一样，对于不一样的情况很好处理（详见代码），而对于两边相等的情况可以发现其实已经变成了n-2大小的子问题了。

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define ll long long
#define mod 1000000007
ll  q[1000005],n,k;
void init()
{
	q[0]=1;
	for(int i=1;i<=1000002;i++)
		q[i]=q[i-1]*2ll%mod;
}
ll qq(ll x,ll y)
{
	ll res=1;
	while(y)
	{
		if(y%2)
			res=res*x%mod;
		x=x*x%mod;
		y/=2;
	}
	return res;
}
ll work(int x)
{
	ll res=0;
	if(x==1) return q[k];
	if(x==2) return q[k]%mod*(q[k]-1)%mod;
	res=(q[k]*qq(q[k]-1,x-2)%mod*max(0ll,(q[k]-2))%mod+work(x-2))%mod;
	return res;
}
int main(void)
{
	init();
	int T;
	scanf("%d",&T);
	while(T--)
	{
		ll ans=0;
		scanf("%lld%lld",&n,&k);
		printf("%lld\n",work(n));
	}
	return 0;
}