id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
27,000 |
int main()
{
int temp,b[500];
int n,m,i,j;
long lala=0;
cin>>n;
scanf(" %1c",&i);
while((i>=48&&i<=57)||(i>=65&&i<=90)||(i>=97&&i<=122))
{
if (i>=48&&i<=57) temp=i-48;
if (i>=65&&i<=90) temp=i-55;
if (i>=97&&i<=122) temp=i-87;
lala=lala*n+temp;
scanf("%1c",&i);
}
cin>>m;
int c=0;
while(lala>=m)
{
b[c]=lala%m;
lala=lala/m;
c++;
}
b[c]=lala;
for(i=c;i>=0;i--) if (b[i]<10) cout<<b[i]; else printf("%c",b[i]+55);
}
| 55 |
27,001 |
int main()
{
char input[100],output[100];
int number[100],remainder[100],sum=0,a,b,i,t,l,g=1;
scanf("%d %s %d",&a,input,&b);
l=strlen(input);
for(i=0;i<l;i++)
{
if(input[i]>='A' && input[i]<='Z')
number[i]=input[i]-'A'+10;
if(input[i]>='a' && input[i]<='z')
number[i]=input[i]-'a'+10;
if(input[i]>='0' && input[i]<='9')
number[i]=input[i]-'0';
}
for (i=0;i<l;i++)
{
g=1;
for (t=0;t<i;t++)
{
g*=a;
}
sum=sum+number[l-1-i]*g;
}
for(i=0;i<100;i++)
{
remainder[i]=sum%b;
if(sum/b==0)
break;
sum=sum/b;
}
t=i+1;
for(i=t-1;i>=0; i--)
{
if(remainder[i]>=0 && remainder[i]<=9)
output[t-i-1]= remainder[i]+'0';
if(remainder[i]>=10 && remainder[i]<=35)
output[t-i-1]= remainder[i]+'A'-10;
}
output[t]=0;
printf("%s\n",output);
return 0;
}
| 55 |
27,002 |
int main()
{
char zhuan[36]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
int a,b;
char c[64],r[64];
int i,k;
long sum=0;
int q=0,w[64];
scanf("%d %s %d",&a,c,&b);
for(i=0;c[i];i++)
{if(c[i]>='0'&&c[i]<='9')
k=c[i]-'0';
else if(c[i]>='A'&&c[i]<='Z')
k=c[i]-'A'+10;
else if(c[i]>='a'&&c[i]<='z')
k=c[i]-'a'+10;
sum=sum*a+k;}
if(sum==0)
printf("0\n");
if(sum!=0)
{while(sum>0)
{w[q]=sum%b;
sum=sum/b;
q++;}//*
for(i=0;i<q;i++)
{r[q-1-i]=zhuan[w[i]];
}
for(i=0;i<q;i++)
printf("%c",r[i]);}
return 0;
}
| 55 |
27,003 | int main()
{
char x[200],y[200];
int a,b,i,j,num[200];
long int n=0;
cin>>a;
cin>>x;
cin>>b;
int nlen1=strlen(x);
for(i=0;i<=nlen1-1;i++)
{
if(x[i]>='0'&&x[i]<='9')
num[i]=x[i]-'0';
else if(x[i]>='a'&&x[i]<='z')
num[i]=x[i]-'a'+10;
else if(x[i]>='A'&&x[i]<='Z')
num[i]=x[i]-'A'+10;
n+=num[i]*((int)pow(a,(nlen1-1-i)));
}
if(n!=0)
{
for(i=0;n>=b;i++)
{
num[i]=n%b;
n=(n-num[i])/b;
}
if(n>0)num[i]=n;
else i-=1;
for(j=i;j>=0;j--)
{
if(num[j]>=0&&num[j]<=9)
cout<<num[j];
else
{y[j]=num[j]-10+'A';
cout<<y[j];}
}
}
else cout<<0;
return 0;
}
| 55 |
27,004 | void main()
{
char a[32]={0},b[32]={0};
long int n=0;
int i,k,j1,j2;
scanf("%d%s%d",&j1,a,&j2);
for (i=0;a[i]!=0;i++)
if (a[i]>='0'&&a[i]<='9')
n=n*j1+a[i]-'0';
else if (a[i]>='A'&&a[i]<='Z')
n=n*j1+a[i]-'A'+10;
else if (a[i]>='a'&&a[i]<='z')
n=n*j1+a[i]-'a'+10;
if (n==0)
printf("0\n");
else
{
for (i=0;i<=31,n>0;i++)
{
k=n%j2;
if (k<10)
b[i]=k+'0';
else b[i]=k-10+'A';
n=n/j2;
}
i=31;
while (b[i]==0)
i--;
for (;i>=0;i--)
printf("%c",b[i]);
printf("\n");
}
}
| 55 |
27,005 | void main()
{
char A[200],B[200];
int a,b,i=0,m=0;
long int n=0,k=0;
scanf("%d%s%d",&a,A,&b);
while (A[i]!='\0')
{
n=n*a;
if(A[i]<=60) n=n+A[i]-48;
else if(A[i]<=90) n=n+A[i]-55;
else n=n+A[i]-87;
i++;
}
k=n;
i=0;
if(k==0) printf("%ld",k);
while (n>0)
{
m=n%b;
if(m<=9) B[i]=m+48;
else if(m>=10) B[i]=m+55;
n=n/b;
i++;
}
B[i]='\0';
m=strlen(B);
n=k;
i=m-1;
while (i>=0)
{
m=n%b;
if(m<=9) B[i]=m+48;
else if(m>=10) B[i]=m+55;
n=n/b;
i--;
}
printf("%s\n",B);
} | 55 |
27,006 | int main()
{
char n[100];
int a,b;
cin>>a>>n>>b;
int num=0;
int i;
int len=strlen(n);//???????
for(i=0;i<len;i++)//??????10??
{
if(n[i]<='9' && n[i]>='0')
{
n[i]=n[i]-48;
}
if(n[i]<='z' && n[i]>='a')
{
n[i]=n[i]-87;
}
if(n[i]<='Z' && n[i]>='A')
{
n[i]=n[i]-55;
}
num=num+n[i]*((double)pow((double)a,(double)(len-1-i)));
}
if(num==0)
{
cout<<0;
}
else//???b??????????
{
int latter[100];
i=0;
do
{latter[i]=num%b;
num=num/b;
i++;
}while(num/b!=0);
latter[i]=num%b;
latter[i+1]='\0';
char n2[100];
int j;
for(j=0;i>=0;i--,j++)
{
if(latter[i]>=0 && latter[i]<=9)
{
n2[j]=latter[i]+48;
}
if(latter[i]>=10 && latter[i]<=36)
{
n2[j]=latter[i]+55;
}
cout<<n2[j];
}
}
cout<<endl;
return 0;
} | 55 |
27,007 | //*???2010?10?26?*
//*??????*
//******************************************
int main()//???
{//?????
int a=0,b=0,shijinzhi=0,weishu=0,i=0,j=0,shuchu[1000];//???????a?????????b?????????shijinzhi?????????????????weishu????????shuchu?????
char shuru[1000]="abcdefg";//????????????
cin>>a;
cin>>shuru;
cin>>b;//???????????????????????
weishu=strlen(shuru);//????????
for(i=0;i<=weishu-1;i++)
{
if(('A'<=shuru[i])&&(shuru[i]<='Z'))
shuru[i]=shuru[i]-'A'+10;
else if(('a'<=shuru[i])&&(shuru[i]<='z'))
shuru[i]=shuru[i]-'a'+10;
else if(('0'<=shuru[i])&&(shuru[i]<='9'))
shuru[i]=shuru[i]-'0';
}//?????
for(i=0;i<=weishu-1;i++)
{
shijinzhi=shijinzhi+(int)(shuru[i]*pow(1.0*a,1.0*(weishu-i-1)));
}//????????
if(shijinzhi==0)
printf("%d",shijinzhi);//???????????0??????
if(shijinzhi!=0)
{
for(i=0;shijinzhi!=0;i++)
{
shuchu[i]=shijinzhi%b;
shijinzhi=shijinzhi/b;
}
for(j=i-1;j>=0;j--)
{
if((0<=shuchu[j])&&(shuchu[j]<=9))
printf("%d",shuchu[j]);
else if(shuchu[j]>=10)
{
shuchu[j]=shuchu[j]+'A'-10;
printf("%c",shuchu[j]);
}
}
}//???0???????????????????
printf("\n");//??
return 0;
}//????? | 55 |
27,008 | main()
{
int m,n,b,d,i,j,k,l;
char a[100],c[100],e[100];
scanf("%d %s %d",&m,a,&n);
b=0;
for(i=0;a[i]!='\0';i++);
{
for(j=0;j<i;j++)
{
for(d=1,k=0;k<i-j-1;k++)
{
d*=m;
}
if(a[j]<='9'&&a[j]>='0')
b+=(d*(a[j]-'0'));
else if(a[j]<='z'&&a[j]>='a')
b+=(d*(a[j]-'a'+10));
else
b+=(d*(a[j]-'A'+10));
}
}
if(b==0)
printf("0");
else
{
for(l=0;b!=0;l++)
{
c[l]=b%n;
if(c[l]>9)
c[l]=c[l]-10+'A';
else
c[l]=c[l]+'0';
b=(b/n);
}
c[l]='\0';
for(i=0;i<l;i++)
e[i]=c[l-1-i];
e[l]='\0';
printf("%s",e);
getchar();
getchar();
}
}
| 55 |
27,009 | main()
{
int i,j,a,b,x,n;
long temp;
char s[10];
char p[10];
scanf("%d %s %d",&a,s,&b);
n=strlen(s);
temp=0;
for(i=0;i<n;i++)
{
if(s[i]>='a'&&s[i]<='z')
temp=temp*a+s[i]-'a'+10;
if(s[i]>='A'&&s[i]<='Z')
temp=temp*a+s[i]-'A'+10;
if(s[i]>='0'&&s[i]<='9')
temp=temp*a+s[i]-'0';
}
for(x=0,i=0;;i++)
{
if(temp%b>=10) p[x]=temp%b-10+'A';
else p[x]=temp%b+'0';
x++;
temp=temp/b;
if (temp==0) break;
}
for(i=x-1;i>=0;i--)
printf("%c",p[i]);
}
| 55 |
27,010 | int toten(int,char *);
void tento(int,char *,int);
int main()
{
int a,b,sum;
char x[100];
scanf("%d %s %d",&a,x,&b);
sum=toten(a,x);
tento(sum,x,b);
puts(x);
return 0;
}
int toten(int a,char *x)
{
int n=strlen(x);
char as[100];
int sum=0,i,j,c,b[100];
for(i=0;i<n;i++)
{
if('a'<=x[i]&&x[i]<='z')
b[i]=x[i]-'a'+10;
if('A'<=x[i]&&x[i]<='Z')
b[i]=x[i]-'A'+10;
if('0'<=x[i]&&x[i]<='9')
b[i]=x[i]-'0';
sum+=b[i]*pow(a*1.0,n-i-1);
}
return sum;
}
void tento(int sum,char *x,int b)
{
int a[100],i=0,j,c[100];
i=0;
if(sum==0)
{x[0]='0';
x[1]='\0';}
else
{
while(sum>0)
{
a[i]=sum%b;
sum=(sum-a[i])/b;
i++;
}
for(j=0;j<i;j++)
{
c[j]=a[i-1-j];
}
for(j=0;j<i;j++)
{
if(c[j]<=9)
x[j]=c[j]+'0';
else
x[j]=c[j]-10+'A';
}
x[i]='\0';
}
} | 55 |
27,011 | int pow(int m,int n)
{
int pi=1,i;
for(i=1;i<=n;i++)
{
pi=pi*m ;
}
return pi;
}
void Get(int sum,int b)
{
int t;
if (!sum)
return;
Get(sum/b,b);
t=sum%b;
if (t<10)
printf("%1d",t);
else
printf("%1c",t-10+'A');
}
int main()
{
int a,b,k=0,sum=0,i,j=0;//a???????,b???????,k???????,sum????????
char num[10000];//????????
char other[10000];//????????
int another[10000];
cin>>a;
cin>>num;
cin>>b;
k=strlen(num);
for(i=0;i<=k-1;i++)//??????
{ if(num[i]>=65&&num[i]<=90)
{
sum=sum+(num[i]-55)*pow(a,(k-i-1));
}
else if(num[i]>=97&&num[i]<=122)
{
sum=sum+(num[i]-87)*pow(a,(k-i-1));
}
else if(num[i]>=48&&num[i]<=57)
{
sum=sum+(num[i]-48)*pow(a,(k-i-1));
}
}
/** do//???b??
{
another[j]=sum%b;
sum=sum/b;
if(another[j]>=0&&another[j]<=9)
{other[j]=another[j]+48;}
else
{other[j]=another[j]+55;}
j=j+1;
}while(sum>0);
for(i=j;i>=0;i--)
{
cout<<other[i];//??
}*/
if (sum){
Get(sum,b);
cout<<endl;}
else
cout<<"0"<<endl;
return 0;
}
| 55 |
27,012 | int main()
{
char s[10000];
int a,b,k,d,i,j,c,n;
k=0;
scanf("%d %s %d",&a,s,&b);
for(i=strlen(s)-1;i>=0;i--)
{
if(s[i]>='a'&&s[i]<='z')
d=10+(int)(s[i]-'a');
if(s[i]>='A'&&s[i]<='Z')
d=10+(int)(s[i]-'A');
if(s[i]>='0'&&s[i]<='9')
d=(int)(s[i]-'0');
n=strlen(s)-1-i;
c=1;
for(j=0;j<n;j++)
c*=a;
k=k+d*c;
}
for(i=0;;i++)
{
if(k%b<=9)
{
c=k%b+48;
s[i]=(char)(c);
}
if(k%b>9)
{
c=k%b+55;
s[i]=(char)(c);
}
if(k/b==0)
{
break;
}
k=k/b;
}
d=i;
for(i=d;i>=0;i--)
printf("%c",s[i]);
scanf("%d",1);
return 0;
}
| 55 |
27,013 | main()
{
int i,j,k,m,n;
int n1,n2;
int a[1000];
unsigned long int sum=0,t=1;
char s[500];
scanf("%d %s %d",&n1,s,&n2);
n=strlen(s);
for(i=n-1;i>=0;i--)
{
if(s[i]<='Z'&&s[i]>='A')
s[i]=s[i]-'A'+10;
if(s[i]<='z'&&s[i]>='a')
s[i]=s[i]-'a'+10;
if(s[i]>='0'&&s[i]<='9')
s[i]=s[i]-'0';
sum=sum+s[i]*t;
if(i==0)
break;
t=t*n1; }
if(sum==0)
printf("0");
else{
i=0;
while(sum!=0)
{
k=sum%n2;
a[i]=k;
i++;
sum=sum/n2;
}
i=i-1;
for(j=i;j>=0;j--)
{
if(a[j]>=10)
printf("%c",a[j]+'A'-10);
else
printf("%d",a[j]);
}}
}
| 55 |
27,014 |
//????
int main()
{
int n,m;
int i,j,k,l;
char a[33];
int b[33];
long int mid;
int ar;
cin>>n;
for(i=0;i<33;i++)
{
a[i]=48;
b[i]=-1;
}
cin>>a;
i=0;
while(a[i]!='\0')
i++;
a[i]=48;
k=33-i;
for(l=0;l<i;l++)
{
a[k]=a[l];
a[l]=48;
k++;
}
//????????
//??????????????
for(k=0;k<33;k++)
{
if((a[k]>='0')&&(a[k]<='9'))
a[k]-='0';
else if((a[k]>='a')&&(a[k]<='z'))
a[k]=a[k]-87;
else
a[k]=a[k]-55;
}
//???????ing
mid=0;
ar=1;
for(j=32;j>=33-i;j--)
{
mid+=a[j]*ar;
ar*=n;
}
//?????????
cin>>m;
k=0;
while(mid!=0)
{
b[k]=mid%m;
mid=mid/m;
k++;
}
for(i=32;i>=0;i--)
if(b[i]!=-1)
{
if(b[i]>=10)
{
char m=b[i]+55;
cout<<m;
}
else
cout<<b[i];
}
cout<<'\n';
return 0;
}
| 55 |
27,015 |
int turn(char num)
{
if(num>='0'&&num<='9') return num-48;
if(num>='a'&&num<='z') return num-87;
if(num>='A'&&num<='Z') return num-55;
}
char turn(int num)
{
if(num>=0&&num<=9) return num+48;
if(num>=10&&num<=36) return num+55;
}
int main()
{
int a,b,i=-1,j=0,s;
long temp=0,temp1=0;
char num[8*sizeof(long)]={'\0'};
int num1[8*sizeof(long)]={0};
cin>>a;cin.get();
do
{
i++;
num[i]=cin.get();
}while(num[i]!=' ');
cin>>b;
for(;j<i;j++)
temp+=turn(num[j])*pow((double)a,i-j-1);
temp1=temp;
for(i=0;temp1>0;i++)
{
num1[i]=temp1%b;
temp1=temp1/b;
}
for(j=i-1;j>0;j--)
cout<<turn(num1[j]);
cout<<turn(num1[0]);
return 0;
}
| 55 |
27,016 | int main()
{
long k=0,a,b,i,h=0,c;
unsigned int e[100];
char n[100];
long l[10000];
long t[10000];
scanf("%d %s %d",&a,n,&b);
c = strlen(n);
for(i=0;i<=c-1;i++)
{
if(n[i]>='0'&& n[i]<='9')
n[i]=n[i]-('0'-0);
if(n[i]<='Z' && n[i]>='A')
n[i]=n[i]-('A'-10);
if(n[i]>='a' && n[i]<='z')
n[i]=n[i]-'a'+10;
h=a*h+n[i];
}
if(h==0)
printf("0");
for(i=0;h>0;i++)
{
e[i]=h%b;
h=h-e[i];
h=h/b;
k=k+1;
}
for(i=0;i<=k-1;i++)
{
n[i]=e[k-1-i];
if (n[i]>9)
n[i]=n[i]+'A'-10;
else
n[i]=n[i]+'0';
}
n[k]='\0';
printf("%s\n",n);
getchar();
getchar();
getchar();
getchar();
return 0;
} | 55 |
27,017 | void main()
{
int x,y;
scanf("%d",&x);
char a[100];
scanf("%s",a);
scanf("%d",&y);
int i,n=0;
for(i=0;i<strlen(a);i++)
{
if(a[i]>='0'&&a[i]<='9')
n=n*x+a[i]-'0';
else if(a[i]>='A'&&a[i]<='Z')
n=n*x+a[i]-'A'+10;
else if(a[i]>='a'&&a[i]<='z')
n=n*x+a[i]-'a'+10;
}
int b[100];
int j=0,k;
if(n==0)
printf("0");
else while(n>0)
{
b[j]=n%y;
j++;
n=n/y;
}
for(k=j-1;k>=0;k--)
{
if(b[k]<10)
printf("%d",b[k]);
if(b[k]>=10)
printf("%c",b[k]+55);
}
}
| 55 |
27,018 | void numchange(int x, int y, char c[100]);
int main()
{
int a, b;
char s[100]={0};
int i;
scanf("%d", &a);
scanf("%s", s);
scanf("%d", &b);
for(i=0;i<strlen(s);i++)
{if(s[i]>='a') s[i]=s[i]-'a'+'A';}
numchange(a,b,s);
return 0;
}
void numchange(int x, int y, char c[100])
{
int i, l, k=0;
long int s=0;
char m[100]={0};
l = strlen(c);
for(i=0;i<=l-1;i++)
{
if((c[i]>='0')&&(c[i]<='9'))
s=s*x+c[i]-'0';
if((c[i]>='A')&&(c[i]<='Z'))
s=s*x+c[i]-'A'+10;
}
for(i=0;;i++)
{
if(y<=10) m[i] = s%y+'0';
else
{
if(s%y<10) m[i] = s%y + '0';
else m[i] = s%y - 10 + 'A';
}
s = (s-s%y)/y;
k++;
if(s==0) break;
}
for(i=k-1;i>=0;i--)
printf("%c", m[i]);
}
| 55 |
27,019 | void main ()
{
int a,b,i,l;
long m=1,num=0;
char n[32],str[32]={0};
scanf("%d%s%d",&a,n,&b);
l=strlen(n);
for(i=0;i<l;i++)
{
if((n[i]>='a')&&(n[i]<='z'))n[i]-=87;
if((n[i]>='A')&&(n[i]<='Z'))n[i]-=55;
if((n[i]>='0')&&(n[i]<='9'))n[i]-=48;
}
for(i=l-1;i>=0;i--)
{
//if(m==1){num+=n[i];m=m*a;}
num+=m*n[i];
m=m*a;
}
m=1;
for(i=31;i>=0;i--)
{
str[i]=num%b;
num=num/b;
if(num==0)break;
}
for(l=i;l<32;l++)
{
if((str[l]>=0)&&(str[l]<=9))printf("%d",str[l]);
if(str[l]>=10)printf("%c",str[l]+55);
}
printf("\n");
}
| 55 |
27,020 | int main()
{int a,b,num;
int i=1,j=1,k=1,count=0;
long sum=0;
long sum1;
char n[100];
for(k=0;k<100;k++)
{n[k]='\0';
}
cin>>a>>n>>b;
for(count=0;count<100;count++)
{if(n[count]=='\0')
{num=count;
break;
}
}
int shu[num];
for(i=0;i<num;i++)
{shu[i]=n[i];
if(shu[i]<58)
shu[i]=shu[i]-48;
else if(shu[i]<91)
shu[i]=shu[i]-55;
else
shu[i]=shu[i]-87;
}
for(i=0;i<num;i++)
{
sum=sum+shu[i]*(long)pow((double)a,(double)(num-i-1));
}
sum1=sum;
for(i=1;i<100;i++)
{sum1=sum1/b;
if(sum1==0)
{break;}
}
long shu1[i];
for(j=0;j<i;j++)
{shu1[j]=sum%b;
sum=sum/b;
}
char m[i];
for(j=0;j<i;j++)
{if(shu1[i-j-1]<10)
m[j]=shu1[i-j-1]+48;
else
m[j]=shu1[i-j-1]+55;
cout<<m[j];
}
return 0;
}
| 55 |
27,021 | int main()
{
char x[200],y[200];
int a,b,i,j,num[200];
long int n=0;
cin>>a;
cin>>x;
cin>>b;
int nlen1=strlen(x);
for(i=0;i<=nlen1-1;i++)
{
if(x[i]>='0'&&x[i]<='9')
num[i]=x[i]-'0';
else if(x[i]>='a'&&x[i]<='z')
num[i]=x[i]-'a'+10;
else if(x[i]>='A'&&x[i]<='Z')
num[i]=x[i]-'A'+10;
n=n*a+num[i]; }
for(i=0;;i++)
{
num[i]=n%b;
n=n/b;
if(n==0)
break;
}
for(j=i;j>=0;j--)
{
if(num[j]>=0&&num[j]<=9)
cout<<num[j];
else
{y[j]=num[j]-10+'A';
cout<<y[j];}
}
return 0;
}
| 55 |
27,022 | char str[100];
int a,b;
int num,tmp,i;
int main() {
while(scanf("%d%s %d", &a, str, &b) != EOF){
num = 0;
for(i=0; str[i]; i++){
if(str[i] >= 'a') str[i] -= 32;
tmp = (str[i] >= 'A' ? str[i]-'A'+10:str[i]-'0');
//tmp = str[i]
num = num * a + tmp;
}
int cnt=0;
if(num == 0)
{puts("0"); continue;}
while(num){
if(num%b <=9)
str[cnt++] = num%b+'0';
else
str[cnt++] = num%b-10+'A';
num = num/b;
}
for(i=cnt-1; i>=0; i--)
printf("%c",str[i]);
puts("");
}
return 0;
}
| 55 |
27,023 | long pow(int m,int a)
{
long p=1;
for(int i=0;i<m;i++)p*=a;
return p;
}
int main()
{
char s1[200],s2[200];
int a,b;
cin>>a>>s1>>b;
long n=0;
int lt=strlen(s1);
int i,j;
for(i=0;i<lt;i++)
{
if(s1[i]>='a' && s1[i]<='z')s1[i]=s1[i]-'a'+10;
else if(s1[i]>='A' && s1[i]<='Z')s1[i]=s1[i]-'A'+10;
else s1[i]-='0';
}
for(i=0;i<lt;i++)
n+=s1[i]*pow(lt-i-1,a);
j=0;
while(n>0)
{
s2[j]=n%b;
n/=b;
j++;
}
for(i=0;i<j;i++)
{
if(s2[i]<10)s2[i]+='0';
else s2[i]+='A'-10;
}
for(i=0;i<j;i++)cout<<s2[j-1-i];
if(!j)cout<<'0';
cout<<endl;
return 0;
}
| 55 |
27,024 | void main()
{
int a,b,i,m,n,t,sum=0;
char str[100]={'0'},s[100]={'0'},c[100]={'0'};
scanf("%d %s %d",&a,str,&b);
n=strlen(str);
for (i=0;i<n;i++)
{
if (str[i]>=48 && str[i]<=57)
sum=sum*a+(int)str[i]-48;
else
{ if (str[i]>=65 && str[i]<=90)
sum=sum*a+(int)str[i]-55;
else
{ if (str[i]>=97 && str[i]<=122)
sum=sum*a+(int)str[i]-87;
}
}
}
for (i=0;sum!=0;i++)
{ t=sum%b;
sum=sum/b;
if (t<=9)
s[i]=(char)(t+48);
else
s[i]=(char)(t+55);
}
m=strlen(s);
for (i=0;i<m;i++)
{ c[i]=s[m-1-i];}
for (i=0;i<m;i++)
{ printf("%c",c[i]);}
printf("\n");
} | 55 |
27,025 | int main(int argc, char* argv[])
{
int a,b,i,j,l,k;
int sum=0,out=0;
char s[51];
scanf("%d %s %d",&a,s,&b);
l=strlen(s);
//printf("%d\n",l);
for(i=0;s[i]!='\0';i++)
{
if(s[i]>=97&&s[i]<=122)
s[i]=s[i]-32;
}
// printf("%s\n",s);
for(i=0;s[i]!='\0';i++)
{
if(s[i]>=65&&s[i]<=90)
{
k=s[i]-55;//printf("%d\n",k);
}
else
{
k=s[i]-48;//printf("=%d\n",k);
}
for(j=0;j<l-i-1;j++)
{
k=k*a;//printf("%d\n",k);
}
// printf("+%d\n",k);
sum=sum+k;
}
for(i=50;i>=0;i--)
{
if(sum%b>=0&&sum%b<=9)
{
s[i]=sum%b+48;
}
if(sum%b>=10)
{
s[i]=sum%b+55;
}
sum=(sum-sum%b)/b;
if(sum==0)
break;
}
for(j=i;j<51;j++)
{
printf("%c",s[j]);
}
printf("\n");
return 0;
} | 55 |
27,026 | //************************************************************************
//????????????????? *
//????wayne *
//?????11.12????????????????????????????*
//************************************************************************
int main()
{
char str[1000],num1[1000]; //?????????????
int a,b,len;
int num=0,i,j,p[1000]; //p[1000]??????????????
cin>>a>>str>>b;
len=strlen(str); //????????
for (i=0;i<=len-1;i++)
{
if (str[i]>47&&str[i]<58)
{str[i]=str[i]-48;}
else if (str[i]>64&&str[i]<91)
{str[i]=str[i]-55;}
else if (str[i]>96&&str[i]<123) //?????????????
{str[i]=str[i]-87;}
p[i]=str[i];
for (j=1;j<=len-1-i;j++)
p[i]=p[i]*a; //???????????????
num=num+p[i]; //??????????
}
i=0;
do
{
num1[i]=num%b;
if (num1[i]>=0&&num1[i]<=9)
num1[i]=num1[i]+48;
else if (num1[i]>=10&&num1[i]<=35)
num1[i]=num1[i]+55;
num=num/b;
i=i+1;
} while (num!=0); //?????????????????????
for (j=i-1;j>=0;j--) //????????
{
cout<<num1[j];
}
cout<<endl;
return 0;
} | 55 |
27,027 | main ()
{
int i,j,x,y=0,z,a,b,q;
char c[40];
scanf ("%d %s %d",&a,c,&b);
i=strlen (c);
if (c[0]=='0')
printf ("0\n");
else
{
for (j=0;j<i;j++)
{
if (c[j]>='A'&&c[j]<='Z')
x=c[j]-'A'+10;
else
{
if (c[j]>='a'&&c[j]<='z')
x=c[j]-'a'+10;
else
x=c[j]-'0';
}
y=y*a+x;
}
char k[40];
for (i=0,q=y;q!=0;i++)
{
k[i]=q%b;
q=q/b;
}
k[i]='0';
char h[i];
for (j=0;j<i;j++)
{
if (k[j]>9)
h[i-j-1]=k[j]+'A'-10;
else
h[i-j-1]=k[j]+'0';
}
for (j=0;j<i;j++)
printf ("%c",h[j]);
}
getchar ();
getchar ();
}
| 55 |
27,028 | char str[50],ans[50];
int main()
{
int i,j,k,l,length,num,x;
long m,n,ten=0,ten2=0;
scanf("%ld%s%ld",&n,str,&m);
length=strlen(str);
for(i=0;i<length;i++)
{
x=1;
if((str[i]>='a')&&(str[i]<='z')) num=str[i]-87;
else if((str[i]>='A')&&(str[i]<='Z')) num=str[i]-55;
else num=str[i]-48;
for(j=0;j<(length-i-1);j++)
{
x=x*n;
}
ten=ten+x*num;
}
if(ten==0) printf("0\n");
else
{
for(k=0;(ten!=0);k++)
{
ten2=ten;
ten=ten/m;
ans[k]=ten2-ten*m+48;
}
for(l=0;l<k;l++)
{
if(l!=(k-1))
{
if(ans[k-l-1]>'9') {ans[k-l-1]=ans[k-l-1]+7;printf("%c",ans[k-l-1]);}
else printf("%c",ans[k-l-1]);
}
else
{
if(ans[k-l-1]>'9') {ans[k-l-1]=ans[k-l-1]+7;printf("%c\n",ans[k-l-1]);}
else printf("%c\n",ans[k-l-1]);
}
}
}
return 0;
}
| 55 |
27,029 | void main()
{
int i,j,k,n,m;
long int t,p;
char a[50],c[50];
int b[50];
scanf("%d %s %d",&n,a,&m);
t=0;
for(j=0;a[j]!='\0';j++)
{
if('a'<=a[j]&&a[j]<='z')
b[j]=a[j]-87;
else if('A'<=a[j]&&a[j]<='Z')
b[j]=a[j]-55;
else if('0'<=a[j]&&a[j]<='9')
b[j]=a[j]-48;
}
for(i=0;i<=j-1;i++)
t=pow(n,j-i-1)*b[i]+t;
p=t;
if(t==0)
printf("0");
else
{
for(k=0;t!=0;k++)
t=t/m;
for(i=k-1;i>=0;i--)
{
if((p%m)>=10)
c[i]=p%m+55;
else
c[i]=p%m+48;
p=(p-p%m)/m;
}
c[k]='\0';
puts(c);
}
}
| 55 |
27,030 | const long maxL=100;
long a,b;
char str[maxL+1];
long ans[maxL+1];
main(){
long i,l,x;
scanf("%ld%s%ld",&a,str,&b);
l=strlen(str);
x=0;
for(i=0;i<l;i++){
x*=a;
if(str[i]>='0' && str[i]<='9')
x+=str[i]-'0';
else if(str[i]>='a' && str[i]<='z')
x+=str[i]-'a'+10;
else
x+=str[i]-'A'+10;
}
l=0;
while(x>0){
ans[l]=x%b;
x/=b;
l++;
}
if(l==0)ans[++l]=0;
for(i=l-1;i>=0;i--){
if(ans[i]<10)printf("%ld",ans[i]);
else printf("%c",ans[i]-10+'A');
}
return 0;
}
| 55 |
27,031 | int main(){
int n,m,i,j,s=0,y;
char a[100],b[100];
cin>>n>>a>>m;
for(i=0;a[i]!='\0';i++)
if(a[i]>96&&a[i]<123)a[i]=a[i]-32;//????????
for(i=0;a[i]!='\0';i++){
if(a[i]>64&&a[i]<91)s=s*n+(int)a[i]-55;
else s=s*n+a[i]-48;//?n?????????
}
b[0]=0;
if(s == 0)
cout << 0 << endl;
else{
for(;s>0;s=(s-y)/m){
y=s%m;
for(j=0;b[j]!=0;j++);
for(;j>=0;j--)b[j+1]=b[j];
if(y>9)b[0]=y+55;
else b[0]=y+48;//???????m??
}
cout<<b<<endl;
}
return 0;
} | 55 |
27,032 | char s[1000],v[10000];
int main()
{
int a,b,j,i,l,t=0;
scanf("%d",&a);
scanf("%s",s);
scanf("%d",&b);
l=strlen(s);
int m=1;
for(j=0;j<l;j++)
{
if(s[j]>='0'&&s[j]<='9')
s[j]-='0';
if(s[j]>='a'&&s[j]<='z') s[j]-=('a'-10);
if(s[j]>='A'&&s[j]<='Z') s[j]-=('A'-10);
}
for(i=l-1;i>=0;i--)
{
t+=s[i]*m;
m*=a;
}
m=0;
while(t)
{
v[m]=t%b;
m++;
t=t/b;
}
for(i=0;i<m;i++)
{
if(v[i]>=0&&v[i]<=9) v[i]+='0';
else if(v[i]>=10&&v[i]<=35)
v[i]+=('A'-10);
}
for(i=m-1;i>=0;i--)
printf("%c",v[i]);
if(m==0)
printf("0");
return 0;
}
| 55 |
27,033 | long int f(int ia[],int m,int la);
void main()
{
char a[200],b[200];
int m,n,la,i,j,ia[200],ib[200],t;
long int sum;
scanf("%d",&m);
scanf("%s",a);
scanf("%d",&n);
la=strlen(a);
for(i=0;i<la;i++)
{
if(a[i]>='0'&&a[i]<='9')
t=a[i]-'0';
else if(a[i]>='a'&&a[i]<='z')
t=a[i]-'a'+10;
else if(a[i]>='A'&&a[i]<='Z')
t=a[i]-'A'+10;
ia[la-i-1]=t;
}
sum=f(ia,m,la);
if(sum==0)
printf("%d",sum);
for(i=0;sum!=0;i++)
{
ib[i]=sum%n;
sum=sum/n;
}
for(j=0;j<i;j++)
{
if(ib[j]<10)
b[i-1-j]=ib[j]+'0';
else if(ib[j]>9)
b[i-1-j]=ib[j]-10+'A';
}
for(j=0;j<i;j++)
printf("%c",b[j]);
}
long int f(int ia[],int m,int la)
{
int i,j;
long int sum=0,num;
for(i=0;i<la;i++)
{
num=1;
for(j=0;j<i;j++)
num=num*m;
sum=sum+num*ia[i];
}
return(sum);
} | 55 |
27,034 | int calc(char c)
{
if (c>='0' && c<='9') return c-'0';
else if (c>='a' && c<='z') return c-'a'+10;
else if (c>='A' && c<='Z') return c-'A'+10;
}
char form(int n)
{
if (n>=0 && n<=9) return '0'+n;
else return 'A'+n-10;
}
main()
{
int a,b,n,len,bs1;
char s[200];
char *p;
scanf("%d",&a);
scanf("%s",&s);
scanf("%d",&b);
len=strlen(s)-1;
bs1=1;
n=0;
int i;
for (i=len;i>=0;i--)
{
n+=bs1*(calc(s[i]));
bs1*=a;
}
if (n==0) printf("0");
for (i=0;n>0;i++)
{
s[i]=form(n%b);
n/=b;
}
for (int j=--i;j>=0;j--)
putchar(s[j]);
printf("\n");
}
| 55 |
27,035 | int qr(int x,int y)
{
if(y<=0)
return(1);
else return x*qr(x,(y-1));
}
int main()
{
int a,b,n,i,j,d[100];
long int k=0;
char p[100],q[100];
scanf("%d %s %d",&a,p,&b);
n=strlen(p);
for(i=0;i<n;i++)
{
if(p[i]<='z'&&p[i]>='a')
p[i]-=32;
}
for(i=0;i<n;i++)
{
if(p[i]>='A'&&p[i]<='Z')
k+=(qr(a,(n-1-i))*(p[i]-'A'+10));
else
k+=(qr(a,(n-1-i))*(p[i]-'0'));
}
for(i=0;;i++)
{
if(k>=b)
{
d[i]=(k-(k/b)*b);
k=k/b;
}
else
{
d[i]=k;
break;
}
}
for(j=0;j<=i;j++)
{
if(d[j]<=9)
q[j]=d[j]+'0';
else
q[j]=d[j]-10+'A';
}
for(j=i;j>=0;j--)
printf("%c",q[j]);
return(0);
}
| 55 |
27,036 | void main()
{
int i,j,a,b;
long x=0,t=1;
char n[50],m[50];
for(i=50;i>=0;i--)
{
m[i]='\0';
n[i]='\0';
}
scanf("%d",&a);
scanf("%s",n);
scanf("%d",&b);
for(i=50;i>=0;i--)
{
if(n[i]!='\0')
{
for(j=i;j>=0;j--)
{
if(n[j]>=48&&n[j]<=59)
{
x=x+(n[j]-48)*t;
t=t*a;
}
if(n[j]>=65&&n[j]<=90)
{
x=x+(n[j]-55)*t;
t=t*a;
}
if(n[j]>=97&&n[j]<=122)
{
x=x+(n[j]-87)*t;
t=t*a;
}
}
if(j==-1)
break;
}
}
for(i=50;i>=0;i--)
{
if(x==0)
break;
if(b<=10)
{
m[i]=x%b+48;
x=x/b;
}
if(b>10)
{
if(x%b<=9)
m[i]=x%b+48;
if(x%b>=10)
m[i]=x%b+55;
x=x/b;
}
}
for(i=0;i<=50;i++)
{
if(m[i]!='\0')
{
for(j=i;j<=50;j++)
printf("%c",m[j]);
break;
}
if(i==50&&m[i]=='\0')
printf("0");
}
printf("\n");
} | 55 |
27,037 | void main()
{
char str[100];
long d[100],x,y,i,j,n,m=0,p,q,k;
scanf("%ld%s%ld",&x,str,&y);
k=strlen(str);
for(i=0;i<k;i++)
{
if(str[i]>=48&&str[i]<=57) str[i]=str[i]-48;
else if(str[i]>=65&&str[i]<=90) str[i]=str[i]-55;
else if(str[i]>=97&&str[i]<=122) str[i]=str[i]-87;
n=k-1-i;
q=(long)pow(x,n);
m=m+str[i]*q;
}
for(i=0;p!=0;i++)
{
d[i]=m%y;
p=m/y;
m=p;
}
for(j=i-1;j>=0;j--)
{
if(d[j]>=0&&d[j]<10) printf("%ld",d[j]);
else
{
d[j]=d[j]+55;
printf("%c",d[j]);
}
}
} | 55 |
27,038 |
/**
?originBase?number???10??
*/
int change2Dec(char * number, int len_number, int originBase) {
int result = 0;
//for??
for (int i=0; i<len_number; i++) {
//???????10????????
int numberBit = 0;
if (number[i]>='0' && number[i]<='9') {
numberBit = number[i]-'0';
}
else if (number[i]>='a' && number[i]<='z') {
numberBit = number[i]-'a'+10;
}
else {
numberBit = number[i]-'A'+10;
}
//???????????
int position = len_number-i;
//????????????
int currentBitValue = numberBit;
for (int i=1; i<position; i++) {
currentBitValue *= originBase;
}
result += currentBitValue;
}
return result;
}
/**
?10??decNumber???newBase??????newNumber????????????
*/
int changeDec2NewBase(int decNumber, int newBase, char* newNumber) {
int bitValue[100]; //???????????????????
int length=0; //???????
while (decNumber/newBase > 0) {
bitValue[length++] = decNumber%newBase; //??
decNumber /= newBase;
}
bitValue[length++] = decNumber; //??????
for (int i=length-1,j=0; i>=0; i--,j++) {
int currentBit = bitValue[i];
if (currentBit < 10)
newNumber[j]=currentBit+'0';
else
newNumber[j]=currentBit+'A'-10;
}
return length;
}
int main()
{
int originBase; //????
int newBase; //???
char number[100]; //????????
char newNumber[100]; //??????
cin >> originBase >> number >> newBase;
int len_number; //????????
int len_newNumber; //????????
for (int i=0; i<100; i++)
if (number[i]==0) {
len_number = i;
break;
}
int decNumber = change2Dec(number, len_number, originBase);
len_newNumber = changeDec2NewBase(decNumber, newBase, newNumber);
newNumber[len_newNumber]=0;
cout << newNumber << endl;
}
| 55 |
27,039 | int main()
{
int a,b,c,sum,i,k,l;
char n[40];
scanf("%d %s %d",&a,n,&b);
l=strlen(n);
if(n[0]=='0')
printf("0\n");
else
{
for(i=0,sum=0;i<l;i++)
{
if(n[i]>='a' && n[i]<='z')
c=n[i]-'a'+10;
if(n[i]>='A' && n[i]<='Z')
c=n[i]-'A'+10;
if(n[i]>='0' && n[i]<='9')
c=n[i]-'0';
sum=c+sum*a;
}
char d[40];
for(k=0;sum!=0;k++)
{
d[k]=sum%b;
sum=sum/b;
}
d[k]='\0';
char e[40];
for(i=0;i<k;i++)
{
if(d[i]<10)
e[k-1-i]=d[i]+'0';
else
e[k-1-i]=d[i]-10+'A';
}
e[k]='\0';
printf("%s",e);
}
getchar();
getchar();
}
| 55 |
27,040 | int main()
{
int a,b,i,j=0;
char str[100001];
long sum=0;
cin>>a>>str>>b;
for(i=0;i<100001&&str[i]!=0;i++)
{
if(str[i]>='0'&&str[i]<='9')str[i]-='0';
else if(str[i]>='a'&&str[i]<='z')str[i]=str[i]-'a'+10;
else if(str[i]>='A'&&str[i]<='Z')str[i]=str[i]-'A'+10;
sum*=a;
sum+=str[i];
}
int save[100000]={0};
while(sum!=0)
{
save[j++]=sum%b;
sum/=b;
}
char temp;
for(i=j-1;i>=0;i--)
{
if(save[i]<10)temp=save[i]+'0';
else temp=save[i]-10+'A';
cout<<temp;
}
if(j==0)cout<<0<<endl;
return 0;
}
| 55 |
27,041 | void run(int base1, char a[50], int base2)
{
char d[36] = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
int len = strlen(a);
int b[50] = {0}, c[50] = {0}, s = 0, i =0;
for (i = 0; i < len; i++)
{
if (a[i] >= 'A' && a[i] <= 'Z')
b[i] = a[i] - 55;
else
{
if (a[i] >= 'a' && a[i] <= 'z')
b[i] = a[i] - 87;
else
b[i] = a[i] - '0';
}
s += b[i] * pow(base1 + 0.0,len - i - 1);
}
i = 0;
while (s > 0)
{
c[i++] = s % base2;
s = s / base2;
}
if (i == 0)
{cout << "0";}
else
{
i--;
for (; i >= 0; i--)
cout << d[c[i]];
}
}
int main()
{
int base1, base2, i;
char a[50];
for (i = 0; i < 50; i++)
{
a[i] = '\0';
}
cin >> base1 >> a >> base2;
run (base1,a,base2);
return 0;
} | 55 |
27,042 | void main()
{
char ch1[1000],ch2[1000];
long a,b,n=0,i,j,p=1;
scanf("%d%s%d",&a,ch1,&b);
for(i=strlen(ch1)-1;i>=0;i--)
{
if(ch1[i]>='0'&&ch1[i]<='9')n+=(ch1[i]-'0')*p;
if(ch1[i]>='A'&&ch1[i]<='Z')n+=(ch1[i]-'A'+10)*p;
if(ch1[i]>='a'&&ch1[i]<='z')n+=(ch1[i]-'a'+10)*p;
p*=a;
}
if(n!=0)
{
for(i=0;n>=1;i++)
{
if(n%b<10)ch2[i]=n%b+'0';
else ch2[i]=n%b+'A'-10;
n=(n-n%b)/b;
}
}
else {ch2[0]='0';i=1;}
for(j=i-1;j>=0;j--)
printf("%c",ch2[j]);
printf("\n");
} | 55 |
27,043 | int main()
{
int a = 0, i = 0;
int b, j, num[100] = {0}, sum = 0, flag1 = 0, flag2 = 0, l;
char str1[100];
cin >> a >> str1 >> b;
l = strlen(str1);
for (i = 0; i <= l - 1; i++)
{
if(str1[i] > 96)
str1[i] = str1[i] - 87;
else if (str1[i] > 64)
str1[i] = str1[i] - 55;
else
str1[i] = str1[i] - '0';
sum = sum * a + str1[i];
}
for(j = 0; sum > 0; j++)
{
num[j] = sum % b;
sum = sum / b;
}
j--;
for(; j >= 0; j--)
{
if((num[j] != 0) && (flag1 == 0))
{
if(num[j] > 9)
{
num[j] = num[j] + 55;
cout << (char)num[j];
}
else
cout << num[j];
flag1 = 1;
flag2 = 1;
j--;
}
if(flag1 == 1)
{
if(num[j] > 9)
{
num[j] = num[j] + 55;
cout << (char)num[j];
}
else
cout << num[j];
flag2 = 1;
}
}
if(flag2 == 0)
cout << "0";
return 0;
}
| 55 |
27,044 | int main()
{
int a,b,n=0,c,i;
char d[100];
cin>>a;
cin.get();
while((c=cin.get())!=' ')
{
if(48<=c&&c<=57) c=c-48;
if(65<=c&&c<=90) c=c-55;
if(97<=c&&c<=122) c=c-87;
n=n*a+c;
}
cin>>b;
if(n==0) cout<<'0'<<endl;
for(i=1; n!=0; i++)
{
d[i]=n%b;
n=n/b;
}
for(i=i-1; i>=1; i--)
{
if(0<=d[i]&&d[i]<=9) d[i]=d[i]+48;
else d[i]=d[i]+55;
cout<<d[i];
}
cout<<endl;
return 0;
}
| 55 |
27,045 | main()
{
long int p=0;
int m,n,e=1,i,q,N;
char a[100],b[100];
scanf ("%d",&m);
scanf ("%s",a);
scanf ("%d",&n);
N=strlen(a);
for(i=0;i<=N-1;i++)
{
if (a[i]>='a'&&a[i]<='z')
b[i]=a[i]-'a'+10;
else if (a[i]>='A'&&a[i]<='Z')
b[i]=a[i]-'A'+10;
else
b[i]=a[i]-'0';
}
for(i=N-1;i>=0;i--)
{
p+=b[i]*e;
e*=m;
}
for (i=0;;i++)
{
b[i]=p%n;
p=p/n;
if (p==0)
{
q=i;
break;
}
}
for (i=q;i>=0;i--)
{
if (b[i]>=0&&b[i]<=9)
printf ("%c",b[i]+'0');
else
printf ("%c",b[i]-10+'A');
}
} | 55 |
27,046 |
long C(long Z,long X)
{ long V;
if (X==0)
V=1;
else
{
V=1;
for(long B=1;B<=X;B++)
V=V*Z;
}
return V;
}
main()
{
char q;
int d=0;
long o,a,b,p,k,h,i,t;
char n[20],l,g;
scanf("%d %s %d",&a,n,&b);
o=strlen(n);
long m[o];
for(k=0;k<=o-1;k++)
{
l=n[k];
if(('9'-l>=0)&&('0'-l<=0))
l=l-'0';
else
{
if((l<=96)&&(l>=10))
l=l-55;
else
{
if(l>=97)
l=l-87;
}
}
m[k]=l;
}
p=0;
for(k=0;k<=o-1;k++)
{long s=o-k-1;
p=p+(m[k])*(C(a,s));
}
if(p==0)
printf("0");
if(b>=10)
{
for(int j=9;j>=0;j--)
{
t=p/(C(b,j));
p=p-t*C(b,j);
if(t!=0||d!=0)
{
if(t>=10&&t<=50)
{
g=t+55;
printf("%c",g);
}
else
printf("%d",t);
d++;
}
}
}
else
{
for(int j=20;j>=0;j--)
{
t=p/(C(b,j));
p=p-t*C(b,j);
if(t!=0||d!=0)
{
if(t>=10&&t<=50)
{
g=t+55;
printf("%c",g);
}
else
printf("%d",t);
d++;
}
}
}
getchar();
getchar();
}
| 55 |
27,047 | int main() {
int a, b, ten = 0;
char str[100], str2[100];
cin >> a >> str >> b;
int len = strlen( str );
for ( int i = 0; str[i] != '\0'; i ++ ) {
if ( str[i] >= '0' && str[i] <= '9' ) ten += ( str[i] - '0' ) * pow ( ( double ) a, ( double ) ( len - 1 - i ) ) ;
else if ( str[i] <= 'z' && str[i] >= 'a' ) ten += ( str[i] - 'a' + 10 ) * pow ( ( double ) a, ( double ) ( len - 1 - i ) );
else ten += ( str[i] - 'A' + 10 ) * pow ( ( double ) a, ( double ) ( len - 1 - i ) );
}
int j = 0;
if ( ten == 0 ) cout << 0;
else {
while ( ten != 0 ) {
if ( ten % b <= 9 ) str2[j ++] = ( char )( ten % b + '0' );
else str2[j ++] = ( char )( ten % b - 10 + 'A' );
ten /= b;
}
j --;
for ( int i = j; i >= 0; i -- ) {
cout << str2[i];
}
}
return 0;
}
| 55 |
27,048 | /*
??
?????????????????2???36?????????long??????????
???????????0?1?...?9?a?b?...?z????0?1?...?9?A?B?...?Z??
????
?????????????a?n?b?a?????n ?a?????b????a????n???b?????
a?b???????2 ? a?b < 36?
????
???????????????????b?????????????????????0?1?...?9?A?B?...?Z??
????
15 Aab3 7
????
210306
??
???????????????
*/
int dec(char nf[100],int ii,int sysf) //?????????????
{ //nf???????????nf?0??nf?ii??????sysf?????????
int sum=0,exp=1;
int k,j;
for (k=ii;k>=0;k--)
{
if (ii!=k) exp=exp*sysf;
sum+=((int)nf[k])*exp;
}
return sum;
}
void trans(char outf[100],int pos,int decf,int sysf) //?????????????????????????????????????????
{ //outf????????????outf?99??outf?0????pos?????????????decf??????????sysf??????
int rem,t;
while((decf!=0)&&(pos>=0))
{
rem=decf%sysf; //rem???????????
decf=(int)(decf/sysf); //decf??????????
if ((rem>=0)&&(rem<=9)) outf[pos]=rem+48;
else if ((rem>=10)&&(rem<=35)) outf[pos]=rem+55;
pos--;
}
for (t=pos+1;t<=99;t++) cout<<outf[t];
cout<<endl;
}
int main()
{
int a,b,i=0,k,temp;
char n[100],c;
char output[100];
cin>>a;
getchar();
while (c=getchar(),c!=' ')
{
n[i]=c;
i++;
}
i--;
cin>>b;
for (k=0;k<=i;k++)
{
if ((n[k]>='a')&&(n[k]<='z')) n[k]-=87;
else if ((n[k]>='A')&&(n[k]<='Z')) n[k]-=55;
else if ((n[k]>='0')&&(n[k]<='9')) n[k]-=48;
}
temp=dec(n,i,a);
if (temp==0) cout<<"0"<<endl;
else trans(output,99,temp,b);
return 0;
} | 55 |
27,049 |
int main()
{
int a,b,num=0,i;
char n[31],m[31];
cin>>a>>n>>b;
for(i=0;i<strlen(n);i++)
{
if(n[i]<58)n[i]-=48;
else
{
if(n[i]>96)n[i]-=87;
else n[i]-=55;
}
num=num*a+n[i];
}
for(i=0;num;i++)
{
if(num%b<10)m[i]=num%b+48;
else m[i]=num%b+55;
num=num/b;
}
if(i)for(;i>0;i--)cout<<m[i-1];
else cout<<0;
return 0;
} | 55 |
27,050 |
void up(char *input)
{
while (*input)
{
if (((*input)>='a')&&((*input)<='z')) *input-=32;
input++;
}
}
int main()
{
char chart[]="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int src=0,dst=0;
int i;
long int result=0;
char input[100],output[MAX],*curr;
scanf("%d %s %d",&src,input,&dst);
up(input);
for(i=0;input[i];i++)
{
if (input[i]>='A')
result=result*src+input[i]-'A'+10;
else result=result*src+input[i]-'0';
}
output[MAX-1]=0;
curr=&(output[MAX-1]);
do
{
curr--;
*curr=chart[result%dst];
result/=dst;
}while (result);
printf("%s",curr);
return 0;
} | 55 |
27,051 | int main()
{
int m,n,c[100],d[100],i,j,p,q,t=1,s=0;
char a[100],b[100];
scanf("%d %s %d",&m,a,&n);
for(i=0;a[i]!='\0';i++)
{
if(a[i]>='0'&&a[i]<='9')
c[i]=a[i]-'0';
else if(a[i]>='a'&&a[i]<='z')
c[i]=a[i]-'a'+10;
else if(a[i]>='A'&&a[i]<='Z')
c[i]=a[i]-'A'+10;
}
p = i;
for(i=p-1;i>=0;i--)
{
s=s+t*c[i];
t=t*m;
}
if(s==0)
printf("0");
else
{
for(i=0;s!=0;i++)
{
d[i]=s%n;
s=s/n;
}
q = i;
for(i=0;i<q;i++)
{
if(d[i]>=0&&d[i]<=9)
b[i]=d[i]+'0';
else
b[i]=d[i]+'A'-10;
}
for(i=q-1;i>=0;i--)
printf("%c",b[i]);
}
printf("\n");
getchar();
getchar();
}
| 55 |
27,052 | int f(int a,int n){
if(n==0) return 1;
else if(n==1) return a;
else return(a*f(a,n-1));
}
char n[100],m[100];
int main(){
int a,b,num=0;
cin>>a>>n>>b;
for(int i = 0;i < (int)strlen(n);i ++){
if(islower(n[i])) num+=((int)n[i]-87)*f(a,(int)strlen(n)-i-1);
else if(isupper(n[i])) num+=((int)n[i]-55)*f(a,(int)strlen(n)-i-1);
else if(isdigit(n[i])) num+=((int)n[i]-48)*f(a,(int)strlen(n)-i-1);
}if (num == 0) {puts("0"); return 0;}
int i=0;
while(num>0){
if(num%b>9) {
m[i]=(char)(num%b+55);num=num/b;
}
else if(num%b==0) {
m[i]='0';num=num/b;
}
else {
m[i]=(char)(num%b+48);num=num/b;
}
i++;
}
for (int j = 1; j <= i; j++) cout <<m[i - j];
return 0;
}
| 55 |
27,053 | int convertorto10(char A[],int code,int right)
{
if(right==0)
return(A[0]-'0');
else return(A[right]-'0'+code*convertorto10(A,code,right-1));
}
void main()
{
int a,b,l,c,i,j;
char n[100],nf[100],m[100],mf[100];
scanf("%d %s%d",&a,n,&b);
l=strlen(n);
for(i=0;i<l;i++)
{
if(64<n[i]&&n[i]<91)
nf[i]=n[i]-7;
else if(n[i]>96)
nf[i]=n[i]-39;
else nf[i]=n[i];
}
c=convertorto10(nf,a,l-1);
i=0;
while(c/b>0)
{
m[i]=c%b;
c=c/b;
i=i+1;
}
m[i]=c;
for(j=0;j<=i;j++)
mf[j]=m[i-j];
for(j=0;j<=i;j++)
{
if(mf[j]<10)
mf[j]=mf[j]+48;
else if(mf[j]>9)
mf[j]=mf[j]+55;
}
for(j=0;j<=i;j++)
printf("%c",mf[j]);
}
| 55 |
27,054 | int main()
{
char str[100000];
long int k,t,n,m,a,i,j;
scanf("%d%s%d",&k,str,&t);
n=strlen(str);
for(i=0;i<n;i++)
{
if(str[i]>96)
str[i]=str[i]-32;
}
m=0;
for(i=0;i<n;i++)
{
a=1;
for(j=1;j<n-i;j++)
{
a=a*k;
}
if(str[i]>=65)
m=m+(str[i]-55)*a;
else
m=m+(str[i]-48)*a;
}
if(m==0)
printf("0");
else
{i=0;
while(m>0)
{
j=m%t;
if(j<10)
str[i]=j+48;
else str[i]=j+55;
i=i+1;
m=(m-j)/t;
}
for(j=i-1;j>=0;j--)
printf("%c",str[j]);}
return 0;
}
| 55 |
27,055 | int main()
{
int a,b,x,m,l,g,i,j,k,y,z;
char c[40];
scanf("%d %s %d",&a,c,&b);
l=strlen(c);
if (c[0]=='0') printf("0\n");
else
{
for (i=0;i<l;i++) //×?0?9?0?7ó?0?4?0?3?0?4?0?7
if (c[i]>='A'&&c[i]<='Z') c[i]=c[i]-'A'+'a';
x=0;
int d[40];
for (i=0;i<l;i++) //×?0?9?0?3?0?4?0?6?0?7?0?8?0?3?0?5?0?3?0?0?0?4x
{
if (c[i]>='a')
c[i]=c[i]-'a'+10;
else
c[i]=c[i]-'0';
d[i]=1;
for (j=l-i;j>1;j--)
d[i]=d[i]*a;
x=x+d[i]*c[i];
}
char e[40];
for (k=0;x!=0;k++) //×?0?9?0?3?0?4?0?6?0?7b?0?5?0?3?0?0?0?4
{
e[k]=x%b; //?0?5?0?0?0?1?0?6?0?5°?0?8?0?2?0?3?0?8?0?8?0?5?0?7?0?3?0?8?0?5e ·?0?7?0?4ò
x=x/b;
}
e[k]='\0';
char f[40]; //?0?5?0?0e×?0?9?0?3?0?4?0?6?0?7asc?0?0?0?5 ·?0?7?0?4ò?0?7?0?3?0?6?0?5f
for (y=0;y<k;y++)
{
if (e[y]<10)
f[k-1-y]=e[y]+'0';
else
f[k-1-y]=e[y]-10+'A';
}
f[k]='\0';
printf("%s",f);
}
}
| 55 |
27,056 | //*******************************
//* ??:???? *
//* ??:?? *
//* ??:2007.12.2 *
//* ??:???? *
//*******************************
void main()
{
long n; //????,??
int jz1,jz2; //??
int wei1,wei2; //??(?????????-1,???????)
int i,j; //????
char a[35]={0},b[35]; //?????????
char t; //??
scanf("%d %s %d",&jz1,a,&jz2);//????&
if(a[0]=='0')printf("0\n");
else
{
for(i=0;a[i]!=0;i++);
wei1=i-1;
for(i=0;i<=wei1;i++)
{
if(a[i]>='a'&&a[i]<='z')
a[i]-='a'-10; //??????!!!!!!!!!!????!!!!!!!!!!!!!!!!!!!!??10???"-"
else if(a[i]>='A'&&a[i]<='Z')
a[i]-='A'-10;
else a[i]-='0';
}
for(j=wei1,i=0,n=0;i<=wei1;i++,j--) //???n???????
n+=pow(jz1,j)*a[i]; //????warning,????
for(i=0;n!=0;i++) //??,?????n=0????
{
b[i]=n%jz2;
n/=jz2;
}
wei2=i-1;
for(i=0;i<=wei2/2;i++)
{t=b[i];b[i]=b[wei2-i];b[wei2-i]=t;}
b[wei2+1]=0;
for(i=0;i<=wei2;i++)
{
if(b[i]>=10)b[i]+='A'-10;
else b[i]+='0';
}
puts(b);
}
}
// ******
// * ? *
// ******
| 55 |
27,057 | int main()
{
int a, b, i, j, k, p, q, ln, lm, sum = 0;
char n[101], m[101] = {0};
cin >> a;
cin >> n;
cin >> b;
ln = strlen(n);
if (a <= 10)
{
for ( i = 0; i <= ln - 1; i++)
sum = sum * a + n[i] - '0';
}
else if ( a > 10)
{
for ( i = 0; i <= ln - 1; i++)
{
if ((n[i] <= 'z') && (n[i] >= 'a'))
n[i] = n[i] - 'a' + 'A';
if ((n[i] <= 'Z') && (n[i] >= 'A'))
sum = sum * a + n[i] + 10 - 'A';
if ((n[i] <= '9') && (n[i] >= '0'))
sum = sum * a + n[i] - '0';
}
}
if (b <= 10)
{
for (i = 0; ; i++)
{
m[i] = sum % b + '0' ;
sum = sum / b;
if (sum == 0)
break;
}
lm = strlen(m);
for (i = lm - 1; i >= 0; i--)
cout << m[i];
}
if (b > 10)
{
for (i = 0; ; i++)
{
if ((sum % b) >= 10)
{
m[i] = sum % b -10 + 'A';
sum = sum / b;
if (sum == 0)
break;
}
else if ((sum % b) < 10)
{
m[i] = sum % b + '0' ;
sum = sum / b;
if (sum == 0)
break;
}
}
lm = strlen(m);
for (i = lm - 1; i >= 0; i--)
cout << m[i];
}
return 0;
} | 55 |
27,058 | int main()
{
int zheng[255];
char fan[]="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int from,to;
char in[255];
scanf("%d%s%d",&from,in,&to);
int i;
for(i='0';i<='9';i++)
zheng[i]=i-'0';
for(i='A';i<='Z';i++)
zheng[i]=i-'A'+10;
for(i='a';i<='z';i++)
zheng[i]=i-'a'+10;
int sum=0;
for(i=0;in[i];i++)
{
sum=sum*from+zheng[in[i]];
}
char out[255]="0";
int l=0;
l=(sum==0)?1:0;
while(sum>0)
{ out[l]=fan[sum%to];
l++;
sum/=to;
}
for(i=l-1;i>=0;i--)
printf("%c",out[i]);
return 0;
}
| 55 |
27,059 | int main()
{
char c[100],t;
int d[100]={0};//??????????
int a,b,n,i=0,lc;//a,b????????
int number=0,decimal=0;
cin>>a>>c>>b;
if(c[0]=='0')cout<<'0';
lc=strlen(c);
for(i=0;c[i]!='\0';i++)
{
if(c[i]>='0'&&c[i]<='9')
decimal=c[i]-'0';
if(c[i]>='a'&&c[i]<='z')
decimal=c[i]-'A'-22;
if(c[i]>='A'&&c[i]<='Z')
decimal=c[i]-'A'+10;
number=number*a+decimal;
}
//cout<<number<<endl;
i=0;
while(number>0)
{
d[i]=number%b;
number=number-d[i];
number/=b;
i++;
}
i--;
for(;i>=0;i--)
{
if(d[i]>=10)
{t=d[i]+'A'-10;cout<<t;}
else
cout<<d[i];
}
int ss;cin>>ss;
return 0;
}
| 55 |
27,060 |
int main()
{
int a, b;
char num[100], t[100];
scanf("%d%s%d", &a, num, &b);
long shi = 0;
int i;
for(i = 0; num[i] != '\0'; i++)
{
if(num[i] >= '0' && num[i] <= '9')
{
shi = shi * a + num[i] - '0';
}
if(num[i] >= 'a' && num[i] <= 'z')
{
shi = shi * a + num[i] - 'a' + 10;
}
if(num[i] >= 'A' && num[i] <= 'Z')
{
shi = shi * a + num[i] - 'A' + 10;
}
}
for(i = 0; shi != 0; i++)
{
if((shi % b) <= 9)
{
t[i] = (shi % b) + '0';
}
else
{
t[i] = (shi % b) - 10 + 'A';
}
shi = shi / b;
}
int j;
for(j = i - 1; j >= 0; j--)
{
printf("%c", t[j]);
}
printf("\n");
return 0;
} | 55 |
27,061 |
int main()
{long int s,i,a,b,w[1000],q,aa,l;
char n[12000];
scanf("%d%s%d",&a,&n,&b);
l=strlen(n);
aa=1;s=0;
for (i=l-1;i>=0;i--)
{
if(n[i]>=48&&n[i]<=57)s=s+aa*(n[i]-48);
if(n[i]>='a'&&n[i]<='z')s=s+aa*(n[i]+10-'a');
if(n[i]>='A'&&n[i]<='Z')s=s+aa*(n[i]+10-'A');
aa=aa*a;
}q=0;
if (s==0)printf("0");
while(s>0)
{q=q+1;
w[q]=s%b;
s=s/b;
}
for(i=q;i>=1;i--)
{if(w[i]<10)printf("%d",w[i]);
else
printf("%c",'A'+w[i]-10);
}
}
| 55 |
27,062 | int main()
{
int a,b,sum=0,len,i,t,r;
char s[100];
scanf("%d %s %d", &a, s ,&b);
len=strlen(s);
for (i=0; i<len; i++)
{
if ( s[i]>='0' && s[i]<='9' ) t=s[i]-'0';
else if ( s[i]>='a' && s[i]<='z') t=s[i]-'a'+10;
else t=s[i]-'A'+10;
sum = sum*a+t;
}
i=0;
if (sum==0) printf("0\n");
else
{
while (sum!=0)
{
r=sum%b;
if (r<10) s[i]=r+'0';
else s[i]=r-10+'A';
sum/=b;
i++;
}
s[i]='\0';
i=strlen(s)-1;
while (s[i]=='0') i--;
for (; i>=0; i--)
printf("%c",s[i]);
printf("\n");
}
return 0;
}
| 55 |
27,063 | int main()
{
int a,b,i,j,wa,wb,t=1;
long dec=0,x,y;
char n[100],m[100];
scanf("%d%s%d",&a,n,&b);
wa=strlen(n);
for(i=0;i<=wa-1;i++)
if(n[i]!=48) {t=0; break;}
if(t==1) printf("0\n");
else
{for(i=0;i<=wa-1;i++)
{if(n[i]>=48&&n[i]<=57)
{x=n[i]-48;
for(j=1;j<=wa-i-1;j++)
x=x*a;
dec=dec+x;}
if(n[i]>=65&&n[i]<=90)
{x=n[i]-55;
for(j=1;j<=wa-i-1;j++)
x=x*a;
dec=dec+x;}
if(n[i]>=97&&n[i]<=122)
{x=n[i]-87;
for(j=1;j<=wa-i-1;j++)
x=x*a;
dec=dec+x;}
}
wb=(int)(log(dec)/log(b))+1;
for(i=0;i<=wb-1;i++)
{y=dec;
for(j=1;j<=wb-i-1;j++)
y=y/b;
y=y%b;
if(y>=0&&y<=9) m[i]=y+48;
else m[i]=y+55;}
for(i=0;i<=wb-1;i++)
printf("%c",m[i]);
printf("\n");}
return(0);
} | 55 |
27,064 | int convert_1(char a){
if (a >= '0' && a<= '9') return a - '0';
if (a >= 'a' && a<= 'z') return a - 'a' + 10;
if (a >= 'A' && a<= 'Z') return a - 'A' + 10;
}
char convert_2(int a){
if (a < 10) return a + '0';
else return a - 10 +'A';
}
void convert(int a,int n){
if (a >= n) convert(a / n,n);
printf("%c",convert_2(a % n));
}
int main(){
int a,n = 0,b,k = 1,i;
char str[500];
scanf("%d %s %d",&a,str,&b);
for(i = strlen(str) - 1;i >= 0;i --){
n += convert_1(str[i]) * k;
k *= a;
}
convert(n,b);
printf("\n");
return 0;
}
| 55 |
27,065 | int xToTen(int x, char c[])
{
int i, lenth, ten, num;
lenth = strlen(c);
for(i = 0, ten = 0; i < lenth; i++)
{
if(c[i] >= '0' && c[i] <= '9')
num = c[i] - '0';
if(c[i] >= 'A' && c[i] <= 'Z')
num = c[i] - 'A' + 10;
if(c[i] >= 'a' && c[i] <= 'z')
num = c[i] - 'a' + 10;
ten = ten * x + num;
}
return (ten);
}
void tenToYout(int ten, int y)
{
int a[100];
int i, lenth;
for(lenth = 0; ten >= y; lenth++)
{
a[lenth] = ten % y;
ten /= y;
}
a[lenth] = ten;
for(i = lenth; i >= 0; i--)
{
if(a[i] < 10)
cout << a[i];
else
cout << (char)(a[i] - 10 + 'A');
}
cout << endl;
}
int main()
{
char c[100];
int x, y;
cin >> x >> c >> y;
tenToYout (xToTen(x, c), y);
return 0;
}
| 55 |
27,066 | //**************************************************
//*????????.cpp *
//*?????? *
//*?????2011.10.14 *
//*??????????????? *
//**************************************************
int main()
{
char str[33]; long a=0,b=0; //?????str,?????????????????a,b, ???????????????
long i=0; //??????i,?????0?
long number=1,sum=0; //???????number???a??????1?????????????1????????sum,???????????????0?
cin>>a;
for(i=0;i<33;i++) // ??????
{
str[i]=getchar();
if((str[i]==' ')&&(i>0))
break;
}
i=i-1;
for(i;i>0;i--) //?a??????????
{
if((str[i]<58)&&(str[i]>47))
{
str[i]=str[i]-48;
}
else if((str[i]>64)&&(str[i]<91))
{
str[i]=str[i]-55;
}
else if(str[i]>96)
{
str[i]=str[i]-87;
}
sum=sum+str[i]*number;
number=number*a;
}
cin>>b;
long left_number=0; char d='A'; //???????left_number?????b?????????0?????d????????????????A?
long j=0,k=10; //??????j,k????????0?10?
int reserve[33]; //?????reserve??????????????????
do //???b????????
{
left_number=sum%b;
reserve[j]=left_number;
j++;
sum=sum/b;
}while(sum>0);
j=j-1;
for(j;j>=0;j--)
{
if(reserve[j]<=9)
{
cout<<reserve[j];
}
else
{
for(k=10;k<=36;k++)
{
if(reserve[j]==k)
{
cout<<d;
break;
}
d=d+1;
}
d='A';
}
}
return 0;
}
| 55 |
27,067 |
char Change(int x);
int change(char x);
int main()
{
int a,b,i,length,Length;
char num[30],NUM[100];
long number=0;
cin>>a>>num>>b;
for(i=0;i<30;i++)
{
if(num[i]!='\0') ;
else break;
}
length=i;
for(i=0;i<length;i++)
{
number+=change(num[length-i-1])*pow((double)a,(double)i);
}
for(i=0;i<100&&number>=b;i++)
{
NUM[i]=Change(number-(number/b)*b);
number=number/b;
}
Length=i+1;
NUM[i]=Change(number);
for(i=0;i<Length;i++)
{
cout<<NUM[Length-1-i];
}
return 0;
}
int change(char x)
{
if(x>=48&&x<=57) return(x-48);
if(x>=65&&x<=90) return(x-55);
if(x>=97&&x<=122) return(x-87);
}
char Change(int x)
{
if(x<=9) return(x+48);
if(x>=10) return(x+55);
}
| 55 |
27,068 | int main()
{
char c[1000];
int n,x=0,i;
int a,b;
scanf("%d%s%d",&a,c,&b);
n=strlen(c);
for(i=0;i<=n-1;i++)
{
if('A'<=c[i] && c[i]<='Z')
c[i]=c[i]-'A'+10;
else if('a'<=c[i]&&c[i]<='z')
c[i]=c[i]-'a'+10;
else if('0'<=c[i]&&c[i]<='9')
c[i]=c[i]-'0';
}
for(i=0;i<=n-1;i++)
{
x=x+c[i]*pow(a,n-i-1);
}
if(x==0)
printf("%d",x);
if(x!=0)
{
int y;int n[100],j;
y=x;
for(i=0;y!=0;i++)
{
n[i]=y%b;
y=y/b;
}
for(j=i-1;j>=0;j--)
{
if(0<=n[j] && n[j]<10)
printf("%d",n[j]);
else if(n[j]>=10)
{
n[j]=n[j]+'A'-10;
printf("%c",n[j]);
}
}
}
printf("\n");
getchar();
getchar();
}
| 55 |
27,069 | int main()
{
int a2i[128];
char i2a[]="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
char in[255],out[255]="0";
int i,from,to,len=0;
long num=0;
for(i='0';i<='9';i++)
a2i[i]=i-'0';
for(i='A';i<='Z';i++)
a2i[i]=i-'A'+10;
for(i='a';i<'z';i++)
a2i[i]=i-'a'+10;
scanf("%d%s%d",&from,in,&to);
for(i=0;in[i]!='\0';i++)
num=num*from+a2i[in[i]];
len=(num==0)?1:0;
while(num>0){
out[len++]=i2a[num%to];
num=num/to;
}
for(i=len-1;i>=0;i--)
printf("%c",out[i]);
printf("\n");
return 0;
}
| 55 |
27,070 |
long p(int r,int s);
int main()
{
char num[1000]={0},numx[1000]={0}; //?????????num????a???n?numx?????b???
int n[1000]={0},x[1000]; //n???num??????????
int a,b,j=0;
long c;
unsigned long N=0; //N?n??????
cin>>a;
getchar(); //?????
cin.getline(num,1001,' '); //??n??????????num?
cin>>b;
for (int i=0;i<strlen(num);i++) //?num??????????
{
if (num[i]>=65&&num[i]<91) //????????????????
n[i]=num[i]-65+10;
else if (num[i]>=97&&num[i]<123) //????????????????
n[i]=num[i]-97+10;
else n[i]=num[i]-'0'; //?????????????
N=N+n[i]*p(a,strlen(num)-i-1); //??N
}
c=N;
if (c==0) //?N?0???????
cout<<"0";
while (c!=0) //?unsigned long??N ???b????????????numx?
{
x[j]=c%b;
c=c/b;
j++;
}
for (int i=j-1;i>=0;i--) //?numx????
{
if (x[i]>=10) //??????10???????
numx[i]=x[i]+'A'-10;
else
numx[i]=x[i]+'0';
cout<<numx[i]; //??
}
return 0;
}
long p(int r,int s) //p?????????
{
long ans=1;
for (int k=0;k<s;k++)
ans=ans*r;
return (ans);
} | 55 |
27,071 | int main()
{
int a,b,m,i,k,j;
unsigned long long int sum;
char z1[200]={'\0'}, z2[200]={'\0'};
scanf("%d %s %d",&a,z1,&b);
k=strlen(z1);
for(sum=0,i=0;i<k;i++)
{
if(z1[i]>='0'&&z1[i]<='9')
{
m=z1[i]-'0';
}
else if(z1[i]>='a'&&z1[i]<='z')
{
m=z1[i]-'a'+10;
}
else
{
m=z1[i]-'A'+10;
}
sum=sum+((unsigned long long int)pow(1.0*a,1.0*(k-i-1)))*m;
}
for(i=0;sum>0;i++)
{
if(sum%b<=9)
{
z2[i]=sum%b+'0';
}
else
{
z2[i]=sum%b-10+'A';
}
sum=sum/b;
}
for(j=strlen(z2)-1;j>=0;j--)
{
printf("%c",z2[j]);
}
if(z1[0]=='0')
{
printf("0");
}
return 0;
} | 55 |
27,072 | int main()
{int a,b,i,j;
int ai[128]={0};
char ia[]="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
char s[100],s2[100]="0",c;
long n=0;
for(i='0';i<='9';i++)
ai[i]=i-'0';
for(i='A';i<='Z';i++)
ai[i]=i-'A'+10;
for(i='a';i<='z';i++)
ai[i]=i-'a'+10;
scanf("%d%s%d",&a,s,&b);
for(i=0;s[i]!='\0';i++)
n=a*n+ai[s[i]];
for(i=0;n!=0;i++)
{ s2[i]=ia[n%b];
n=n/b;
}
for(j=0;j<(i+1)/2;j++)
{c=s2[j];s2[j]=s2[i-1-j];s2[i-1-j]=c;}
puts(s2);
return 0;
} | 55 |
27,073 |
int main()
{
int zhuan(char);
int a,b,l,i,wei;
char n[100];
long shi;
scanf("%d%s%d",&a,n,&b);
l=strlen(n);
for(i=0,shi=0;i<=l-1;i++)
{
if(i<l-1)
shi=(shi+zhuan(n[i]))*a;
else
shi=shi+zhuan(n[i]);
}
for(i=0;;shi=shi/b,i++)
{
wei=shi%b;
if(wei>=10)
n[i]=wei-10+'A';
else
n[i]=wei+'0';
if(shi<b)
break;
}
for(i=i;i>=0;i--)
printf("%c",n[i]);
return 0;
}
int zhuan(char b)
{
int a;
if(b>='0'&&b<='9')
a=b-48;
if(b>='a'&&b<='z')
a=10+b-'a';
if(b>='A'&&b<='Z')
a=10+b-'A';
return a;
}
| 55 |
27,074 |
char n[10000000], result[10000000];
long int exchange = 0;
void change(int a, char t[], int b)
{
int len, i, j, k, temp, temp2, pow = 1;
len = strlen(t);
i = len - 1;
j = 0;
while (i >= 0)
{
if (t[i] >= 'A' && t[i] <= 'Z')
temp = 10 + t[i] - 'A';
else
{
if (t[i] >= 'a' && t[i] <= 'z')
temp = 10 + t[i] - 'a';
else
temp = t[i] - '0';
}
exchange = exchange + temp * pow;
pow = a * pow;
i--;
j++;
}
if (exchange == 0)
cout << 0;
else
{
j = 9999999;
while (exchange != 0)
{
temp2 = exchange % b;
if (temp2 >= 0 && temp2 <= 9)
result[j] = temp2 + 48;
else
result[j] = temp2 + 55;
exchange = exchange / b;
j--;
}
for (k = j + 1; k < 10000000; k++)
cout << result[k];
}
}
int main()
{
int a, b;
cin >> a;
cin >> n;
cin >> b;
change(a, n, b);
return 0;
} | 55 |
27,075 | int main()
{
char str[100], ch[100];
int i, l, j, k, jin1, jin2, r, sh;
int sum;
cin >> jin1;
cin >> str;
cin >> jin2;
sum = 0;
l = 0;
for(i = 0; i < 100; i++)
{
if(str[i] == '\0') break;
else l++;
}
for(i = 0; i < l; i++)
{
if(str[i] >= 'a' && str[i] <= 'z')
{
sum = sum * jin1 + (str[i] - 'a' + 10);
}
if(str[i] >= 'A' && str[i] <= 'Z')
{
sum = sum * jin1 + (str[i] - 'A' + 10);
}
if(str[i] >= '0' && str[i] <= '9')
{
sum = sum * jin1 + (str[i] - '0');
}
}
sh = sum;
k = 0;
if(sum == 0)
{
cout << '0' << endl;
}
for(i = 0; sh != 0; i++)
{
r = sh % jin2;
sh = sh / jin2;
if(r < 10)
{
ch[i] = r + '0';
}
else
{
ch[i] = r + 'A' - 10;
}
k++;
}
for(j = k - 1; j >= 0; j--)
{
cout << ch[j];
}
cout << endl;
return 0;
} | 55 |
27,076 | char x[N];
int Rtoten(int R,char shu[]){
int i,s=0;
int m=strlen(shu);
for(i=0;i<m;i++){
if(shu[i]>='A' && shu[i]<='Z' || shu[i]>='a'&&shu[i]<='z')
(shu[i]|=0x20)-=0x57;
if(shu[i]>='0'&&shu[i]<='9')
shu[i]=shu[i]-'0';
}
for(i=0;i<m;i++){
s=s*R+shu[i];
}
return s;
}
void shiR(int c,int R){
int i,m,temp;
for(i=0;c;i++){
if((x[i]=c%R+'0')>'9') x[i]+=7;
c=c/R;
}
x[i]='\0';
m=strlen(x);
for(i=0;i<m/2;i++){
temp=x[i];
x[i]=x[m-i-1];
x[m-i-1]=temp;
}
}
int main(void){
int a,b,i,c;
int count=0;
char shu[N];
cin>>a;
cin>>shu;
cin>>b;
for (i=0;i<strlen(shu);i++)
{
if (shu[i]=='0')
count++;
}
if (count==strlen(shu))
cout<<"0"<<endl;
else{
c=Rtoten(a,shu);
shiR(c,b);
int m=strlen(x);
for(i=0;i<m;i++)
{ cout<<x[i];}
cout<<endl;}
return 0;
}
| 55 |
27,077 | int main()
{
int a=0,b=0;//a,b???????
char m[32];//m?????b???
char n[32];//n????a???
int i=1;//i?????
long sum=0;//sum?????????
cin>>a;
n[0]=getchar();//????????
while((n[i]=getchar())!=' ')
{
if(n[i]>47&&n[i]<58)//????ASCII??????
n[i]-=48;
else if(n[i]>64&&n[i]<91)
n[i]-=55;
else if(n[i]>96&&n[i]<123)
n[i]-=87;
sum=a*sum+n[i];//?a??????????
i++;
}
cin>>b;
i=0;
do
{
m[i]=sum%b;
if(m[i]>=0&&m[i]<=9)
m[i]+=48;
else if(m[i]>9&&m[i]<36)
m[i]+=55;
sum=sum/b;
i++;
}while(sum!=0);
for(int j=i-1;j>=0;j--)
cout<<m[j];
return 0;
}
| 55 |
27,078 | main()
{
long int n0[31], t, m0[31], s[31]={0};
//sum????10?????? t???????10????????????sum; s??????????m????
int sum=0, a, b, l, i, j;
char n[31]={'\0'}, m[31]={'\0'};
scanf("%d %s %d", &a, n, &b);
for(i=0; n[i]!='\0'; i++)
{
if(n[i]>=65&&n[i]<=90)
n0[i]=n[i]-55;
else if(n[i]>=97&&n[i]<=122)//????else if???
n0[i]=n[i]-87;
else
n0[i]=n[i]-48;
}
l=strlen(n);
for(i=0; i<l; i++)
{
t=(int)(n0[i]*pow(a, l-i-1));
sum=sum+t;
}
i=0;
do
{
s[i]=sum%b;
sum=(sum-s[i])/b;
i++;
}while(sum!=0);
for(j=0; j<i; j++)
{
m0[j]=s[i-1-j];
if(m0[j]>=10)
m[j]=m0[j]+55;
else
m[j]=m0[j]+48;
}
puts(m);
return 0;
}
| 55 |
27,079 | //????
int ji(int a,int b);
int main()
{
int jinzhi1=0; //????1
int jinzhi2=0; //????2
int p=0; //????
int i=0; //???
int j=0; //?????
char n[100]; //?????????
char m[100]; //?????????
long s=0; //?????????
cin>>jinzhi1>>n>>jinzhi2;
p=strlen(n);
//???????????
while(i<p)
{
(int) n[i];
if(n[i]>96) //??????????,???s?????
{
s=s+(n[i]-87)*ji(jinzhi1,(p-i-1));
}
else
{
if(n[i]>64)
{
s=s+(n[i]-55)*ji(jinzhi1,(p-i-1));
}
else
{
s=s+(n[i]-'0')*ji(jinzhi1,(p-i-1));
}
}
i=i+1;
}
i=0;//?????
if(s==0)
{
cout<<0<<endl;
}
else
{
while(s!=0) //????
{
m[i]=s%jinzhi2;
s=(s-m[i])/jinzhi2;
i+=1;
}
for(j=0;j<i;j++) //?????????????
{
if(m[i-1-j]>9)
{
m[i-1-j]=m[i-1-j]+55;
cout<<m[i-1-j];
}
else
{
m[i-1-j]=m[i-1-j]+48;
cout<<m[i-1-j];
}
}
}
return 0;
}
int ji(int a,int b) //????????
{
int i=0;
int ji=1;
for(i=0;i<b;i++)
{
ji=ji*a;
}
return ji;
} | 55 |
27,080 | /*
* ????.cpp
* ???????????????????2???36???
* ????: 2010-11-9
* ??: ??
*/
//?????
//???
int main() {
//??a, n, b???????
char n[101];
int a, b, length, i, j, temp; //length????????temp???
long int value = 0, product; //value???????product??????
cin >> a >> n >> b;
//?a???n???????????value
length = strlen(n);
for (i = 0; i < length; i++) {
product = 1;
//?n[i]?????A-Z????????10-35
if (n[i] >= 65 && n[i] <= 90) {
temp = n[i] - 55;
}
//?n[i]?????????????10-35
else if (n[i] >= 97 && n[i] <= 122) {
temp = n[i] - 87;
}
//?n[i]?'0'-'9'????????0-9
else {
temp = n[i] - 48;
}
//???????value
for (j = 0; j < length - i - 1; j++) {
product *= a;
}
value += temp * product;
}
//?value???b???????????
if (value == 0) {
//??n=0????0?????
cout << "0" << endl;
return 0;
} else {
//?n??0???value??b?????????????m?
char m[101];
for (i = 0;; i++) {
temp = value % b;
if (value == 0) {
break;
} else if (temp >= 0 && temp <= 9) {
m[i] = temp + 48;
} else {
m[i] = temp + 55;
}
value /= b;
}
//?m????????
length = i;
for (i = length - 1; i >= 0; i--) {
cout << m[i];
}
}
return 0; //????
}
| 55 |
27,081 | int main()
{
char a[100],b[100];
char h;
long s=0,p;
int i,t,m,n,j,q;
scanf("%d%s%d",&m,a,&n);
t=strlen(a);
for(i=0;i<t;i++)
{
if(a[i]>='A'&&a[i]<='Z')
{
s=s*m+a[i]-55;
}
else if(a[i]>='0'&&a[i]<='9')
s=s*m+a[i]-48;
else
s=s*m+a[i]-87;
}
p=s;
for(i=0;;i++)
{
q=p%n;
if(q>=10)
b[i]=55+q;
else
b[i]=48+q;
for(j=i;j>0;j--)
{
h=b[j];
b[j]=b[j-1];
b[j-1]=h;
}
p=p/n;
if(p==0)
break;
}
b[i+1]='\0';
printf("%s",b);
return 0;
}
| 55 |
27,082 | void main()
{
char n[20],tab[100];
int a,b,nlen,k,z[10];
long d=0,i;
scanf("%d%s%d",&a,n,&b);
nlen=strlen(n);
for(i=0;i<nlen;i++)
{
if(n[i]>='0'&&n[i]<='9')
z[i]=n[i]-48;
else
if(n[i]>='a'&&n[i]<='z')
z[i]=n[i]-87;
else
if(n[i]>='A'&&n[i]<='Z')
z[i]=n[i]-55;
}
for(i=0;i<nlen;i++)
{
k=pow(a,nlen-i-1);
d=d+z[i]*k;
}
if(d==0)
printf("0");
else
{
for(i=0;i<36;i++)
{
if(d%b<=9)
tab[i]=d%b;
switch(d%b)
{
case 10:tab[i]='A';break;
case 11:tab[i]='B';break;
case 12:tab[i]='C';break;
case 13:tab[i]='D';break;
case 14:tab[i]='E';break;
case 15:tab[i]='F';break;
case 16:tab[i]='G';break;
case 17:tab[i]='H';break;
case 18:tab[i]='I';break;
case 19:tab[i]='J';break;
case 20:tab[i]='K';break;
case 21:tab[i]='L';break;
case 22:tab[i]='M';break;
case 23:tab[i]='N';break;
case 24:tab[i]='O';break;
case 25:tab[i]='P';break;
case 26:tab[i]='Q';break;
case 27:tab[i]='R';break;
case 28:tab[i]='S';break;
case 29:tab[i]='T';break;
case 30:tab[i]='U';break;
case 31:tab[i]='V';break;
case 32:tab[i]='W';break;
case 33:tab[i]='X';break;
case 34:tab[i]='Y';break;
case 35:tab[i]='Z';break;
}
d/=b;
}
for(i=35;i>=0;i--)
if(tab[i]!=0)
break;
for(;i>=0;i--)
{
if(tab[i]>9)
printf("%c",tab[i]);
else
printf("%d",tab[i]);
}
}
}
| 55 |
27,083 | int main()
{
int a=0, b=0, i=0, k=0, l=0;//a, b ???,k ???????.l????
char n_b[30]={0}, n[30]={0};//???????n. n_b[30]??????
unsigned long n_10=0;//?????n[30]???
cin>>a>>n>>b;
l= strlen(n);//???
i=l;//???????????
for (k=0; k<l; k++)//????????????????
{
if ( n[k]>=48 && n[k]<=57 && i >= 1)//??0-9????n[k]-48
{
n_10 = n_10 + pow ((double)a, (double)(i-1))*(n[k]-48);
}
else if ( n[k]>=65 && n[k]<=90 && i >= 1)//??A-Z??n[k]-55
{
n_10 = n_10 + pow ((double)a, (double)(i-1))*(n[k]-55);
}
else if ( n[k]>=97 && n[k]<=122 && i >= 1)//??a-z??n[k]-87
{
n_10 = n_10 + pow ((double)a, (double)(i-1))*(n[k]-87);
}
else
break;
i--;
}
if ( n_10==0 )//??????
cout<<0;
for ( k=0;; k++)//???????b???????????
{
if ( n_10 != 0)
{
if ( n_10 % b >= 0 && n_10 % b <=9)//??
{
n_b[k]=n_10 % b + 48;
}
else if ( n_10 % b >= 10 && n_10 % b <=35)
{
n_b[k]=n_10 % b + 55;
}
n_10 = n_10 / b;//??
}
else
break;
}
for ( i=k-1; i>=0; i--)//????
{
cout<<n_b[i];
}
cout<<endl;
return 0;
} | 55 |
27,084 |
int main(){
int n,m,i,j,k,l;
char as[30],ds[30],cs[30];
long bs;
scanf("%d%s%d",&n,as,&m);
j=1;
l=strlen(as);
bs=0;
for(i=l-1;i>=0;i--)
{
if(as[i]>='A'&&as[i]<='Z')
k=as[i]+10-'A';
else if(as[i]>='a'&&as[i]<='z')
k=as[i]+10-'a';
else if(as[i]>='0'&&as[i]<='9')
k=as[i]-'0';
bs+=j*k;
j*=n;
}
for(i=0;bs>0;i++)
{
ds[i]=bs%m;
bs/=m;
}
for(j=0;j<i;j++)
{
cs[j]=ds[i-j-1];
if(cs[j]>=0&&cs[j]<10)
cs[j]+='0';
else if(cs[j]>=10)
cs[j]=cs[j]-10+'A';
}
cs[i]=0;
if(cs[0]==0)
{
cs[0]='0';
cs[1]=0;
}
printf("%s",cs);
return 0;
}
| 55 |
27,085 | void shuchu(int c[], int i)
{
int j;
for(j = i - 1 ; j >= 0 ; j--)
{
if(c[j] >= 0 && c[j] <= 9)
{
cout << c[j];
}
if(c[j] >= 10)
{
cout << (char)(c[j] + 55);
}
}
cout << endl;
}
int main()
{
char str1[10000], str2[10000], l;
int i, j, num[10000] = {0}, sum = 0, c[10000] = {0}, nlen, k;
double before , after;
memset(str1, ' ', sizeof(str1));
memset(str2, ' ', sizeof(str2));
cin >> before;
cin >> str1;
cin >> after;
nlen = strlen(str1);
for(i = 0 ; i < nlen ; i++)
{
if(str1[i] >= 97 && str1[i] < 122)
{
str1[i] = (char)toupper(str1[i]);
}
if(str1[i] >= 65 && str1[i] <= 90)
{
num[i] = str1[i] - '7';
}
else
num[i] = str1[i] - '0';
}
k = nlen - 1;
for(i = 0 ; i < nlen ; i++)
{
sum = sum + num[i] * pow(before, k);
k--;
}
i = 0;
do
{
c[i] = sum % (int)after;
sum = sum / after;
i++;
}while(sum > 0);
shuchu(c, i);
return 0;
}
| 55 |
27,086 | int zheng (char x);
char fan(int x);
int main()
{
int n,m,f,sum=0,wei=0,i;
char zhuan[50];
scanf("%d",&n);
char x[10];
scanf("%s",x);
scanf("%d",&m);
f=strlen(x);
for(i=0;i<f;i++)
{
sum+=zheng(x[i])*pow(n,f-i-1);
}
for(i=49;i>=0;i--)
{
zhuan[i]=fan(sum%m);
wei++;
sum=sum/m;
if(sum==0)
break;
}
for(i=50-wei;i<50;i++)
{
printf("%c",zhuan[i]);
}
return 0;
}
int zheng(char x)
{
int m;
if(x>='a'&&x<='z')
m=x-87;
else if(x>='A'&&x<='Z')
m=x-55;
else
m=x-48;
return m;
}
char fan(int x)
{
char m;
if(x>=0&&x<=9)
m=x+48;
else if(x>=10&&x<=35)
m=x+55;
return m;
} | 55 |
27,087 | main()
{
int a,c,d,e,f,l,x,i;
char b[40000];
scanf("%d %s %d",&a,b,&c);
l=strlen(b);
if(b[0]=='0')
printf("0\n");
else
{
for(d=0;d<l;d++)
{
if(b[d]>='A' && b[d]<='Z')
b[d]=b[d]-'A'+'a';
}
x=0;
for(e=0;e<l;e++)
{
if(b[e]>='a')
f=b[e]-'a'+10;
else
f=b[e]-'0';
x=f+x*a;
}
int g[40000];
for(e=0;x!=0;e++)
{
g[e]=x%c;
x=x/c;
}
char h[40000];
for(i=0;i<e;i++)
{
if(g[i]<10)
h[e-i-1]=g[i]+'0';
else
h[e-i-1]=g[i]+'A'-10;
}
h[e]='\0';
printf("%s",h);
}
getchar();
getchar();
}
| 55 |
27,088 | main()
{
char c[40];
int a,b,x,i,l,k;
scanf("%d %s %d",&a,c,&b);
l=strlen(c);
if (c[0]=='0')
printf("0\n");
else
{
for (i=0;i<l;i++)
{
if (c[i]>='A'&&c[i]<='Z')
c[i]=c[i]-'A'+'a';
}
x=0;
int d;
for(i=0;i<l;i++)
{
if (c[i]>='a')
d=c[i]-'a'+10;
else
d=c[i]-'0';
x=d+x*a;
}
char e[40];
for(k=0;x!=0;k++)
{
e[k]=x%b;
x=x/b;
}
e[k]='\0';
char f[40];
for(i=0;i<k;i++)
{
if (e[i]<10)
f[k-1-i]=e[i]+'0';
else
f[k-1-i]=e[i]+'A'-10;
}
f[k]='\0';
printf("%s",f);
}
getchar();
getchar();
} | 55 |
27,089 | int v(int y,int z)
{
int k=1,j;
for(j=0;j<z;j++)
k=k*y;
return(k);
}
void main()
{
int n,m,i,k,l;
char a[100],b[200];
long x=0;
scanf("%d %s %d",&n,a,&m);
l=strlen(a);
for(i=l-1;i>=0;i--)
{
if(a[i]>='0'&&a[i]<='9')
x=x+(a[i]-'0')*v(n,l-1-i);
else x=x+((a[i]-'A')%('a'-'A')+10)*v(n,l-1-i);
}
for(i=0;;i++)
{
if(x%m>=0&&x%m<=9)
b[i]=x%m+'0';
else
b[i]=x%m-10+'A';
x=(x-x%m)/m;
if(x==0)
break;
}
for(k=i;k>=0;k--)
printf("%c",b[k]);
} | 55 |
27,090 |
int main() {
int a;
char n[200];
int b;
cin >> a >> n >> b;
int v = 0;
int i = 0;
for (i = 0; n[i]; i ++) {
v *= a;
n[i] = tolower(n[i]);
if (n[i] >= '0' && n[i] <= '9') {
v += n[i] - '0';
}
else if (n[i] >= 'A' && n[i] <= 'Z') {
v += 10 + n[i] - 'A';
}
else if (n[i] >= 'a' && n[i] <= 'z') {
v += 10 + n[i] - 'a';
}
}
if (v == 0)
cout << 0 << endl;
else {
char r[200];
i = 0;
while (v != 0) {
if (v % b < 10)
r[i ++] = v % b + '0';
else
r[i ++] = v % b + 'A' - 10;
v /= b;
}
while (i > 0) {
cout << r[-- i];
}
cout << endl;
}
return 0;
}
| 55 |
27,091 | int main(){
int a,b,x=0,i,l;
char s[50];
cin>>a>>s>>b;
for (i=0;s[i]!=0;i++)
if(s[i]<='9') x=x*a+s[i]-48;
else if(s[i]<='Z') x=x*a+s[i]-55;
else x=x*a+s[i]-87;
for (l=0;x!=0;l++){
i=x%b;
if(i<10) s[l]=i+48;
else s[l]=i+55;
x/=b;
}
for (i=l-1;i>=0;i--) cout<<s[i];
if(l==0) cout<<0;
return 0;
} | 55 |
27,092 | int main() {
int a, b, ten = 0;
char num[1000];
char num1[1000];
cin >> a >> num >> b;
for ( int i = 0; i < strlen(num); i ++ ) {//??????????????
if ( num[i] >= (int)'A' && num[i] <= (int)'Z')
num[i] += 32;
}
for ( int i = 0; i < strlen(num); i ++ ) { //????????????
if ( num[i] >= (int)'a' && num[i] <= (int)'z')
ten += ( (int)num[i] - 87 ) * pow( (double)a , (double)strlen(num) - 1 - i) ;
else if ( num[i] >= (int)'1' && num[i] <= (int)'9')
ten += ( (int)num[i] - 48 ) * pow( (double)a , (double)strlen(num) - 1 - i) ;
}
if ( ten == 0 ) cout << 0; //????? ??0
else {
int j = 0;
for ( ; ; ){ //?????????b???
if ( ten == 0 ) break;
if ( ten % b < 10 ) num1[j] = (char)(ten % b + 48);
else num1[j] = (char)(ten % b + 55 );
ten = ten / b;
j ++;
}
for ( int i = j - 1; i >= 0; i -- ) {
cout << num1[i]; //??
}
}
return 0;
}
| 55 |
27,093 | int main()
{
int a,b,n,c=0,d,j,i=0,m,s[100];
char num1[100]={0},num2[100]={0};
scanf("%d",&a);
scanf("%s",num1);
scanf("%d",&b);
n=strlen(num1);
for(i=0;i<n;i++)
{
if(num1[i]>='a'&&num1[i]<='z')
{
num1[i]=num1[i]-32;
}
}
for(i=0;i<n;i++)
{
d=1;
if(num1[i]>='0' &&num1[i]<='9')
{
for(j=1;j<n-i;j++)
{
d=d*a;
}
c=c+(num1[i]-'0')*d;
}
else if(num1[i]>='A'&&num1[i]<='Z')
{
for(j=1;j<n-i;j++)
{
d=d*a;
}
c=c+(num1[i]-'A'+10)*d;
}
}
m=0;
if(c!=0){
while(c!=0)
{
s[m]=c%b;
c=(c-s[m])/b;
m++;
}
for(i=0;i<m;i++)
{
if(s[i]>=0&&s[i]<=9)
{
num2[m-i-1]=s[i]+'0';
}
else
{
num2[m-i-1]=s[i]-10+'A';
}
}
for(i=0;i<m;i++)
{
printf("%c",num2[i]);
}
printf("\n");
}
else if(c==0)
{
printf("%d\n",c);
}
return 0;
} | 55 |
27,094 |
int main()
{
char k[33],l[33];
long j[33];
int a,b,d,i,s,n=0;
i=0;
s=1;
n=0;
scanf("%d%s%d",&a,k,&b);
d=strlen(k);
while(i<=d-1)
{s=pow(a,d-i-1);
if(k[i]>='A'&&k[i]<='Z')
n=n+(k[i]-'A'+10)*s;
else if(k[i]>='a'&&k[i]<='z')
n=n+(k[i]-'a'+10)*s;
else
n=n+(k[i]-48)*s;
i++;
s=1;
}
j[0]=n;
if(n==0)
{
printf("0");
return 0;
}
for(i=0;i<=33;i++)
l[i]=0;
for(i=0;j[i]!=0;i++)
{ l[i]=j[i]%b+1;
j[i+1]=(j[i]-l[i]+1)/b;
}
d=strlen(l);
for(i=0;i<=d-1;i++)
{if(l[d-1-i]>=11)
{k[i]=l[d-1-i]+54;
}
else
k[i]=l[d-1-i]+47;
printf("%c",k[i]);}
return 0;
} | 55 |
27,095 | int main()
{
int a,b,x,n,i,j = 0,k,h,m,num1 = 0;
char str[100],num[100];
cin >> a >> str >> b;
n = strlen(str);
for(i = 0; i < n; i++)
{
int y = 1;
for(m = 0; m < n - 1 - i;m++)
{
y = y * a;
}
if(str[i] <= 57)
num1 = num1 + (str[i] - 48) * y;
if((str[i] >= 65)&&(str[i] < 97))
num1 = num1 + (str[i] - 55) * y;
if(str[i] >= 97)
num1 = num1 + (str[i] - 87) * y;
}
x = num1;
do
{
num1 = num1 / b;
j++;
}while(num1 > 0);
for(k = 0 ; k < j; k++)
{
if(x % b < 10)
num[j - 1 - k] = x % b + 48;
if(x % b >= 10)
num[j - 1 - k] = x % b + 55;
x = x / b;
}
for(h = 0; h < j ; h++)
cout << num[h];
return 0;
} | 55 |
27,096 |
int trans(char a) //???????????????10??????a????????????
{
int m; //m???10??????
if (a >= '0' && a <= '9') //a???
m = a - '0';
else if (a >= 'a' && a <= 'z') //a?????
m = a - 'a' + 10;
else
m = a - 'A' + 10; //a?????
return m; //????????????
}
void change(int a, char n[], int b) //a?n?b???????????????????????????????
{
int m = 0, i, j = 1, d, k, num[100]; //m?????????????i?j???d????k??????????????num????10??????????????
for (i = 0; n[i] != ' '; i++) //???????????????10??????????????????
{
num[i] = trans(n[i]); //????????????????????????10??
}
k = i; //??????????
char c[100]; //c???????????
for (i = k - 1; i >= 0; i--) //?????????????j???????????????123=3*1+2*10+1*100?
{
m = m + num[i] * j;
j = j * a;
}
if (m == 0) //??????0?????0
cout << "0";
else
{
i = 0;
while (m > 0)
{
d = m % b; //???
m = m / b; //??
if (d >= 10) //??????10????c
{
c[i] = 'A' + d - 10;
}
else //??????10?????c
c[i] = d + '0';
i++; //????????????
}
for (i--; i >= 0; i--) //??
{
cout << c[i];
}
}
}
int main() //???
{
char n[100]; //n??????
int a, b, i, num[100]; //a???????b????????i?????num?????????????????????????
cin >> a;
cin.get(); //??a???????
for (i = 0; (n[i] = cin.get()) != ' ';) //???????????
i++;
cin >> b;
change(a, n, b); //??????????????10???????????????????
return 0;
}
| 55 |
27,097 | int main()
{
int a,b;
char num1[32];
int num2[32]={0};
long num;
int i,lenth;
scanf("%d %s %d",&a,num1,&b);
for(lenth=0;num1[lenth]!='\0';lenth++)
{
if(num1[lenth]<='9')num1[lenth]-='0';
else num1[lenth]-='A'-10;
if(num1[lenth]>=35)num1[lenth]-=32;
}
for(i=1,num=num1[0];i<lenth;i++)
num=num*a+num1[i];
for(i=31;num>=b;i--)
{
num2[i]=num%b+1;
num/=b;
}
num2[i]=num+1;
for(i=0;i<32;i++)
{
if(num2[i]==0)continue;
else if(num2[i]<10)printf("%d",num2[i]-1);
else printf("%c",num2[i]+'A'-11);
}
return 1;
}
| 55 |
27,098 | /*
* 1000012761_306.cpp
*?????????????????2???36?????????long??????????
???????????0?1?...?9?a?b?...?z????0?1?...?9?A?B?...?Z??
* Created on: 2010-11-12
* Author: 378073652
*/
int main(){
int a,sn,b,j,k,q,l,t,i;//??????
double m;
int s=0;
char n[100],p[100];//????????
cin>>a;//
cin>>n;
cin>>b;
sn=strlen(n);
for(i=0;i<sn;i++)
{if(n[i]>=97) n[i]=n[i]-32;}
for(i=sn-1;i>=0;i--) //????10??
{
if(n[i]<=57) {j=n[i]-48;t=sn-1-i;
s=s+(j*pow((double)a,(double)(t))); }
else {j=n[i]-55; m=pow((double)a,(double)(sn-1-i)); s=s+j*m;}//s?10??? ????
}
if(s==0){ cout<<s; return 0;}//??s?0 ??0
for(i=0;s!=0;i++)//?? ?????b??
{q=s%b;
if(q<=9) p[i]=(48+q);
else p[i]=(55+q);
s=(s-q)/b;
}
p[i]='\0';
l=strlen(p);
for(i=l-1;i>=0;i--)//??
cout<<p[i];
}
| 55 |
27,099 | int ten(int m)
{ int z;
if(48<=m&&m<=57)
z=m-48;
else if(65<=m&&m<=90)
z=m-55;
else if(97<=m&&m<=122)
z=m-87;
return (z);
}
char letter(int p)
{ int k;
if(0<=p&&p<=9)
k=p+48;
else if(10<=p&&p<=26)
k=p+55;
return (k);
}
int main()
{
long int a1,b1,a[1001],b[1001],tensum=0,n,i;
long a1_;
cin>>a1;
a1_=a1;
getchar();
for(i=1;i<=1000;i++)
{
a[i]=getchar();
if(a[i]==32)
break;
}
n=i-1;
cin >>b1;
tensum=ten(a[n]);
for(i=n-1;i>0;i--)
{tensum=a1_*ten(a[i])+tensum;
a1_=a1_*a1;
}
i=1;
do
{
b[i]=tensum%b1;
tensum=tensum/b1;
i++;}
while(tensum>0);
for(i=i-1;i>0;i--)
putchar(letter(b[i]));
return 0;
}
| 55 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.