int main()
{
	int arr[] = { 1, 3, 8, 1, 3, 8, 4, 6 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	int num = 0;
	int pos = 0;
	int i = 0;
	int x = 0;
	int y = 0;
	for (i = 0; i < sz; i++)
	{
		num ^= arr[i];
	}
	/*printf("num=%d \n");*/
	//找num的二進位制中為1的一個位pos
	for (i = 0; i < 32; i++)
	{
		if (1 == ((num >> i) & 1))
		{
			pos = i;
			break;
		}
	}
	for (i = 0; i < sz; i++)
	{
		if (((arr[i] >> pos) & 1) == 1)
		{
			x ^= arr[i];
		}
		else
		{
			y ^= arr[i];
		}
	}
	printf("x=%d y=%d", x, y);
	system("pause");
	return 0;
}