Challenge From XOR

Mr. AngelClover just learnt XOR on his Computer Class. XOR is a bit arithmetic operator that returns one value if one, but not both, of its operands is one. It is also called Exclusive-OR. Now Mr. AngelClover wonders if it is possible to pick up some numbers from a certain number set, such that the result of Exclusive-OR is zero. And he wants the numbers to be as few as possible but there should be at least one. Can you help him?

 

Input     (Please use standard input, and don’t read or write files.)
The first line is a positive integer N, which means the number of the number set. And there are N lines followed, in each there is a single positive integer, which is the number in the set. Each number in the set is an integer between 0 and 216-1 inclusive. 0< N <=30
Output   (Please use standard output, and don’t read or write files.)
There is only one line in the output, which is the smallest number as described above. If Mr. AngelClover can NOT find such numbers after XOR is zero, output -1.
Sample Input	Sample Output
4 1 2 3 4	3
Hint
Numbers which are picked up are 1, 2, 3. For 40% input data cases, N <= 15.

 

先将输入的数字按从大到小排序，然后逐步地缩小范围，例如本题：

排序后：4     3     2     1，二进制序列为100  11   10   1，对这四个数求XOR，不为0，于是将拥有最高位的数去掉，即去掉4。然后，存在的数有3  2     1，其二进制为11 10   1，求XOR为0，于是终止程序，得到结果。

#include<stdio.h> #include<stdlib.h> bool bigthan(int a,int b) { while(b!=1) { a=a/2; b=b/2; } if(a!=1) return true; return false; } int main() { int n,i,j,temp; scanf("%d",&n); int *num; num=(int *)malloc(sizeof(int)*n); for(i=0;i<n;i++) { getchar(); scanf("%d",num+i); } for(i=1;i<n;i++) for(j=i;(j>0)&&num[j]>num[j-1];j--) { temp=num[j]; num[j]=num[j-1]; num[j-1]=temp; } int count=0,size=n,result; int index=0; while(size>0) { result=num[index]; for(int h=index+1;h<n;h++) result=result^num[h]; if(result==0 && (count>size||count==0)) count=size; result=num[index]; for(temp=index+1;temp<n;temp++) { if(bigthan(num[temp-1],num[temp])) break; result=result^num[temp]; } if(result==0 && (count>(temp-index)||count==0)) count=temp-index; index=temp; size=n-index; } printf("%d/n",count); return 0; }

其实，以上的说法是不对的。

并不是去掉了大的数就可以使小的数可以XOR为0。例如：7     5     2     1，这个时候反而要去掉1。

于是，重写了一下代码，编程最痛苦的事情就在于此啊。

首先，研究一下把即给的数据XOR一下会是什么结果：

100 XOR 10 XOR 11 XOR 1 = 100

发现把即给的所有数XOR的结果是那个要去掉的数100。

但是，上述的说法还是不对，要想得更远一些。其实，把所有数XOR的结果是要去掉的所有数的XOR的结果。

编写一个函数，用于控制去掉的顺序是按从1个开始到n个。在去掉j（0<j<n+1）个时，必须穷举所有情况，比如去掉1个时就是把所有的数都依次去掉一次，因此有j！次运算。总的运算次数就是j！（0<j<n+1）的和。

当发现某次运算中，去掉的数的XOR等于题给所有数的XOR时，程序得到结果。

#include<stdio.h> #include<stdlib.h> void change(bool* record,int n,int& x) { int i,j,count=0; for(i=n-1;i>-1;i--) { if(record[i]==false) { if(i==(n-1-count)) { count++; record[i]=true; }else{ count++; record[i]=true; for(j=i+1;j<i+1+count;j++) record[j]=false; return; } if(count>x) { x++; for(j=0;j<=x&&x<n;j++) record[j]=false; return; } } } } int main() { int n,i,j,temp,result; scanf("%d",&n); int *num; num=(int *)malloc(sizeof(int)*n); for(i=0;i<n;i++) { getchar(); scanf("%d",num+i); } result=num[0]; for(i=1;i<n;i++) result=result^num[i]; if(result==0) { printf("%d/n",n); return 0; } bool* record; record=(bool*)malloc(sizeof(bool)*n); for(i=1;i<n;i++) record[i]=true; record[0]=false; i=0; do{ temp=0; for(j=0;j<n;j++) { if(!record[j]&&temp==0) { temp=num[j]; continue; } if(!record[j]) temp^=num[j]; } if(temp==result) break; change(record,n,i); }while(i<n); printf("%d/n",n-i-1); return 0; }