Google Code Jam Qualification Round 2014 Problem A. Magic Trick 题解

Problem

Recently you went to a magic show. You were very impressed by one of the tricks, so you decided to try to figure out the secret behind it!

The magician starts by arranging 16 cards in a square grid: 4 rows of cards, with 4 cards in each row. Each card has a different number from 1 to 16 written on the side that is showing. Next, the magician asks a volunteer to choose a card, and to tell him which row that card is in.

Finally, the magician arranges the 16 cards in a square grid again, possibly in a different order. Once again, he asks the volunteer which row her card is in. With only the answers to these two questions, the magician then correctly determines which card the volunteer chose. Amazing, right?

You decide to write a program to help you understand the magician’s technique. The program will be given the two arrangements of the cards, and the volunteer’s answers to the two questions: the row number of the selected card in the first arrangement, and the row number of the selected card in the second arrangement. The rows are numbered 1 to 4 from top to bottom.

Your program should determine which card the volunteer chose; or if there is more than one card the volunteer might have chosen (the magician did a bad job); or if there’s no card consistent with the volunteer’s answers (the volunteer cheated).

Solving this problem

Usually, Google Code Jam problems have 1 Small input and 1 Large input. This problem has only 1 Small input. Once you have solved the Small input, you have finished solving this problem.

Input

The first line of the input gives the number of test cases, TT test cases follow. Each test case starts with a line containing an integer: the answer to the first question. The next 4 lines represent the first arrangement of the cards: each contains 4 integers, separated by a single space. The next line contains the answer to the second question, and the following four lines contain the second arrangement in the same format.

Output

For each test case, output one line containing “Case #x: y”, where x is the test case number (starting from 1).

If there is a single card the volunteer could have chosen, y should be the number on the card. If there are multiple cards the volunteer could have chosen, y should be “Bad magician!”, without the quotes. If there are no cards consistent with the volunteer’s answers, y should be “Volunteer cheated!”, without the quotes. The text needs to be exactly right, so consider copying/pasting it from here.

Limits

1 ≤ T ≤ 100.
1 ≤ both answers ≤ 4.
Each number from 1 to 16 will appear exactly once in each arrangement.

Sample

Input Output
3
2
1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 16
3
1 2 5 4
3 11 6 15
9 10 7 12
13 14 8 16
2
1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 16
2
1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 16
2
1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 16
3
1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 16
Case #1: 7
Case #2: Bad magician!
Case #3: Volunteer cheated!
分析:

判断两行中有多少相同的元素,如果只有一个相同,则输出这个相同的数,如何没有相同的数,则志愿者欺骗了,如果相同的数不止一个,则魔术师不合格。

参考代码:

[code lang=”cpp”]
#include <iostream>

int main()
{
int T;
std::cin >> T;

int ans1, ans2;
int num1[4][4], num2[4][4];
int number;
int count;

for(int round = 1; round <= T; ++round)
{
std::cin >> ans1;
for(int i = 0; i < 4; ++i)
for(int j = 0; j < 4; ++j)
{
std::cin >> num1[i][j];
}

std::cin >> ans2;
for(int i = 0; i < 4; ++i)
for(int j = 0; j < 4; ++j)
{
std::cin >> num2[i][j];
}

count = 0;
for(int i = 0; i < 4; ++i)
for(int j = 0; j < 4; ++j)
{
if(num1[ans1 – 1][i] == num2[ans2 – 1][j])
{
count++;
number = num1[ans1 – 1][i];
}
}

if(count == 0)
{
std::cout << "Case #" << round << ": Volunteer cheated!" << std::endl;
}
else if(count == 1)
{
std::cout << "Case #" << round << ": " << number << std::endl;
}
else
{
std::cout << "Case #" << round << ": Bad magician!" << std::endl;
}
}

return 0;
}

[/code]

感谢阅读!

One thought on “Google Code Jam Qualification Round 2014 Problem A. Magic Trick 题解”

Leave a Reply

Your email address will not be published. Required fields are marked *