方法一：
#include<stdio.h>
#include<iostream>#include<algorithm>
using namespace std;
int main()
{
int n;
int length;
int ans[70];
char c[70];
unsigned long long res;
scanf("%d",&n);
while(n--)
{
scanf("%s",c);
length = strlen(c);
for(int i = length - 1; i >=0 ;i--)
{
if(c[i] == '1')
res += (unsigned long long)((unsigned long long)1 <<(unsigned long long)(length - i- 1));//a<<n表示a左移n位(二进制)等价于a乘以2的n次方
}
if(res == 0)
{
printf("0\n");
}
int j = 0;
while(res != 0)
{
ans[j] = res % 3;
res /= 3;
j++;
}
for(int i = j - 1; i >= 0; i--)
{
printf("%d",ans[i]);
}
printf("\n");
}
return 0;
}
方法二：
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
using namespace std;
int n,ans[100],num[100];
int ten[100];
char s[100];
int get2to10(int n){
memset(num,0,sizeof(num));
int cur=0,idx=0;
num[99]=1;
for(int i=0;i<n;i++){
for(int j=99;j>=0;j--){
int temp=(num[j]<<1)+cur;
num[j]=temp%10;
cur=temp/10;
}
}
while(!num[idx])idx++;
for(int i=idx,j=0;i<=99;i++,j++)num[j]=num[i];
for(int i=99-idx+1;i<=99;i++)num[i]=0;
return 99-idx+1;
}
int add(int l){
int idx=0;
for(int i=0,j=l-1;i<l/2;i++,j--)swap(num[i],num[j]);
for(int i=0,carry=0;i<99;i++){
ten[i]=ten[i]+num[i]+carry;
carry=ten[i]/10;
ten[i]%=10;
}
for(int i=99;i>=0;i--)if(ten[i]){idx=i;break;}
return idx+1;
}
int div(int& l){
int ret=0,cnt=0,idx=0;
for(int i=0;i<l;i++){
ret=ret*10+ten[i];
ten[cnt++]=ret/3;
ret%=3;
}
for(int i=0;i<l;i++)if(ten[i]){idx=i;break;}
for(int i=idx,j=0;i<l;i++,j++)ten[j]=ten[i];
l-=idx;
return ret;
}
int main ()
{
cin>>n;
while(n--){
memset(ten,0,sizeof(ten));
memset(ans,0,sizeof(ten));
cin>>s;
int len=strlen(s);
int l1=0,l2=0,cnt=0;
for(int i=len-1;i>=0;i--){
if(s[i]=='0')continue;
l1=get2to10(len-i-1);
l2=add(l1);
}
for(int i=0,j=l2-1;i<l2/2;i++,j--)swap(ten[i],ten[j]);
if(ten[0]==0){
cout<<0<<endl;
continue;
}
while(ten[0]){
ans[cnt++]=div(l2);
}
for(int i=cnt-1;i>=0;i--)cout<<ans[i];
cout<<endl;
}
}