hdu - 2095 - find your present (2)(异或)
2014-11-21 19:42
459 查看
题意:n(1<=n<1000000) 个数字,其中只有一个数字出现奇数次,求这个数。
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2095
——>>
#include <cstdio>
int main()
{
int n, a;
while (scanf("%d", &n) == 1 && n)
{
int ret = 0;
while (n--)
{
scanf("%d", &a);
ret ^= a;
}
printf("%d\n", ret);
}
return 0;
}
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2095
——>>
#include <cstdio>
int main()
{
int n, a;
while (scanf("%d", &n) == 1 && n)
{
int ret = 0;
while (n--)
{
scanf("%d", &a);
ret ^= a;
}
printf("%d\n", ret);
}
return 0;
}
相关文章推荐
- 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(异或)
- 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)
- HDU 2095 find your present (2)
- hdu 1563简单异或Find your present!
- HDU 2095 find your present (2)
- HDU 2095 find your present
- HDU 2095 find your present (2)