pku 3589

ebeworld — Tue, 14 Oct 2008 05:27:42 +0000

Number-guessing Game

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 1499		Accepted: 1106

Description

Larry likes playing the number-guessing game.

Two players are needed in a game. Suppose they are X and Y, and X presents a number for Y to guess. Firstly, X chooses a number with four different digits, keeping it in mind, and tells Y to start guessing. Every time Y has guessed, X should give out *A*B to show Y how close to the number his answer is. Here the symbol * stands for a number, and the number before A is the number of digits in Y’s answer with both correct value and position. The number before B is the number of digits in Y’s answer with correct value but incorrect position.

For example, if X chooses the number 5204, and Y guesses 4902, then X should give out 1A2B, in which 1A corresponds for digit 0 with both correct value and position and 2B corresponds for digit 2 and 4 with correct value but incorrect position. Then Y will go on guessing according to 1A2B that X presents him until he gets the totally correct number 5204 (when X shows him 4A0B).

Now you are given two numbers, and what you need to do is just testing how close they are.

Input

The first line of the input is an integer T which indicates the number of test cases. For each test case, input two numbers. Each number contains four different digits.

Output

For each test case, output *A*B stands for how close the two numbers are.
　

Sample Input

2
5204 4902
0123 3210

Sample Output

1A2B
0A4B

Source

South Central China 2008 hosted by NUDT

#include

using namespace std;

int main(){

char a[5],b[5];

int n,i,j;

cin>>n;

while(n) {

cin>>a>>b;

int x=0,y=0;

for( i = 0; i< 4; i++)

for( j = 0 ; j < 4; j++) {

if(a[i]==b[i])

x++;

if(i!=j)

if(a[i]==b[j]) {

y++;

break;

}

cout<

n–;

}

return 0;

}

Ebeworld's Weblog » Algorithms

pku 3589