ACM——find your present （2）

最新推荐文章于 2020-12-07 21:25:08 发布

Masked__Dance

最新推荐文章于 2020-12-07 21:25:08 发布

阅读量551

点赞数

文章标签： ACM 异或

本文链接：https://blog.csdn.net/Masked__Dance/article/details/38983955

版权

ACM 同时被 2 个专栏收录

22 篇文章 1 订阅

订阅专栏

异或

1 篇文章 0 订阅

订阅专栏

find your present (2)

Time Limit: 1000/2000 MS (Java/Others) Memory Limit: 32768/1024 K (Java/Others)

Total Submission(s): 5339 Accepted Submission(s): 1569

Problem Description

In the new year party, everybody will get a "special present".Now it's your turn to get your special present, a lot of presents now putting on the desk, and only one of them will be yours.Each present has a card number on it, and your present's card number will be the one that different from all the others, and you can assume that only one number appear odd times.For example, there are 5 present, and their card numbers are 1, 2, 3, 2, 1.so your present will be the one with the card number of 3, because 3 is the number that different from all the others.

Input

The input file will consist of several cases.
Each case will be presented by an integer n (1<=n<1000000, and n is odd) at first. Following that, n positive integers will be given in a line, all integers will smaller than 2^31. These numbers indicate the card numbers of the presents.n = 0 ends the input.

Output

For each case, output an integer in a line, which is the card number of your present.

Sample Input

Sample Output

use scanf to avoid Time Limit Exceeded

Author

8600

Source

HDU 2007-Spring Programming Contest - Warm Up （1）

Recommend

8600
题意：
找到你的礼物
输入礼物个数
输入礼物的号码
找出是奇数个的输出
解决：
异或
整数的异或，先换成二进制然后进行按位异或。
异或满足交换律
相同异或为0，不同异或为他本身。
注意初始化一个数为0。
进行异或，得到的结果为要求得的数。
正确代码：
#include <stdio.h>
int main()
{
    int n;
    while(scanf("%d",&n),n)
    {
        int b,a=0;//注意a的初始化
        for(int i=0;i<n;i++)
        {
            scanf("%d",&b);
            a^=b;//异或，程序的主体部分
        }
        printf("%d\n",a);
    }
    return 0;
}
/****超内存，错误算法*****/
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
#define N 1000005
int a[N],c[N];
int main()
{
    int n;
    while(scanf("%d",&n),n)
    {
        memset(a,0,sizeof(a));
        for(int i=0;i<n;i++)
        {
            int b;
            scanf("%d",&b);
            a[b]++;
            c[i]=b;
        }
        for(int i=0;i<n;i++)
        {
            if(a[c[i]]%2==1)
            {
                printf("%d\n",c[i]);
                break;
            }
        }
    }
    return 0;
}