#include<stdio.h>
Find_Num(int arr[], int sz , int * num1, int *num2)
{
          * num1 = 0;
          * num2 = 0;
           int i = 0;
           int ret = 0;
           int pos = 0;
           int temp = 0;
           for (i = 0; i < sz ; i++)
          {
                   ret ^= arr[i];//0與陣列中元素依次亦或，最終得到兩個不唯一的數的亦或值，其餘的數在亦或過程中消掉了。
          }
          temp = ret;
           while (ret)
          {
                    if (ret % 2 == 1)
                   {
                              break;
                   }
                   pos++; //第pos位為1
                   ret /= 2;
          }
           for (i = 0; i < sz ; i++)
          {
                    if ((arr [i] >> pos) & 1)//取出第pos位的值
                   {
                             * num1^= arr [i];
                   }
          }
          * num2 = temp^*num1 ;
}
int main()
{
           int num1 = 0;
           int num2 = 0;
           int arr[] = { 1, 2, 3, 4, 5, 1, 2, 3, 4, 8 };
           int sz = sizeof (arr) / sizeof(arr[0]);
          Find_Num(arr, sz, &num1, &num2);
          printf( "%d,%d\n", num1, num2);
          system( "pause");
           return 0;
}