FZOJ2102:Solve equation

You are given two positive integers A and B in Base C. For the equation:

A=k*B+d

We know there always existing many non-negative pairs (k, d) that satisfy the equation above. Now in this problem, we want to maximize k.

For example, A="123" and B="100", C=10. So both A and B are in Base 10. Then we have:

(1) A=0*B+123

(2) A=1*B+23

As we want to maximize k, we finally get one solution: (1, 23)

The range of C is between 2 and 16, and we use 'a', 'b', 'c', 'd', 'e', 'f' to represent 10, 11, 12, 13, 14, 15, respectively.

Input

The first line of the input contains an integer T (T≤10), indicating the number of test cases.

Then T cases, for any case, only 3 positive integers A, B and C (2≤C≤16) in a single line. You can assume that in Base 10, both A and B is less than 2^31.

Output

For each test case, output the solution “(k,d)” to the equation in Base 10.

Sample Input

3

2bc 33f 16

123 100 10

1 1 2

Sample Output

(0,700)

(1,23)

 (1,0)

 

 

题意：每个样例包含A,B,C，而A,B,又是C进制，根据A=k*B+d，求出最大的k，然后求出d

 

思路：水题，就考进制转换而已

 

#include <stdio.h>
#include <string.h>

int t,c,i,j,x,y,k,d;
char a[1005],b[1005];

int pow(int c,int k)
{
	int i,ans = 1;
	for(i = 1;i<=k;i++)
		ans*=c;
	return ans;
}

int change(char *a)//进制转换
{
	int i,len,ans = 0;
	len = strlen(a);
	for(i = 0;i<len;i++)
	{
		if(a[i]>='0' && a[i]<='9')
			ans +=pow(c,len-1-i)*(a[i]-'0');
		else
			ans +=pow(c,len-1-i)*(a[i]-'a'+10);
	}
	return ans;
}

int main()
{

	scanf("%d",&t);
	while(t--)
	{
		scanf("%s%s%d",a,b,&c);
		x = change(a);//转换为十进制
		y = change(b);
		k = x/y;//求k
		d = x-k*y;
		printf("(%d,%d)\n",k,d);
	}

	return 0;
}