CodeForces 627A XOR Equation（异或）

http://codeforces.com/problemset/problem/627/A

A. XOR Equation

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Two positive integers a and b have a sum of s and a bitwise XOR of x. How many possible values are there for the ordered pair (a, b)?

Input

The first line of the input contains two integers s and x (2 ≤ s ≤ 1012, 0 ≤ x ≤ 1012), the sum and bitwise xor of the pair of positive integers, respectively.

Output

Print a single integer, the number of solutions to the given conditions. If no solutions exist, print 0.

Examples

input

9 5

output

4

input

3 3

output

2

input

5 2

output

0

Note

In the first sample, we have the following solutions: (2, 7), (3, 6), (6, 3), (7, 2).

In the second sample, the only solutions are (1, 2) and (2, 1).

题意：

求解满足条件 a+b == s,并且a和s按位异或是 x 的序偶<a,b>的个数。

有 s = a+b = a^b + (a&b) *2 的等式。

AC CODE：

#include<stdio.h>
#include<cstring>
#include<algorithm>
#define AC main()
typedef __int64 ll;
using namespace std;
const int MYDD = 1103;

int AC {
	ll a, b, c, Answer;
	scanf("%I64d %I64d", &a, &b);
	c = (a - b) / 2;
	if(c < 0 || c * 2 + b != a || (c & b)) {
		Answer = 0;
	} else{
		int v = 0;
		while(b) {
			v=v + (b & 1);
			b>>=1;
		}
		Answer = 1ll<<v;/*把 2 的 t 次方赋值给答案*/
		if(c == 0) Answer -= 2;
	}
	printf("%I64d\n", Answer);
	return 0;
}