NYOJ_1277_Decimal integer conversion

/*
Decimal integer conversion
时间限制：1000 ms  |  内存限制：65535 KB
难度：2

描述
    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

这题是这次比赛最可惜的一道了，程序比赛时候敲出来了，但自己测的时候有这种测试数据。

输入

1010

202

输出

2  11

当时以为错了，就没敢提交。回来，同样的思路敲了一遍A了。唉！！！！！！！

*/

#include <stdio.h>
#include <string.h>
#include <math.h>
char s1[80];
char s2[80];
int a[80*2];
int b[80*4];
int main()
{
	int T;
	scanf("%d",&T);
	while(T--)
	{
		int i,j,k,num = 1,con = 1;
		int t;
		scanf("%s",s1);
		scanf("%s",s2);
		int len1 = strlen(s1);
		int len2 = strlen(s2);
		for(i=0;i<len1;i++)
		{
			if(s1[i] == '1')
			{
				t = 0;
				s1[i] = '0';		
				for(k=len1-1,j=0;j<len1;j++,k--)
				{
					t += (s1[j]-'0')*pow(2,k);
				}
				a[con++] = t;
				s1[i] = '1';
			}
			else if(s1[i] == '0')
			{
				s1[i] = '1';
				t = 0;
				for(k=len1-1,j=0;j<len1;j++,k--)
				{
					t += (s1[j]-'0')*pow(2,k);
				}
				a[con++] = t;
				s1[i] = '0';
			}
		}
		for(i=0;i<len2;i++)
		{
			if(s2[i] == '1')
			{
				t = 0;
				s2[i] = '0';
				for(j=0,k=len2-1;j<len2;j++,k--)
				{
					t += (s2[j]-'0')*pow(3,k);
				}
				b[num++] = t;
				t = 0;
				s2[i] = '2';
				for(j=0,k=len2-1;j<len2;j++,k--)
				{
					t += (s2[j]-'0')*pow(3,k);
				}
				b[num++] = t;
				s2[i] = '1';
			}
			else if(s2[i] == '0')
			{
				t = 0;
				s2[i] = '1';
				for(j=0,k=len2-1;j<len2;j++,k--)
				{
					t += (s2[j]-'0')*pow(3,k);
				}
				b[num++] = t;
				t = 0;
				s2[i] = '2';
				for(j=0,k=len2-1;j<len2;j++,k--)
				{
					t += (s2[j]-'0')*pow(3,k);
				}
				b[num++] = t;
				s2[i] = '0';
			}
			else if(s2[i] == '2')
			{
				t = 0;
				s2[i] = '0';
				for(j=0,k=len2-1;j<len2;j++,k--)
				{
					t += (s2[j]-'0')*pow(3,k);
				}
				b[num++] = t;
				t = 0;
				s2[i] = '1';
				for(j=0,k=len2-1;j<len2;j++,k--)
				{
					t += (s2[j]-'0')*pow(3,k);
				}
				b[num++] = t;
				t = 0;
				s2[i] = '2';
			}
		}
		for(i=1;i<con;i++)
		{
			for(j=1;j<num;j++)
			{
				if(a[i]==b[j])
				{
					printf("%d\n",a[i]);
				}
			}
		}
	}
	return 0;
}