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^b=x 给出s,x求有多少序偶满足这两个式子;
思路:a+b=(a^b)+[(a&b)<<1]; 根据x,s可以知道(a^b)和(a&b) 由这两个式子可以确定a,b,枚举每一位 若第i位:(ai^bi)==1 那么(ai&bi)一定等于0,这时候有两种情况:ai=0,bi=1或ai=1,bi=0,(分步计数此位可产生2种情况),如果(ai&bi)等于1,就说明方程不成立了;若(ai^bi)==0: 这时ai==bi,因为(ai&bi)是已经确定的,那么这时候这一位就只产生1种情况 (当S==X时一定会产生解(0,S),(S,0),题目要求a,b是正数,所以这两种情况不满足题意,减去即可);
失误:刚开始看题弄错了,理解能力不行,最后看题解也是纠结为什么要减2,还是题目没理解透彻;
AC代码:
#include<cstdio>
typedef long long LL;
int main()
{
LL S,X;
while(~scanf("%lld %lld",&S,&X))
{
LL N=S-X,ans=0;
if(N>=0&&N%2==0)
{
ans=1; N>>=1; LL i=0;
for(i=0;i<60;++i)
{
if(((N>>i)&1)&&((X>>i)&1)) {
ans=0; break;
}
if(((X>>i)&1)) ans<<=1;
}
}
if(!N) ans-=2;
printf("%lld\n",ans);
}
return 0;
}