Binomial Coefficients

最新推荐文章于 2022-07-29 20:53:29 发布

拥抱技术

最新推荐文章于 2022-07-29 20:53:29 发布

阅读量1k

点赞数

分类专栏：数论文章标签：数论

本文链接：https://blog.csdn.net/wuhuajunbao/article/details/24851313

版权

数论专栏收录该内容

15 篇文章 0 订阅

订阅专栏

Binomial Coefficients

Time Limit : 2000/1000ms (Java/Other) Memory Limit : 262144/131072K (Java/Other)

Total Submission(s) : 7 Accepted Submission(s) : 6

Problem Description

The binomial coefficient C(n, k) has been extensively studied for its importance in combinatorics. Binomial coefficients can be recursively defined as follows:

C(n, 0) = C(n, n) = 1 for all n > 0;
C(n, k) = C(n 1, k 1) + C(n 1, k) for all 0 < k < n.

Given n and k, you are to determine the parity of C(n, k).

Input

The input contains multiple test cases. Each test case consists of a pair of integers n and k (0 ≤ k ≤ n < 2³¹, n > 0) on a separate line.

End of file (EOF) indicates the end of input.

Output

For each test case, output one line containing either a “0” or a “1”, which is the remainder of C(n, k) divided by two.

Sample Input

Sample Output

代码如下：

#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
    int n , k ;
    while(scanf("%d %d",&n,&k)!=EOF)
    {
        int res = 0;
        int p1 = 2;
        int p2 = 2;
        int p3 = 2;
        while(n/p1)res+=n/p1,p1*=2;
        while(k/p2)res-=k/p2,p2*=2;
        while((n-k)/p3)res-=(n-k)/p3,p3*=2;
        if(res == 0) printf("1\n");
        else
            printf("0\n");
    }
    return 0;
}