Decimal integer conversion

问题 : Decimal integer conversion

时间限制: 1 Sec   内存限制: 128 MB

题目描述

XiaoMing likes mathematics, and he is just learning how to convert numbers between different

bases , but he keeps making errors since he is only 6 years old. Whenever XiaoMing converts a

number to a new base and writes down the result, he always writes one of the digits wrong.

For example , if he converts the number 14 into binary (i.e., base 2), the correct result should be

"1110", but he might instead write down "0110" or "1111". XiaoMing never accidentally adds or

deletes digits, so he might write down a number with a leading digit of " 0" if this is the digit she

gets wrong.

Given XiaoMing 's output when converting a number N into base 2 and base 3, please determine

the correct original value of N (in base 10). (N<=10^10)

You can assume N is at most 1 billion, and that there is a unique solution for N.

输入

The first line of the input contains one integers T, which is the nember of test cases (1<=T<=8)

Each test case specifies:

* Line 1: The base-2 representation of N , with one digit written incorrectly.

* Line 2: The base-3 representation of N , with one digit written incorrectly.

输出

For each test case generate a single line containing a single integer ,  the correct value of N

样例输入

1
1010
212

样例输出

14

解题思路

水题，直接暴力，把所有的情况都跑一遍就可以了。

 1 #include <stdio.h>
 2 #include <string.h>
 3 int main()
 4 {
 5     int t, A, B, lena, lenb, temp;
 6     char a[1010], b[1010];
 7     scanf("%d%*c", &t);
 8     while (t--)
 9     {
10         temp = 0;
11         scanf("%s%s", a, b);
12         lena = strlen(a);
13         lenb = strlen(b);
14         for (int i = 0; i < lena; i++)
15         {
16             A = 0;
17             a[i] = (a[i] - '0' + 1) % 2 + '0';
18             for (int j = 0; j < lena; j++)
19                 A = A * 2 + a[j] - '0';
20             a[i] = (a[i] - '0' + 1) % 2 + '0';
21             for (int j = 0; j < lenb; j++)
22             {
23                 B = 0;
24                 b[j] = (b[j] - '0' + 1) % 3 + '0';
25                 for (int k = 0; k < lenb; k++)
26                     B = B * 3 + b[k] - '0';
27                 if (A == B)
28                 {
29                     temp = 1;
30                     break;
31                 }
32                 B = 0;
33                 b[j] = (b[j] - '0' + 2) % 3 + '0';
34                 b[j] = (b[j] - '0' + 2) % 3 + '0';
35                 for (int k = 0; k < lenb; k++)
36                     B = B * 3 + b[k] - '0';
37                 if (A == B)
38                 {
39                     temp = 1;
40                     break;
41                 }
42                 b[j] = (b[j] - '0' + 1) % 3 + '0';
43             }
44             if (temp)
45                 break;
46         }
47         printf("%d\n", A);
48     }
49     return 0;
50 }

转载于:https://www.cnblogs.com/lzyws739307453/p/9030403.html