Hust oj 1341 Who will be punished（字符串异或）

最新推荐文章于 2020-01-03 18:47:09 发布

19951211丶

最新推荐文章于 2020-01-03 18:47:09 发布

阅读量517

点赞数

分类专栏：数论文章标签： Hustoj1341

本文链接：https://blog.csdn.net/Sara_YF/article/details/52050872

版权

数论专栏收录该内容

11 篇文章 0 订阅

订阅专栏

Who will be punished

Time Limit: 1000 MS

Memory Limit: 32767 K

Total Submit: 563(95 users)

Total Accepted: 210(82 users)

Rating:

Special Judge: No

Description

This time,suddenly,teacher Li wants to find out who have missed interesting DP lesson to have fun.The students who are found out will get strictly punishment.Because,teacher Li wants all the students master the DP algorithm.

However,Li doesn't want to waste the class time to call over the names of students.So he let the students to write down their names in one paper.To his satisfaction,this time, only one student has not come.

He can get the name who has not come to class,but,it is troublesome,and,teacher always have many things to think about,so,teacher Li wants you, who is in the ACM team, to pick out the name.

Input

There are several test cases.The first line of each case have one positive integer N.N is the number of the students,and N will not greater than 500,000.

Then,following N lines,each line contains one name of students who have attended class.The N-1 lines are presented after N lines.These N-1 lines indicates the names of students who have come to class this time,one name in one line.

The length of student's name is not greater than 30.

Process to the end of file.

Output

For each test case, first print a line saying "Scenario #k", where k is the number of the test case.Then output the name of the student who have not come to class.One case per line.Print a blank line after each test case, even after the last one.

Sample Input

Sample Output

Scenario #1

异或性质，A^B^A=B，对字符串同样适用

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
using namespace std;

int n;
char a[50];
char start[50];

int main()
{
    int cnt = 0;
    while(~scanf("%d",&n))
    {
        getchar();
        scanf("%s",&start);
        for(int i=0;i<2*n-2;i++)
        {
            scanf("%s",&a);
            int len = strlen(a);
            for(int j=0;j<len;j++)
            {
                start[j] ^= a[j];
            }
        }
        printf("Scenario #%d\n",++cnt);
        printf("%s\n\n",start);
    }
}