Alice bought a lot of pairs of socks yesterday. But when she went home, she found that she has lost one of them. Each sock has a name which contains exactly 7 charaters.
Alice wants to know which sock she has lost. Maybe you can help her.
Input
There are multiple cases. The first line containing an integer n (1 <= n <= 1000000) indicates that Alice bought n pairs of socks. For the following 2*n-1 lines, each line is a string with 7 charaters indicating the name of the socks that Alice took back.
Output
The name of the lost sock.
Sample Input
2
aabcdef
bzyxwvu
bzyxwvu
4
aqwertye
asafgha
qwertye
asdfghe
asdfgha
qwertya
qwerty
2
0x0abcd
0ABCDEF
0x0abcd
Sample Output
aabcdef
easafgh
0ABCDEF
异或方法 学习一下
#include<bits/stdc++.h> using namespace std; int main() { int t; char a[10]; char s[8]; while(cin>>t) { int i,j; cin>>a; for(i=1;i<2*t-1;i++) { cin>>s; for(j=0;j<7;j++) a[j]^=s[j]; //用异或运算 如果不同实现两个值的交换 //异或有交换律 a^b^a==a^a^b =b //就是题目中的奇袜子 } printf("%s\n",a); } }