Bears and Juice--CodeForces - 643F （组合数学）

题目链接：https://vjudge.net/problem/CodeForces-643F

                                                   Bears and Juice

There are n bears in the inn and p places to sleep. Bears will party together for some number of nights (and days).

Bears love drinking juice. They don't like wine but they can't distinguish it from juice by taste or smell.

A bear doesn't sleep unless he drinks wine. A bear must go to sleep a few hours after drinking a wine. He will wake up many days after the party is over.

Radewoosh is the owner of the inn. He wants to put some number of barrels in front of bears. One barrel will contain wine and all other ones will contain juice. Radewoosh will challenge bears to find a barrel with wine.

Each night, the following happens in this exact order:

1. Each bear must choose a (maybe empty) set of barrels. The same barrel may be chosen by many bears.
2. Each bear drinks a glass from each barrel he chose.
3. All bears who drink wine go to sleep (exactly those bears who chose a barrel with wine). They will wake up many days after the party is over. If there are not enough places to sleep then bears lose immediately.

At the end, if it's sure where wine is and there is at least one awake bear then bears win (unless they have lost before because of the number of places to sleep).

Radewoosh wants to allow bears to win. He considers q scenarios. In the i-th scenario the party will last for i nights. Then, let Ri denote the maximum number of barrels for which bears surely win if they behave optimally. Let's define . Your task is to find , where  denotes the exclusive or (also denoted as XOR).

Note that the same barrel may be chosen by many bears and all of them will go to sleep at once.

Input

The only line of the input contains three integers n, p and q (1 ≤ n ≤ 109, 1 ≤ p ≤ 130, 1 ≤ q ≤ 2 000 000) — the number of bears, the number of places to sleep and the number of scenarios, respectively.

Output

Print one integer, equal to .

Examples

Input

5 1 3

Output

32

Input

1 100 4

Output

4

Input

3 2 1

Output

7

Input

100 100 100

Output

381863924

Note

In the first sample, there are 5 bears and only 1 place to sleep. We have R1 = 6, R2 = 11, R3 = 16 so the answer is . Let's analyze the optimal strategy for scenario with 2 days. There are R2 = 11 barrels and 10 of them contain juice.

• In the first night, the i-th bear chooses a barrel i only.
  • If one of the first 5 barrels contains wine then one bear goes to sleep. Then, bears win because they know where wine is and there is at least one awake bear.
  • But let's say none of the first 5 barrels contains wine. In the second night, the i-th bear chooses a barrel 5 + i.
    • If one of barrels 6 – 10 contains wine then one bear goes to sleep. And again, bears win in such a situation.
    • If nobody went to sleep then wine is in a barrel 11.

In the second sample, there is only one bear. He should choose an empty set of barrels in each night. Otherwise, he would maybe get wine and bears would lose (because there must be at least one awake bear). So, for any number of days we have Ri = 1. The answer is .

这个题当时做的时候没读懂，太菜了。。。

题意： 

 解题思路：

我们这样考虑：最后我们可以知道那些熊睡了，那些熊没睡。

对于一只睡了的熊可能在i天内的任何一天开始睡的。可能性有i种。

因为最后至少要有一只熊醒着，所以睡了的熊最多为 min(n-1,p)，最多只有p张床。

所以，当天数为i时，我们可以得到下面那个公式：

知道了Ri，计算Xi就简单了。

枚举p,q;时间复杂度为O(pq)。

还要注意C(n,j)的求解。因为n的值很大，值可能超范围，所以我们采用下面这样来求。

因为 j<=p ;先枚举 j ，求C(n,j)。

我们可以用两个数组分别记录分母和分子上的数。

然后暴力枚举上下的每一项，除以它们的 gcd 进行约分。

这样到最后，分母一定会被约为 1，时间复杂度为 O(p^3*logp)。

总的时间复杂度为O(pq+p^3*(logp))

思路来自：https://www.xht37.com/cf643f-bears-and-juice-题解/

AC代码：

#include <iostream>//注意数值的范围，无符号long long型 ，否则不对
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <vector>
#include <string>
#define cla(a, sum) memset(a, sum, sizeof(a))
#define rap(i, m, n) for(i=m; i<=n; i++)
#define rep(i, m, n) for(i=m; i>=n; i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
const int Inf = 0x3f3f3f3f;
const double eps = 1e-8;
const int maxn = 3e4;
const ll mod = 4294967296;

ull n,p,q;
ull f[155],m;
ull a[155],b[155];

ull gcd(ull x,ull y){
   while(y){
   	   ull c=y;
   	   y=x%y;
   	   x=c;
   }	
   return x;
}

ull cal(ull x)
{
	ull i,j,k;
	ull ans=1;
	rap(i,1,x){
		a[i]=n-i+1;
		b[i]=i;
	}
	rap(i,1,x){
		rap(j,1,x){
			k=gcd(a[i],b[j]);
			a[i]/=k;b[j]/=k;
		}	
	}
	rap(i,1,x){
		ans=a[i]%mod*ans%mod;
	}
	return ans%mod;
}

int main()
{
    cin>>n>>p>>q;
    ull sum=0,ans;
    ull i,j,k;
    m=min(n-1,p);
    rap(i,0,m){
    	if(i==0){
    		f[i]=1;
    		continue;
		}
    	f[i]=cal(i);
	}
    for(i=1;i<=q;i++){
    	k=1;ans=0;
    	for(j=0;j<=m;j++,k=k*i%mod){
    		ans=(ans+f[j]*k%mod)%mod;
		}
		ans=i*ans%mod;
		sum^=ans;
	}
	cout<<sum<<endl;
	return 0;
}