HDoj-2095-distinctive

Problem descriptionin 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. inputthe 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. outputfor each case, output an integer in a line, which is the card number of your present. sample Input

51 1 3 2 231 2 10

Sample output

32

#include<stdio.h>int main(){    int T;    int n,m;    while(~scanf("%d",&T),T){        scanf("%d",&n);                while(--T){            scanf("%d",&m);            n=m^n;                      }        printf("%d\n",n);    }        return 0;} 

HDoj-2095-distinctive