CF 238A Not Wool Sequences

题目链接:http://codeforces.com/problemset/problem/238/A

题目大意:

如果有一个数组a1~an,存在一对l,r使得al⊕al+1⊕...⊕ar=0,称这个数组为羊毛数组.

求当0<=ai<=2^m时,有几个数组不为羊毛数组.

题目思路:

异或的自反性的应用.

对于这种题很讨厌,灵感题和经验啊....

设一个数组为b,使bi=ai⊕bi-1,则ai=bi-1⊕bi(b0=0)

设a[]不是羊毛数组,则 al⊕al+1⊕...⊕ar!=0 

即 bl-1⊕br!=0

因为l<=r,所以,b[]中的所有数两两不相同

又因为ai=bi-1⊕bi,所以bi的取值是在[1,2^m](i>0).

最后的答案就变成了,求有多少个长度为n的数组且数组中的数在[1,2^m]之间且各不相同.

嘟嘟傻水车,小数据找规律,DBL,又上了一课. ORZ....

代码:

#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;

#define ll long long
#define ls rt<<1
#define rs ls|1
#define lson l,mid,ls
#define rson mid+1,r,rs
#define middle (l+r)>>1
#define eps (1e-8)
#define type int
#define clr_all(x,c) memset(x,c,sizeof(x))
#define clr(x,c,n) memset(x,c,sizeof(x[0])*(n+1))
#define MOD 1000000009
#define inf 0x3f3f3f3f
#define pi acos(-1.0)
#define _max(x,y) (((x)>(y))? (x):(y))
#define _min(x,y) (((x)<(y))? (x):(y))
#define _abs(x) ((x)<0? (-(x)):(x))
#define getmin(x,y) (x= (x<0 || (y)<x)? (y):x)
#define getmax(x,y) (x= ((y)>x)? (y):x)
template <class T> void _swap(T &x,T &y){T t=x;x=y;y=t;}
int TS,cas=1;
const int M=10+5;
ll n,m;

void run(){
	ll i,j;
	ll ans=1,p=1;
	for(i=1;i<=m;i++) p=(p*2)%MOD;
	for(i=1;i<=n;i++) ans=(ans*(p-i))%MOD;
	printf("%I64d\n",ans);
}

void preSof(){
}

int main(){
	//freopen("input.txt","r",stdin);
	//freopen("output.txt","w",stdout);
	preSof();
	//run();
	while(~scanf("%I64d%I64d",&n,&m)) run();
	//for(scanf("%d",&TS);cas<=TS;cas++) run();
	return 0;
}