hdu 1563 Find your present!

Find your present!

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

Total Submission(s): 2140    Accepted Submission(s): 1394


[align=left]Problem Description[/align]
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.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.
 

 

[align=left]Input[/align]
The input file will consist of several cases.

Each case will be presented by an integer n (1<=n<=200, and n is odd) at first. Following that, n positive integers will be given in a line. These numbers indicate the card numbers of the presents.n = 0 ends the input.
 

 

[align=left]Output[/align]
For each case, output an integer in a line, which is the card number of your present.
 

 

[align=left]Sample Input[/align]

5
1 1 3 2 2
3
1 2 1
0

 

 

[align=left]Sample Output[/align]

3
2

 

#include<iostream>

using namespace std;

typedef struct

{

 int v;

 int num;

}p;

p aa[200];

int main()

{

 int i,n,t,j,k,flag;

 while(cin>>n && n)

 {

  for(i=0;i<n;i++)

   aa[i].num=0;

  k=0;

  for(i=0;i<n;i++)

  {

   cin>>t;

   flag=0;

   for(j=0;j<k;j++)

   {

    if(aa[j].v==t)

    {

     flag=1;

     aa[j].num++;

     break;

    }

   }

   if(!flag)  aa[k++].v=t;

  }

  for(i=0;i<k;i++)

  {

   if(aa[i].num==0) break;

  }

  cout<<aa[i].v<<endl;

 }

 

}