hdu 2095 find your present (2)(位异或)
2013-07-30 18:21
525 查看
题目链接:hdu2095
位异或的运算法则:
1、a^b = b^a
2、(a^b)^c = a^(b^c)
3、a^b^a = b。
对于一个任意一个数n:
1、0^n = n。
2、n^n = 0。
不断的位异或运算,剩下的就是出现奇数次的那个数
位异或的运算法则:
1、a^b = b^a
2、(a^b)^c = a^(b^c)
3、a^b^a = b。
对于一个任意一个数n:
1、0^n = n。
2、n^n = 0。
不断的位异或运算,剩下的就是出现奇数次的那个数
#include<stdio.h> int main() { int n; while(scanf("%d",&n) && n) { int ans = 0,m; while(n--) { scanf("%d",&m); ans ^= m; } printf("%d\n",ans); } return 0; }
相关文章推荐
- hdu - 2095 - find your present (2)(异或)
- HDU 2095 find your present(异或)
- 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 parents(2)
- hdu 2095 find your present (2)
- hdu 1563简单异或Find your present!
- 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) (set STL)