PAT Advanced Level 1010

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1010

此题共有19个测试点，其中7号测试点比较关键，10号测试点比较扯淡。

代码版本1：（7号测试点未通过，运行超时）

#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
void judge(char* know,char* unknow,int radix){
    long long num1,num2;
    num1=0;
    for(int i=0;i<strlen(know);i++){
        int t;
        if(know[i]>='a'&&know[i]<='z') t=know[i]-'a'+10;
        else t=know[i]-'0';
        num1=num1*radix+t;
    }
    int imax=0;
    for(int i=0;i<strlen(unknow);i++){
        int t;
        if(unknow[i]>='a'&&unknow[i]<='z') t=unknow[i]-'a'+10;
        else t=unknow[i]-'0';
        if(t>imax) imax=t;
    }
    //printf("%lld\n",num1);
    for(long long i=imax+1;;i++){
        num2=0;
        for(int j=0;j<strlen(unknow);j++){
            int t;
            if(unknow[j]>='a'&&unknow[j]<='z') t=unknow[j]-'a'+10;
            else t=unknow[j]-'0';
            num2=num2*i+t;
        }
        //printf("%lld , %lld\n",num2,i);
        if(num2>num1){
            printf("Impossible\n");
            break;
        }
        if(num2==num1){
            printf("%lld\n",i);
            break;
        }
    }
}
int main()
{
    char n1[15],n2[15];
    int tag,radix;
    scanf("%s%s%d%d",n1,n2,&tag,&radix);
    if(tag==1){
        judge(n1,n2,radix);
    }
    else{
        judge(n2,n1,radix);
    }
    return 0;
}

看了网上思路，采用二分查找改进（初步改进）。

#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
void judge(char* know,char* unknow,int radix){
    long long num1,num2;
    num1=0;
    for(int i=0;i<strlen(know);i++){
        int t;
        if(know[i]>='a'&&know[i]<='z') t=know[i]-'a'+10;
        else t=know[i]-'0';
        num1=num1*radix+t;
    }
    int imax=0;
    for(int i=0;i<strlen(unknow);i++){
        int t;
        if(unknow[i]>='a'&&unknow[i]<='z') t=unknow[i]-'a'+10;
        else t=unknow[i]-'0';
        if(t>imax) imax=t;
    }
    long long low,high;
    low=imax+1;
    high=num1>low?num1:low;
    while(low<=high){
        long long middle=(low+high)/2;
        num2=0;
        for(int j=0;j<strlen(unknow);j++){
            int t;
            if(unknow[j]>='a'&&unknow[j]<='z') t=unknow[j]-'a'+10;
            else t=unknow[j]-'0';
            num2=num2*middle+t;
        }
        if(num2>num1) high=middle-1;
        else if(num2==num1){
            printf("%lld\n",middle);
            return;
        }
        else low=middle+1;
    }
    printf("Impossible\n");
}
int main()
{
    char n1[15],n2[15];
    int tag,radix;
    scanf("%s%s%d%d",n1,n2,&tag,&radix);
    if(tag==1){
        judge(n1,n2,radix);
    }
    else{
        judge(n2,n1,radix);
    }
    return 0;
}

错了一大片。。

再次改进，主要针对37内进制

#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
void judge(char* know,char* unknow,int radix){
    long long num1,num2;
    num1=0;
    for(int i=0;i<strlen(know);i++){
        int t;
        if(know[i]>='a'&&know[i]<='z') t=know[i]-'a'+10;
        else t=know[i]-'0';
        num1=num1*radix+t;
    }
    if(num1==1&&strlen(unknow)==1&&unknow[0]=='1'){
        printf("2\n");
        return;
    }
    int imax=0;
    for(int i=0;i<strlen(unknow);i++){
        int t;
        if(unknow[i]>='a'&&unknow[i]<='z') t=unknow[i]-'a'+10;
        else t=unknow[i]-'0';
        if(t>imax) imax=t;
    }
    long long ra;
    for(ra=imax+1;ra<37;ra++){
        num2=0;
        for(int j=0;j<strlen(unknow);j++){
            int t;
            if(unknow[j]>='a'&&unknow[j]<='z') t=unknow[j]-'a'+10;
            else t=unknow[j]-'0';
            num2=num2*ra+t;
        }
        if(num2==num1){
            printf("%lld\n",ra);
            return;
        }
    }
    if(ra==37){
        long long low,high,middle;
        low=ra;
        high=num1>low?num1:low;
        while(low<=high){
            num2=0;
            middle=(low+high)/2;
            for(int j=0;j<strlen(unknow);j++){
                int t;
                if(unknow[j]>='a'&&unknow[j]<='z') t=unknow[j]-'a'+10;
                else t=unknow[j]-'0';
                num2=num2*middle+t;
            }
            if(num2>num1) high=middle-1;
            else if(num2==num1){
                printf("%lld\n",middle);
                return;
            }
            else low=middle+1;
        }
    }
    printf("Impossible\n");
}
int main()
{
    char n1[15],n2[15];
    int tag,radix;
    scanf("%s%s%d%d",n1,n2,&tag,&radix);
    if(tag==1){
        judge(n1,n2,radix);
    }
    else{
        judge(n2,n1,radix);
    }
    return 0;
}

测试点10未通过（个人觉得测试点10比较扯淡），改进如下：

#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
void judge(char* know,char* unknow,int radix){
    long long num1,num2;
    num1=0;
    for(int i=0;i<strlen(know);i++){
        int t;
        if(know[i]>='a'&&know[i]<='z') t=know[i]-'a'+10;
        else t=know[i]-'0';
        num1=num1*radix+t;
    }
    if(num1==1&&strlen(unknow)==1&&unknow[0]=='1'){
        printf("2\n");
        return;
    }
    int imax=0;
    for(int i=0;i<strlen(unknow);i++){
        int t;
        if(unknow[i]>='a'&&unknow[i]<='z') t=unknow[i]-'a'+10;
        else t=unknow[i]-'0';
        if(t>imax) imax=t;
    }
    long long ra;
    for(ra=imax+1;ra<37;ra++){
        num2=0;
        for(int j=0;j<strlen(unknow);j++){
            int t;
            if(unknow[j]>='a'&&unknow[j]<='z') t=unknow[j]-'a'+10;
            else t=unknow[j]-'0';
            num2=num2*ra+t;
        }
        if(num2==num1){
            printf("%lld\n",ra);
            return;
        }
    }
    if(ra==37){
        long long low,high,middle;
        low=ra;
        high=num1>low?num1:low;
        while(low<=high){
            num2=0;
            middle=(low+high)/2;
            for(int j=0;j<strlen(unknow);j++){
                int t;
                if(unknow[j]>='a'&&unknow[j]<='z') t=unknow[j]-'a'+10;
                else t=unknow[j]-'0';
                num2=num2*middle+t;
            }
            if(num2>num1) high=middle-1;
            else if(num2==num1){
                printf("%lld\n",middle);
                return;
            }
            else low=middle+1;
        }
    }
    printf("Impossible\n");
}
int main()
{
    char n1[15],n2[15];
    int tag,radix;
    scanf("%s%s%d%d",n1,n2,&tag,&radix);
    bool flag=true;
    int l1=strlen(n1);
    int l2=strlen(n2);
    int tmp=l1>l2?l2:l1;
    for(int i=0;i<tmp;i++)
        if(n1[i]!=n2[i]){
            flag=false;
            break;
        }
    if(!flag){
        if(tag==1){
            judge(n1,n2,radix);
        }
        else{
            judge(n2,n1,radix);
        }
    }
    else{
        printf("%lld\n",radix);
    }
    return 0;
}

至此，全部测试点通过。