# Decimal integer conversion

XiaoMing likes mathematics, and he is just learning how to convert numbers between differentbases , but he keeps making errors since he is only 6 years old. Whenever XiaoMing converts anumber 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 ordeletes digits, so he might write down a number with a leading digit of " 0" if this is the digit shegets wrong.Given XiaoMing 's output when converting a number N into base 2 and base 3, please determinethe 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

根据stl容器set的唯一性这一特性做这个题。

在nyoj上排19，美滋滋，继续努力。

#include<stdio.h>
#include<string.h>
#include<string>
#include<iostream>
#include<set>
using namespace std;
struct node
{
long long ans;
node(long long A)
{
ans=A;
}
};
bool operator<(node a,node b)
{
if(a.ans<b.ans)
return true;
else
return false;
}
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
set<node>s;
long long ans1=0,j=1,ans2=0;
string test1,test2;
cin>>test1;
cin>>test2;
if(test1[0]=='0')
{
for(int i=test1.size()-1;i>0;i--)
{
ans1+=(test1[i]-'0')*j;
j*=2;
}
}
else
{
for(int i=test1.size()-1;i>=0;i--)
{
ans1+=(test1[i]-'0')*j;
j*=2;
}
j=1;
for(int i=test1.size()-1;i>=0;i--)
{
if(test1[i]=='0')
{
s.insert(node(ans1+j));
}
else
{
s.insert(node(ans1-j));
}
j*=2;
}
j=1;
for(int i=test2.size()-1;i>=0;i--)
{
ans2+=(test2[i]-'0')*j;
j*=3;
}
j=1;
for(int i=test2.size()-1;i>=0;i--)
{
unsigned int tmp=s.size();
if(test2[i]=='0')
{
s.insert(node(ans2+j));
if(s.size()==tmp)
{
cout<<ans2+j<<endl;
break;
}
tmp++;
s.insert(node(ans2+2*j));
if(s.size()==tmp)
{
cout<<ans2+2*j<<endl;
break;
}
}
if(test2[i]=='1')
{
s.insert(node(ans2-j));
if(s.size()==tmp)
{
cout<<ans2-j<<endl;
break;
}
tmp++;
s.insert(node(ans2+j));
if(s.size()==tmp)
{
cout<<ans2+j<<endl;
break;
}
}
if(test2[i]=='2')
{
s.insert(node(ans2-j));
if(s.size()==tmp)
{
cout<<ans2-j<<endl;
break;
}
tmp++;
s.insert(node(ans2-2*j));
if(s.size()==tmp)
{
cout<<ans2-2*j<<endl;
break;
}
}
j*=3;
}
}
}
return 0;
}


• 广告
• 抄袭
• 版权
• 政治
• 色情
• 无意义
• 其他

120