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,
T.
T
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
|
|
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!
|
Solution: #include <stdio.h>
int val;
int uniqueEle(int a[] ,int b[]);
int main()
{ FILE * fp1, *fp2;
int t,a1,a2,c,n=1,i,j;
int table1[5][5] , table2[5][5];
fp1=fopen("input.txt","r");
fp2=fopen("output.txt","w");
fscanf(fp1,"%d",&t);
while(n<=t){
fscanf(fp1,"%d",&a1);
for(i=0;i<4;i++){
for(j=0;j<4;j++)
fscanf(fp1,"%d",&table1[i][j]);
}
fscanf(fp1,"%d",&a2);
for(i=0;i<4;i++){
for(j=0;j<4;j++)
fscanf(fp1,"%d",&table2[i][j]);
}
c=uniqueEle(table1[a1-1],table2[a2-1]);
if(c==1)
fprintf(fp2,"Case #%d: %d\n",n,val);
else if(c==0)
fprintf(fp2,"Case #%d: Volunteer cheated!\n",n);
else
fprintf(fp2,"Case #%d: Bad magician!\n",n);
n++;
}
return 0;
}
int uniqueEle(int a[],int b[]){
int i,j,c=0;
for(i=0;i<4;i++){
for(j=0;j<4;j++)
if(a[i]==b[j]){
val=a[i];
c++;
}
}
return c;
}
