hdu(1563)Find your present!
2013-08-16 13:55
281 查看
整数的异或是先把它们化成二进制,再按位异或。
比如3^5, 3=011,5=101,两数按位异或后为110,即6。
几个数异或满足交换律。2^3^2=2^2^3=0^3=3.
两个相同的数异或为0,普通数都出现了偶数次,所以它
们异或后都是0,而0与那个特别数异或后还是那个特殊数。
#include"stdio.h"
int main()
{
int m,n,s;
while(scanf("%d",&n),n)
{
s=0;
while(n--)
{
scanf("%d",&m);
s=s^m;
}
printf("%d\n",s);
}
return 0;
}
比如3^5, 3=011,5=101,两数按位异或后为110,即6。
几个数异或满足交换律。2^3^2=2^2^3=0^3=3.
两个相同的数异或为0,普通数都出现了偶数次,所以它
们异或后都是0,而0与那个特别数异或后还是那个特殊数。
#include"stdio.h"
int main()
{
int m,n,s;
while(scanf("%d",&n),n)
{
s=0;
while(n--)
{
scanf("%d",&m);
s=s^m;
}
printf("%d\n",s);
}
return 0;
}
相关文章推荐
- HDU 1563 Find your present!
- hdu-2095-find your present (2)//1563-find your present
- hdu 1563简单异或Find your present!
- hdu 2095 find your present (2)
- HDU 2095--Find your present (2) 【set】
- hdu - 2095 - find your present (2)(异或)
- HDU 2095 find your present (2)
- hdu_2095 find your present (2)
- hdu find your present (2)
- hdoj 1563 Find your present!&&2095 Find your present(2) 异或运算
- hdu 2095 find your present (2)
- HDU-2095 find your present (2)
- hdu 2095 find your present (2)(位异或)
- hdu 2095 find your present (2)
- hdu 2095 find your present (2)
- HDU 2095 find your present (2)
- hdu 2095 find your present (2)
- HDU 2095 find your present (2)
- HDU 2095 find your present (2) 异或
- hdu 2095 find your present (2) 位运算