hdu 2095 find your present (2)

柔情只为你懂 2022-05-31 12:09 77阅读 0赞

# find your present (2) #

**Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)  
Total Submission(s): 26824 Accepted Submission(s): 10510**

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

5 1 1 3 2 2 3 1 2 1 0

Sample Output

3 2

*Hint*

Hint

use scanf to avoid Time Limit Exceeded

Author

8600

Source

[HDU 2007-Spring Programming Contest - Warm Up （1）][HDU 2007-Spring Programming Contest - Warm Up _1]

题目解析：

这个题目的意思就是说要找出基数数量的数，直接排序比较一下即可

代码：

#include <bits/stdc++.h>
    using namespace std;
    const int maxn = 1e6+100;
    int a[maxn];
    int main()
    {
        //freopen("in.txt","r",stdin);
        int n;
        while(~scanf("%d",&n)&&n)
        {
            int ans = 0;
            for(int i=0; i<n; i++)
                scanf("%d",&a[i]);
            sort(a,a+n);
            for(int i=0; i<n; i++)
            {
                if(i!=0&&i!=n-1&&(a[i]==a[i-1]||a[i]==a[i+1]))
                    continue;
                if(i==0&&a[i]==a[i+1])
                    continue;
                if(i==n-1&&a[i]==a[i-1])
                    continue;
                ans = a[i];
    
            }
            printf("%d\n",ans);
        }
        return 0;
    }

[HDU 2007-Spring Programming Contest - Warm Up _1]: http://acm.hdu.edu.cn/search.php?field=problem&key=HDU+2007-Spring+Programming+Contest+-+Warm+Up+%A3%A81%A3%A9&source=1&searchmode=source