Binary Stirling Numbers

Original link: http://www.cnblogs.com/Willems/p/10964477.html

 http://poj.org/problem?id=1430

 

Title: seeking a second parity type Stirling i.e. number request s2 (n, m)% 2; 

 

Problem solution:  https://blog.csdn.net/ez_2016gdgzoi471/article/details/80219736

 

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#define LL long long
#define ULL unsigned long long
#define rep(i,j,k) for(int i=j;i<=k;i++)
#define dep(i,j,k) for(int i=k;i>=j;i--)
#define INF 0x3f3f3f3f
#define mem(i,j) memset(i,j,sizeof(i))
#define make(i,j) make_pair(i,j)
#define pb push_back
using namespace std;
int main() {
    int t;
    int n, m;
    scanf("%d", &t);
    while(t--) {
        scanf("%d %d", &n, &m);
        if(!n && !m) puts("1");
        else if(!n || !m || n < m) puts("0");
        else {
            int a = n - m;
            int b = ( m + 1) / 2;
            int x = b - 1;
            int y = a + b - 1;
            if( (x & y) == x) puts("1");
            else puts("0");
        }
    }
    return 0;
}

View Code

Reproduced in: https: //www.cnblogs.com/Willems/p/10964477.html