foj1001 使用了位图

Problem 1001 Duplicate Pair

Accept:3561    Submit:16898
Time Limit: 1000mSec    MemoryLimit : 65536 KB

ProblemDescription

An array of length n, with address from 1 to n inclusive,contains entries from the set {1,2,...,n-1} and there's exactly twoelements with the same value. Your task is to find out thevalue.

Input

Input contains several cases.
Each case includes a number n(1<n<=10^6), which is followed by nintegers.
The input is ended up with the end of file.

Output

Your must output the value for each case, one perline.

SampleInput

2 1 1 4 1 2 3 2

SampleOutput

1 2

位图数据结构的妙用，对处理大量数据问题效率更高~

Language: Visual C++
Length: 373 Bytes.
Result: Accepted

#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;
#define  N 1000005
char a[N];
int main()
{
      intn,i,j;
      while(scanf("%d",&n)!=EOF)
      {
            memset(a,0,n);
            for(i=0;i<n;i++)
            {
                    scanf("%d",&j);
            if(a[j]==0)
                        a[j]=1;
            else
              printf("%d\n",j);
            }
      }
            return0;
}