label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
55 | 27400 |
int main(){
int a,b,i,zhen,chu,result;
long x=0;
char n[32],m[32];
scanf("%d%s%d",&a,n,&b);
result=strlen(n);
for(i=0;i<result;i++){
switch(n[i]){
case '0':zhen=0;break;
case '1':zhen=1;break;
case '2':zhen=2;break;
case '3':zhen=3;break;
case '4':zhen=4;break;
case '5':zhen=5;break;
case '6':zhen=6;break;
case '7':zhen=7;break;
case '8':zhen=8;break;
case '9':zhen=9;break;
case 'a':
case 'A':
zhen=10;
break;
case 'b':
case 'B':
zhen=11;
break;
case 'c':
case 'C':
zhen=12;
break;
case 'd':
case 'D':
zhen=13;
break;
case 'e':
case 'E':
zhen=14;
break;
case 'f':
case 'F':
zhen=15;
break;
}
x+=zhen*pow(a,result-1-i);
}
for(i=0;x>0;i++){
chu=x%b;
x=x/b;
switch(chu){
case 0:m[i]='0';break;
case 1:m[i]='1';break;
case 2:m[i]='2';break;
case 3:m[i]='3';break;
case 4:m[i]='4';break;
case 5:m[i]='5';break;
case 6:m[i]='6';break;
case 7:m[i]='7';break;
case 8:m[i]='8';break;
case 9:m[i]='9';break;
case 10:m[i]='A';break;
case 11:m[i]='B';break;
case 12:m[i]='C';break;
case 13:m[i]='D';break;
case 14:m[i]='E';break;
case 15:m[i]='F';break;
}
}
i=i-1;
for(;i>=0;i--){
printf("%c",m[i]);
}
printf("\n");
return 0;
}
|
55 | 27401 | int change1(char a,int b,int c)
{
int d;
if(a>='0'&&a<='9') a=a-'0';
else if(a>='a'&&a<='z') a=a-'a'+10;
else if(a>='A'&&a<='Z') a=a-'A'+10;
d=a*pow(c,b);
return d;
};
char change2(char a)
{
if(a>=0&&a<=9) a=a+'0';
else if(a>=10) a=a+'A'-10;
return a;
}
int main()
{
int a,b,c,d,e,f,g,sum=0;
char s[30],s2[30],s3[30];
scanf("%d %s %d",&a,s,&b);
c=strlen(s);
for(d=0;d<c;d++)
{
sum+=change1(s[c-d-1],d,a);
}
if(sum==0)
{
printf("0");
return 0;
}
for(e=0;;e++)
{
s2[e]=sum%b;
sum=sum/b;
if(sum<b)
{
s2[e+1]=sum;
break;
}
}
for(f=0;f<30;f++)
{
s2[f]=change2(s2[f]);
}
for(g=e+1;g>=0;g--)
{
printf("%c",s2[g]);
}
}
|
55 | 27402 |
int main()
{
int a,b,n,i,sum=0,t,r;
char str1[255],str2[255];
scanf("%d %s %d",&a,str1,&b);
n=strlen(str1);
for(i=0;i<n;i++){
if(str1[i]>='0'&&str1[i]<='9')
t=str1[i]-'0';
else if(str1[i]>='A'&&str1[i]<='Z')
t=str1[i]-'A'+10;
else if(str1[i]>='a'&&str1[i]<='z')
t=str1[i]-'a'+10;
sum=sum*a+t;
}
i=0;
if (sum==0) printf("0\n");
else
{
while (sum!=0)
while(sum!=0){
r=sum%b;
if(r<10)
str2[i]=r+'0';
else if(r>=10)
str2[i]=r-10+'A';
sum=sum/b;
i++;
}
str2[i]='\0';
i=strlen(str2)-1;
while(str2[i]=='0')
i--;
for(;i>=0;i--)
{
printf("%c",str2[i]);
}
printf("\n");
}
return 0;
}
|
55 | 27403 |
int main()
{ char c[1][33],e[1][33]={1};int i=0, j=0,t=0;
long f,k,m=1,a,b;
long s=0;int d[1000];
cin>>a;
cin>>c[0]; cin>>b;
if(c[0][0]==48){cout<<s;}
else{
while(c[0][i]!='\0'){i++;}
i=i-1;
for(j=0;j<=i;j++){if(i>j){for(f=0;f<i-j;f++)m=m*a;}
if(c[0][j]<65) k=(c[0][j]-48)*m;
if(c[0][j]>=65&&c[0][j]<97)k=(c[0][j]-55)*m;
if(c[0][j]>=97)k=(c[0][j]-87)*m;
s=s+k;m=1;}
while(s>0){d[t]=s%b;if(d[t]>9)e[0][t]=d[t]+55;
s/=b;t++;}
for(j=t-1;j>=0;j--){if(e[0][j]!='\0'&&e[0][j]!=1)cout<<e[0][j];
else cout<<d[j]; }
}
return 0;} |
55 | 27404 | int main()
{
int a2i[128]={0};
char i2a[]="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
char in[MAX],out[MAX]="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/=to;
}
for(i=len-1;i>=0;i--)
{
printf("%c",out[i]);
}
printf("\n");
return 0;
}
|
55 | 27405 |
main(){
char str[10000], m[10000];
long a, b, i, j, n[10000], sum=0;
scanf("%d %s %d", &a, str, &b);
for(i=0; i<strlen(str); i++){
if(str[i]<='z' && str[i]>='a') str[i]-=32;
else str[i]+=0;
}
for(i=0; i<strlen(str); i++){
if('0'<=str[i] && str[i]<='9') str[i]-=48;
else str[i]-=55;
n[i]=str[i];
}
for(i=0; i<strlen(str); i++) sum+=n[i]*pow(a, strlen(str)-i-1);
for(i=0; ;i++){
n[i]=sum%b;
sum/=b;
if(sum==0) break;
else continue;
}
for(j=0; j<=i; j++){
if(n[j]<10) m[j]=n[j]+48;
else m[j]=n[j]+55;
}
for(j=i; j>=0; j--) printf("%c", m[j]);
} |
55 | 27406 | int main()
{
int a,b,c,d,e,f,g,h,i,j,k;
long int n;
char str1[40],str2[40];
scanf("%d %s %d",&a,str1,&b);
c=strlen(str1);
n=0;
for(i=c-1,j=0;i>=0,j<=c-1;i--,j++)
{
if(str1[j]>='0'&&str1[j]<='9')
d=str1[j]-48;
else
{
if(str1[j]>='A'&&str1[j]<='Z')
d=str1[j]-55;
else
d=str1[j]-87;
}
e=1;
if(i>0)
{
for(k=i;k>0;k--)
e=e*a;
}
n=n+d*e;
}
for(k=0;k<=40;k++)
{if(n<b)
{f=n;
if(f>=0&&f<=9)
str2[k]=f+48;
else
str2[k]=f+55;
break;}
else
{f=n%b;
if(f>=0&&f<=9)
str2[k]=f+48;
else
str2[k]=f+55;}
n=(n-f)/b;
}
g=strlen(str2);
for(h=g-1;h>=0;h--)
printf("%c",str2[h]);
}
|
55 | 27407 | 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 | 27408 |
int main()
{
int a,b,i,k=0,l;
char n[31],s[31];
cin>>a>>n>>b;
l=strlen(n);
for (i=0;i<l;i++)
{
if (n[i]<58) n[i]-=48;
else if (n[i]>96) n[i]-=87;
else n[i]-=55;
k=k*a+n[i];
}
i=0;
if (k==0) cout<<k;
while(k)
{
s[i]=k%b+48;
if (s[i]>57) s[i]+=7;
k/=b;
i++;
}
for (;i>0;i--) cout<<s[i-1];
return 0;
} |
55 | 27409 | int main()
{
int a,b,i=0,c=0,d,j=0,e,f,k,x;
char n[65],m[65]={0};
scanf("%d %s %d",&a,n,&b);
d=strlen(n);
while(n[i]!='\0')
{
if(n[i]>='a'&&n[i]<='z')
n[i]=n[i]-'a'+10;
else if(n[i]>='A'&&n[i]<='Z')
n[i]=n[i]-'A'+10;
else n[i]=n[i]-'0'+0;
i++;
}
i=0;
c=n[0];
for(i=0;i<d-1;i++)
c=c*a+n[i+1];
while(c>=b)
{
m[j]=c%b;
c=c/b;
j++;
}
m[j]=c;
for(k=0;k<=j;k++)
{
if(m[k]>9) m[k]=m[k]-10+'A';
else if(m[k]>=0)m[k]=m[k]-0+'0';
}
e=strlen(m);
f=e/2;
for(k=0;k<=f-1;k++)
{
x=m[e-k-1];
m[e-k-1]=m[k];
m[k]=x;
}
printf("%s",m);
}
|
55 | 27410 | /*
* 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 | 27411 | void main()
{
int a,b;
long n=0;
char na[40],nb[40];
scanf("%d%s%d",&a,na,&b);
int la;
la=strlen(na);
int i,j,s,y;
for(i=0;i<la;i++)
if(na[i]-'0'<10) n=a*n+na[i]-'0';
else if((na[i]-'A'>=0)&&(na[i]-'A'<26)) n=a*n+na[i]-'A'+10;
else n=a*n+na[i]-'a'+10;
s=n;
if(s==0) i=1;
else
{for(i=1;s>0;i++)
s=s/b;
i--;}
for(j=1;j<=i;j++)
{
y=n%b;
n=n/b;
if(y<10) nb[i-j]=y+'0';
else nb[i-j]=y-10+'A';}
nb[i]=0;
puts(nb);
} |
55 | 27412 | void main(void)
{
int a, b, c, i, z;
long x = 0;
char n[65], p[65];
scanf("%d%s%d", &a, n, &b);
c = strlen(n);
for(i = 0;i <= (c - 1);i++)
{
if(n[i] <= 'Z'&&n[i] >= 'A')
n[i] = n[i] + 32;
}
i = 0;
while(n[i] == '0'&&i <= c - 1)
i = i + 1;
if (i == c)
printf("0");
for(i = 0;i <= (c - 1);i++)
{
if(n[i] <= 'z'&&n[i] >= 'a')
x = x * a + (n[i] - 'a' + 10);
else
x = x * a + (n[i] - '0');
}
i = 0;
while(x > 0)
{
z = x % b;
if (z > 9)
p[i] = 'A' + z - 10;
else
p[i] = z + '0';
i = i + 1;
x = x / b;
}
i = i - 1;
while(i >= 0)
{
printf("%c",p[i]);
i = i - 1;
}
}
|
55 | 27413 | 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 | 27414 | int main()
{
char k[32];
int l[32];
long a,b,d,i,s,n=0;
s=1;
n=0;
scanf("%d%s%d",&a,k,&b);
d=strlen(k);
i=d-1;
while(i>=0)
{
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]-'0')*s;
i--;
s*=a;
}
if(n==0)
{
printf("0");
return 0;
}
for(i=0;n>0;i++)
{
l[i]=n%b;
n/=b;
}
d=i;
for(i=d-1;i>=0;i--)
{
if(l[i]>=10)
printf("%c",l[i]-10+'A');
else
printf("%d",l[i]);
}
printf("\n");
}
|
55 | 27415 | main()
{
char S[N],T[N];
long int a,n,b,S10=0,d=1,l=1,m=1,num[N];
int i,j,k,r,t;
scanf("%d %s %d",&a,S,&b);
t=strlen(S);
for(j=0;j<t-1;j++)
{
d=d*a;
}
for(i=0;i<t;i++)
{
if(S[i]<='9')
{
l=S[i]-'0';
S10=S10+l*d;
d=d/a;
}
if(S[i]>'9')
{
if(S[i]>'a'-1)
{
S[i]=S[i]-'a'+'A';
}
l=10+S[i]-'A';
S10=S10+l*d;
d=d/a;
}
}
for(k=0;;k++)
{
num[k]=S10%b;
S10=S10/b;
if(S10==0)
{
break;
}
}
t=k;
for(r=0;r<=t;r++,k--)
{
if(num[k]<='9'-'0')
{
T[r]='0'+num[k];
}
if(num[k]>'9'-'0')
{
T[r]='A'+num[k]-10;
}
}
T[r]='\0';
printf("%s",T);
} |
55 | 27416 | /**
* @file 2.cpp
* @author ??? 1100012944
* @date 2011-11-12
* @description
* ???????????
*/
long int change1(char n[], int a)
{
long int s, y = 0;
int i;
for(i = 0; n[i] != '\0'; i++)
{
if (n[i] >= '0' && n[i] <= '9')
s = n[i] - '0'; //9???????10????
else if (n[i] >='A' && n[i] <='Z')
{
s = n[i] - 'A' + 10;
}
else
{
s = n[i] - 'a' + 10;
}
y = y * a + s;
}
return y;
}
int main()
{
int a, b, i = 0, j;
long int s, t;
char n[200], r[200];
cin >> a;
cin >>n;
cin >> b;
s = change1(n, a);
while( s >= b )
{
t = s % b;
if ( t >= 0 && t <= 9)
{
r[i] = t + '0';
}
else
{
r[i] = t - 10 + 'A';
}
i ++;
s = s / b;
}
if ( s >= 0 && s <= 9)
{
r[i] = s + '0';
}
else
{
r[i] = s - 10 + 'A';
}
for ( j = i; j >= 0; j --)
{
cout << r[j];
}
return 0;
}
|
55 | 27417 | void main()
{
int a=0,b=0,i;
long int e=0;
char c[33];
int f(char x);char g(int x);
scanf("%d%s%d",&a,c,&b);
for(i=0;c[i]!=0;i++)
e=a*e+f(c[i]);
if(e==0)printf("0");
for(i=32;e>0;i--)
{
c[i]=g(e%b);
e=e/b;
}
for(++i;i<=32;i++)
printf("%c",c[i]);
printf("\n");
}
int f(char x)
{
if('0'<=x&&x<='9')
return(x-'0');
else if('A'<=x&&x<='Z')
return(x-'A'+10);
else return(x-'a'+10);
}
char g(int x)
{
if(0<=x&&x<=9)
return(x+'0');
else return(x+'A'-10);
}
|
55 | 27418 | void main()
{
long int a,n=0,b,i,k,j,c,r;
char x[100],y[100];
scanf("%ld%s%ld",&a,x,&b);
k=strlen(x);
for(i=0;i<k;i++)
{
if(x[i]>='0'&&x[i]<='9')
{
c=x[i]-48;
for(j=1;j<=k-1-i;j++)
c=c*a;
n=n+c;
}
else if(x[i]>='A'&&x[i]<='Z')
{
c=x[i]-55;
for(j=1;j<=k-1-i;j++)
c=c*a;
n=n+c;
}
else
{
c=x[i]-87;
for(j=1;j<=k-1-i;j++)
c=c*a;
n=n+c;
}
}
i=0;
do
{
r=n%b;
if(r>=0&&r<=9)
y[i]=r+48;
else y[i]=r+55;
n=n/b;
i=i+1;
}while(n!=0);
for(k=i-1;k>=0;k--)
printf("%c",y[k]);
}
|
55 | 27419 | int main()
{
char n[32],t[32];
double a,b;
int i,m[32],c[32],d[32],size,k;
long n10=0;
cin>>a>>n>>b;
size=strlen(n);
for(i=0;i<size;i++)
if(toascii(n[i])>=48&&toascii(n[i])<=57)
m[i]=toascii(n[i])-48;
else if(toascii(n[i])>=65&&toascii(n[i])<=90)
m[i]=toascii(n[i])-55;
else if(toascii(n[i])>=97&&toascii(n[i])<=122)
m[i]=toascii(n[i])-87;
for(i=0;i<size;i++)
n10=n10+m[i]*pow(a,size-i-1);
if (n10==0)
cout << 0 << endl;
for(i=0;i<32;i++)
if(pow(b,i)>n10)
{
k=i;
break;
}
c[0]=n10/pow(b,k-1);
for(i=1;i<k;i++)
{
n10=n10-c[i-1]*pow(b,k-i);
c[i]=n10/(pow(b,k-1-i));
}
for(i=0;i<k;i++)
if(c[i]<10) d[i]=c[i]+48;
else if (c[i]>=10) d[i]=c[i]+55;
for(i=0;i<k;i++)
t[i]=d[i];
t[k]='\0';
cout<<t;
return 0;
} |
55 | 27420 | 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 | 27421 | int main()
{
int ah,af,i,j=0 ,len= 0,sum=0,jin=1 ,zhuan[100];
char num[100],zhuanfu[100];
cin>>ah;
cin>>num;
cin>>af;
len = strlen(num);
if( num[0]=='0' )
printf("0");
for( i = len-1;i >= 0;i-- )
{
if(num[i]>='a'&&num[i]<='z')
num[i]-=87;
if( num[i]>='A'&&num[i]<='Z' )
num[i]-=55;
if( num[i]>='0'&&num[i]<='9' )
num[i]-=48;
sum += num[i]*jin;
jin*=ah;
}
while( sum != 0 )
{
zhuan[j]=sum%af;
sum/=af;
j++;
}
for( i = j-1;i>=0;i-- )
{
if( zhuan[i]>=10 )
printf("%c",zhuan[i]+55);
else
printf("%d",zhuan[i]);
}
}
|
55 | 27422 | main()
{
char c[100],d[100];
int a,n=0,b,l,i,j,e;
scanf("%d %s %d",&a,c,&b);
l=strlen(c);
for(i=0;i<=l-1;i++)
{
if(c[i]>='A'&&c[i]<'a')
e=c[i]-'A'+10;
else if(c[i]>='a')
e=c[i]-'a'+10;
else
e=c[i]-'0';
n=n*a+e;
}
for(i=0;;i++)
{
d[i]=n%b;
n=n/b;
if(d[i]>=10)
d[i]=d[i]-10+'A';
else
d[i]=d[i]+'0';
if(n==0)
break;
}
for(j=i;j>=0;j--)
printf("%c",d[j]);
printf("\n");
getchar();
getchar();
getchar();
getchar();
}
|
55 | 27423 | int main()
{
char n[40],y[40],z[40];
int a,b,c=0,l,i,k;
scanf("%d %s %d",&a,n,&b);
l = strlen(n);
for (i = 0;i<l;i++)
{
if(n[i]>='0'&&n[i]<='9')
n[i]=n[i]-'0';
if(n[i]>='a'&&n[i]<='z')
n[i]=n[i]-'a'+10;
if(n[i]>='A'&&n[i]<='Z')
n[i]=n[i]-'A'+10;
}
for (i = 0;i<l;i++)
{
c = n[i] + a *c ;
}
for (k = 0;c!=0;k++)
{
y[k] = c%b;
c=c/b;
}
if (k == 0)
printf("0\n");
else
{
for (i = 0;i<k;i++)
{
z[i]=y[k-i-1];
}
for (i = 0;i<k;i++)
{
if(z[i]>=0&&z[i]<=9)
z[i]=z[i]+'0';
if(z[i]>9&&z[i]<=36)
z[i]=z[i]-10+'A';
}
z[k]=0;
printf("%s\n",z);
}
} |
55 | 27424 | //*******************
//*???????*
//*??????*
//*2011/11/14*
//*******************
int change(char a)
{
int b;
if (( a <= '9' ) && ( a >= '0' ))
b = a - '0';
else if (( a >= 'a') && ( a <= 'z'))
b = a - 'a' + 10 ;
else
b = a - 'A' + 10 ;
return b ;
} // ?????????????????
int main()
{
int i = 0, j, num1, num2, m;
long ten = 0; // ten???????
char output[100];
char chu, mo;
cin >> num1;
cin.get();
while ((chu = cin.get()) != ' ')
{
m = change(chu); // ????
ten = ten * num1; // ?num1??????????????ten
ten = ten + m;
}
cin >> num2;
while (ten > 0)
{
m = ten % num2;
if (m > 9)
mo = m - 10 + 'A';
else
mo = m + '0';
output[i] = mo;
i++ ;
ten = ten / num2;
} // ?????????????
if (i == 0)
cout << "0" << endl ;
else
for (j = i - 1; j >= 0; j--)
cout << output[j];
return 0;
} |
55 | 27425 | int convertor(char A[],int code,int right)
{
if(right==0)
return(A[0]);
else return(A[right]+code*convertor(A,code,right-1));
}
void main()
{int shuzhi1,shuzhi2,i,j,n,l;
char num1[20],num2[20];
scanf("%d",&shuzhi1);
scanf("%s",num1);
scanf("%d",&shuzhi2);
n=strlen(num1);
for(i=0;i<n;i++)
{if(num1[i]>='A'&&num1[i]<='Z')
num1[i]=num1[i]-'A'+10;
else if(num1[i]>='a'&&num1[i]<='z')
num1[i]=num1[i]-'a'+10;
else if(num1[i]>='0'&&num1[i]<='9')
num1[i]=num1[i]-'0';
}
l=convertor(num1,shuzhi1,n-1);
j=0;
while(l/shuzhi2>0)
{
num2[j]=l%shuzhi2;
l=l/shuzhi2;
j++;
}
num2[j]=l;
for(i=0;i<=j;i++)
{if(num2[i]>9)
num2[i]=num2[i]-10+'A';
else num2[i]=num2[i]+'0';
}
for(i=j;i>=0;i--)
printf("%c",num2[i]);
}
|
55 | 27426 | void main()
{
int a,b,n,l,t=1,i,j,g,re[100],k=0;
long int sum=0;
char num[100],c[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'};
scanf("%d %s %d",&a,num,&b);
l=strlen(num);
for(i=0;i<l;i++)
if(num[i]>='a'&&num[i]<='z')
num[i]=num[i]-32;
for(i=l-1;i>=0;i--)
for(j=0;j<a;j++)
if(c[j]==num[i])
{
sum=sum+t*j;
t=t*a;
}
while(sum>=b)
{
g=sum%b;
re[k++]=c[g];
sum=sum/b;
}
re[k]=c[sum];
for(i=k;i>=0;i--)
printf("%c",re[i]);
printf("\n");
} |
55 | 27427 | int main()
{
int n,m,i,t=0,j,c=0;
char s[80],a[80];
char b[]="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
scanf("%d %s %d",&n,s,&m);
for(i=0;s[i]!='\0';i++)
{
for(j=0;j<37;j++)
{
if(s[i]==b[j]||(s[i]==b[j]+32&&s[i]>='a'&&s[i]<='z'))
{
t=t*n+j;
}
}
}
for(i=79;i>0;i--)
{
a[i]=b[t%m];
c++;
t=t/m;
if(t==0)
{
break;
}
}
for(i=80-c;i<80;i++)
{
printf("%c",a[i]);
}
return 0;
} |
55 | 27428 |
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];
}
i=0;
do
{
if(num%b<10)m[i]=num%b+48;
else m[i]=num%b+55;
num=num/b;
i++;
}while(num);
for(;i>0;i--)cout<<m[i-1];
return 0;
} |
55 | 27429 | int main()
{ int m,n,k,i,t=0,j=1,t1;
char a[20],b[20],c[20];
scanf("%d",&m);
scanf("%s",a);
scanf("%d",&n);
k=strlen(a);
for(i=k-1;i>=0;i--)
{ if(a[i]>=48&&a[i]<=57) t=t+(a[i]-48)*j;
else if(a[i]>=65&&a[i]<=90) t=t+(a[i]-55)*j;
else if(a[i]>=97&&a[i]<=122) t=t+(a[i]-87)*j;
j=j*m;
}
if(t==0) printf("%d",t);
else {i=0;
while(t>0)
{ t1=t%n;
t=t/n;
if(t1<=9) b[i]=t1+48;
else b[i]=t1+55;
i++;
}
for(j=0;j<i;j++)
{ c[j]=b[i-1-j];
printf("%c",c[j]);}}
printf("\n");
scanf("%d",&m);
}
|
55 | 27430 | //******************************************
//*???????.cpp **
//*??: ?? 1100012808 **
//*???2011.11.13 **
//******************************************
int shi(int a, char b[]) //???????????????????
{
int sum = 0, i = 0, f;
double t;
f = strlen(b); //f?usigned int?????int
t = a;//t??a?????????????
for (i = 0; i < strlen(b); i++)
{
if (b[i] < 'A') //????????????????
sum +=(int) (b[i] - '0') * pow(t, f - 1 - i);
else if (b[i] < 'a')
sum +=(int) (b[i] - 'A' + 10) * pow(t, f - 1 - i);
else
sum +=(int) (b[i] - 'a' + 10) * pow(t, f - 1 - i);
}
return sum;
}
void zhuanhua(int x, int y) //????????????????????
{
int i = 0, yu[300] = {0}, j = 0;
if (x != 0) //??????????0
{
for (i = 0; x != 0; i++) //???????x??0
{
yu[i] = x % y; //?????????????
x = x / y; //?????????
}
}
else
cout << "0" << endl; //??0???????0??
for (j = i - 1; j >= 0; j--)
{
if (yu[j] > 9) //????????9
{
cout << (char)(yu[j] - 10 + 'A');//???????????
}
else
{
cout << yu[j]; //????????????
}
}
return;
}
int main() //???
{ //?????
int a, b;
char n[300]; //??????????
cin >> a >> n >> b;
zhuanhua(shi(a, n), b); //???????
return 0;
} //????? |
55 | 27431 | void main()
{
int length,original,then,change[100],i,j,k,s=0,m,length2;
char input[100],output[100];
scanf("%d %s %d",&original,input,&then);
length=strlen(input);
for(i=0;i<length;i++)
{
if(input[i]<='9') change[i]=input[i]-48;
else if(input[i]>='a') change[i]=input[i]-87;
else change[i]=input[i]-55;
}
for(i=0;i<length;i++)
{
s=s+pow(original,length-i-1)*change[i];
}
for(j=0;;j++)
{
m=s%then;s=s/then;
{
if(s==0)
{
if((m<=9)&&(m>=0)) {output[j]=m+48;break;}
else if((m>9)&&(m<=35)) {output[j]=m+55;break;}
}
else
{
if((m<=9)&&(m>=0)) output[j]=m+48;
else if((m>9)&&(m<=35)) output[j]=m+55;
}
}
}
for(k=0;k<j+1;k++)
printf("%c",output[j-k]);
printf("\n");
} |
55 | 27432 | 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 | 27433 | main()
{
int a,b,i,x,j,l,y;
char c[1000];
char f[1000];
int e[1000];
scanf("%d %s %d",&a,c,&b);
l=strlen(c);
x=0;
int d[l];
for(i=0;i<l;i++)
{
if(c[i]<='Z'&&c[i]>='A')
d[i]=c[i]-'A'+10;
else if(c[i]<='z'&&c[i]>='a')
d[i]=c[i]-'a'+10;
else
d[i]=c[i]-'0';
x=d[i]+x*a;
}
if(x==0)
printf("%d",0);
for(j=0;x!=0;j++)
{
e[j]=x%b;
x=x/b;
}
e[j]=0;
for(y=0;y<j;y++)
{
if(e[y]<=9)
f[j-1-y]='0'+e[y];
else
f[j-1-y]=e[y]-10+'A';
f[j]='\0';
}
printf("%s",f);
printf("\n");
getchar();
getchar();
}
|
55 | 27434 |
main()
{
int i,a,b,n=0,l,l1=0,p;
char s[33],t[33];
scanf("%d%s%d",&a,s,&b);
l=strlen(s);
for(i=0;i<l;++i)
{
if((s[i]>='0')&&(s[i]<='9'))
p=s[i]-'0';
else if((s[i]>='a')&&(s[i]<='z'))
p=s[i]-'a'+10;
else
p=s[i]-'A'+10;
n=n*a+p;
}
for(;n;n/=b)
{
p=n%b;
if(p<10)
t[l1++]='0'+p;
else
t[l1++]='A'+p-10;
}
if(!l1)
printf("0");
else
for(i=l1-1;i>=0;--i)
printf("%c",t[i]);
printf("\n");
} |
55 | 27435 | main()
{
char a[100],b[100];
int i,j,n,k,l=0;
long c=0;
scanf("%d %s %d",&i,a,&j);
n=strlen(a);
for(k=0;k<n;k++)
{
if(a[k]>='A'&&a[k]<='Z')
a[k]=a[k]-'A'+10;
else if(a[k]>='a'&&a[k]<='z')
a[k]=a[k]-'a'+10;
else
a[k]=a[k]-'1'+1;
}
for(k=0;k<n;k++)
c=c*i+a[k];
for(k=0;;k++)
{
b[k]=c%j;
if(b[k]>=10)
b[k]=b[k]-10+'A';
else
b[k]=b[k]+'1'-1;
c=c/j;
l=l++;
if(c==0)
break;
}
for(k=0;k<l;k++)
printf("%c",b[l-k-1]);
}
|
55 | 27436 | 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 | 27437 |
int main(){
long int a,b,sum,c=0;
char str[100],str1[100];
cin>>a>>str>>b;
for(int i=0;str[i]!='\0';i++)
if((str[i]>='a')&&(str[i]<='z'))
str[i]-=32;
sum=strlen(str);
for(int i=0;i<sum;i++){
if(str[i]>='0'&&str[i]<='9')
c+=(int)pow((double)a,(double)(sum-1-i))*(str[i]-48);
if(str[i]>='A'&&str[i]<='Z')
c+=(int)pow((double)a,(double)(sum-1-i))*(str[i]-55);
}
int Len=0;
if(c==0)
cout<<"0";
else{
while(c>0){
int t=c%b;
if (t>=10) str1[Len]='A'+t-10;
else str1[Len]='0'+t;
c/=b;Len++;
}
for(int j=Len-1;j>=0;j--)
cout<<str1[j];
}
return 0;
} |
55 | 27438 | int main()
{
int n,m,i,j,t=0,b=0;
char s[80],s0[80];
char s1[80]={"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"};
scanf("%d %s %d",&n,s,&m);
for(i=0;s[i]!='\0';i++)
{
if(s[i]>='a'&&s[i]<='z')
{
s[i]=s[i]-32;
}
for(j=0;j<36;j++)
{
if(s1[j]==s[i])
{
t=n*t+j;
}
}
}
for(i=0;;i++)
{
s0[i]=s1[t%m];
b++;
t=t/m;
if(t==0)
{
break;
}
}
for(i=b-1;i>=0;i--)
{
printf("%c",s0[i]);
}
printf("\0");
return 0;
}
|
55 | 27439 | 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 | 27440 | void fun(char[][10],int*,int*,int);
void main()
{
long i,l,a,b,t=0,r;
char n[20],m[20]={'\0'};
scanf("%ld %s %ld",&a,n,&b);
l=strlen(n);
for(i=0;i<l;i++)
{
if(n[i]>='0'&&n[i]<='9')
t+=(n[i]-'0')*pow(a,l-i-1);
else if(n[i]>='a'&&n[i]<='z')
t+=(n[i]-'a'+10)*pow(a,l-i-1);
else
t+=(n[i]-'A'+10)*pow(a,l-i-1);
}
if(t==0)
printf("0");
else
{
for(i=0;t>0;i++)
{
r=t%b;
if(r<10)
m[i]='0'+r;
else
m[i]='A'+(r-10);
t/=b;
}
for(i=i-1;i>=0;i--)
printf("%c",*(m+i));
}
}
|
55 | 27441 | 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 | 27442 | void main()
{
char s1[1000],s2[1000];
int m[1000],n[1000],t,s,a,b,i,j,l1;
scanf("%d%s%d",&a,s1,&b);
l1=strlen(s1);
for(i=0;i<l1;i++)
{
if(s1[l1-1-i]>='0'&&s1[l1-1-i]<='9') m[i]=s1[l1-i-1]-'0';
else if(s1[l1-1-i]>='a'&&s1[l1-1-i]<='z') m[i]=s1[l1-i-1]-'a'+10;
else if(s1[l1-1-i]>='A'&&s1[l1-1-i]<='Z') m[i]=s1[l1-i-1]-'A'+10;
}
t=1;s=0;
for(i=0;i<l1;i++)
{s+=m[i]*t;
t*=a;}//??????
i=0;
if(s)
{
while(s!=0)
{
n[i]=s%b;
s=s/b;
i++;
}
i--;}
for(j=i;j>=0;j--)
{
if(n[j]<10) {s2[j]=n[j]+'0';printf("%c",s2[j]);}
else {s2[j]=n[j]+'A'-10;printf("%c",s2[j]);}
}
}
|
55 | 27443 | char uup(char c)
{
if (c>=97) c-=32; return(c);
}
void main()
{
char arr[40]={0},brr[40]={0};
int n,m,i,j,k;
int a[40]={0},b[40]={0};
scanf("%d%s%d",&n,arr,&m);
i=strlen(arr);
for (k=0;k<i;k++)
{if(uup(arr[k])>58) a[i-k-1]=uup(arr[k])-'A'+10; else a[i-k-1]=arr[k]-'0';}
//if (n>30)printf("%d%d%d%d%d",a[0],a[1],a[2],a[3],a[4]);
for (k=0;k<40;k++)
{
for (j=39;j>=1;j--)
{
a[j-1]=a[j-1]+a[j]%m*n;
a[j]=a[j]/m;
}
b[k]=a[0]%m; a[0]=a[0]/m;
}
k=39; while((b[k]==0)&&(k>=1))k--;
for (;k>=0;k--)
{
if(b[k]>9)printf("%c",b[k]+'A'-10);
else printf("%d",b[k]);
}
printf("\n");
} |
55 | 27444 | int main ()
{
int a,b,k=0;
char c1[100];
int d1[100],d2[100],c2[100];
cin >>a;
scanf("%s",c1);
cin >>b;
k=strlen(c1);
int i;
for(i=0;i<=k-1;i++)
{
if (48<=c1[i]&&c1[i]<=57)
d1[i]=c1[i]-48;
else if (65<=c1[i]&&c1[i]<=90)
d1[i]=c1[i]-55;
else d1[i]=c1[i]-87;
}
int s=0;
int fc=1;
for (i=k-1;i>=0;i--)
{
s=s+fc*d1[i];
fc=fc*a;
}
i=0;
if (s==0)
cout <<0 <<endl;
while (s>0)
{
d2[i]=s%b;
s=s/b;
i++;
}
int g;
for (g=0;g<=i-1;g++)
if (d2[g]<=9)
c2[g]=d2[g]+48;
else c2[g]=d2[g]+55;
for (g=i-1;g>=0;g--)
cout <<(char)c2[g];
return 0;
}
|
55 | 27445 | void main()
{
int a,b,i,m,e,f,d=1,c=0;
char n[1000]={0},k[1000]={0};
scanf("%d",&a);
scanf("%s",n);
scanf("%d",&b);
m=strlen(n);
for(i=0;i<m;++i)
{
if(n[i]>=65&&n[i]<=90)
n[i]=n[i]-55;
if(n[i]>=97&&n[i]<=122)
n[i]=n[i]-87;
if(n[i]>=48&&n[i]<=57)
n[i]=n[i]-48;
c=c*a+n[i];
}
if(c==0) printf("0\n");
for(i=0;c>0;++i)
{
e=c%b;
if(e>=10&&e<=35)
e=e+55;
if(e>=0&&e<=9)
e=e+48;
c=(c-c%b)/b;
k[i]=e;
}
f=strlen(k);
for(i=0;i<f;++i)
{ if(k[i]!='\0')
printf("%c",k[f-1-i]);}
}
|
55 | 27446 | int main(){
char str[10001];
char* array[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"};
long int a,b,n,m[10001],lstr,i,lb,a1;
cin>>a;
cin.get();
cin>>str;
cin>>b;
lstr=strlen(str);
n=0;lb=0;
for(i=0;i<lstr;i++){
if(str[i]>=65&&str[i]<=90)
m[i]=str[i]-'A'+10;
else if(str[i]>=97&&str[i]<=122)
m[i]=str[i]-'a'+10;
else
m[i]=str[i]-'0';
}
a1=a;
n+=m[lstr-1];
for(i=lstr-2;i>=0;i--){
n=n+m[i]*a;
a=a*a1;
}
for(i=1;i<10000;i++){
if(n<b){
cout<<array[n];
break;
}
else{
m[i]=n%b;
n-=m[i];
n=n/b;
lb++;
}
}
for(i=lb;i>=1;i--)
cout<<array[m[i]];
return 0;
} |
55 | 27447 |
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 | 27448 | int main()
{
unsigned int decn=0;
int a,b,i,k; //????????????????????????????????????????????????????????
char n[100],r[100]; //?????????????????????????????
cin>>a>>n>>b;
for(i=0;i<100;i++)
{
if(n[i]==0)
{
k=i;
break;
}
}
for(i=0;i<k;i++)
{
if(n[i]<=57)
{
decn=decn+(n[i]-48)*pow((double)a,(int)k-i-1);
}
else if(n[i]<=90)
{
decn=decn+(n[i]-55)*pow((double)a,(int)k-i-1);
}
else
{
decn=decn+(n[i]-87)*pow((double)a,(int)k-i-1);
}
} //?????????
i=0;
do{
r[i]=decn%b; //???????????????????????
if(r[i]<10)
{
r[i]=r[i]+48;
}
else
{
r[i]=r[i]+55;
} //??????????
decn=decn/b; //????????
i++;
}while(decn!=0);
i=i-1;
for(;i>=0;i--)
{
cout<<r[i]; //???????
}
return 0;
} |
55 | 27449 | //*********************************************
//*??????? **
//*?????? 1100012914 **
//*???2011.11.14 **
//*********************************************
char num1[1000000], num2[100000];
int a, b, c, x = 0, i, len1, len2;
void change(int);
int main()
{
cin >> a;
cin >> num1;
cin >> b;
len1 = strlen(num1);
int t, j;
for (j = 0; j < len1; j++)
{
if (num1[j] >= 'a' && num1[i] <= 'z')
{
t = num1[j] - 'a' + 10;
x = x * a + t;
}
else
if(num1[j] >= 'A' && num1[j] <= 'Z')
{
t = num1[j] - 'A' + 10;
x = x * a + t;
}
else
{
t = num1[j] - '0';
x = x * a + t;
}
}
change(x);
len2 = strlen(num2);
for (i = len2 - 1; i >= 0; i--)
{
cout << num2[i];
}
cin >> i;
return 0;
}
void change(int x)
{
int z, h = 0;
char ch;
if (x == 0)
cout << 0 << endl;
else
{
while (x != 0)
{
z = x % b;
x = x / b;
if (z >= 0 && z <= 9)
{
ch = z + '0';
num2[h] = ch;
h++;
}
else
{
z = z - 10;
ch = z + 'A';
num2[h] = ch;
h++;
}
}
}
} |
55 | 27450 |
int char_to_num(char c)
{
if ('0'<=c && c<='9')
return c-'0';
if ('a'<=c && c<='z')
return 10+(c-'a');
if ('A'<=c && c<='Z')
return 10+(c-'A');
}
char num_to_char(int n)
{
if (n<10)
return n+'0';
else
return n-10+'A';
}
int main()
{
int a, b, i, length;
char n[100];
long num, pow;
scanf("%d %s %d", &a, n, &b);
length = strlen(n);
pow = 1;
num = 0;
// get the number
for (i=length-1; i>=0; i--)
{
num = num + char_to_num(n[i])*pow;
pow = pow * a;
}
for (i=0; i<100; i++)
{
n[i] = num_to_char(num%b);
num = num / b;
if (num == 0)
break;
}
for ( ; i>=0; i--)
printf("%c", n[i]);
printf("\n");
return 0;
} |
55 | 27451 | 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 | 27452 | int main()
{
char s[100],v[100];
int a,b,j,i,l,t=0;
cin>>a;
cin>>s;
cin>>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]+=('A'-10);
}
for(i=m-1;i>=0;i--)
cout<<v[i];
if(m==0)
cout<<0;
}
|
55 | 27453 | int main()
{
int i,k,r,l,x,t[40],s,a,b;
char c[40],d[40];
scanf("%d %s %d",&a,c,&b);
l=strlen(c);x=0;
for(i=0;i<l;i++)
{
if(c[i]>='A'&&c[i]<='Z')
s=c[i]-'A'+10;
else
{
if(c[i]>='a'&&c[i]<='z')
s=c[i]-'a'+10;
else
s=c[i]-'0';
}
x=s+x*a;
}
k=0;
r=x;
for(i=0;i<40;i++)
{
t[i]=r%b;
r=r/b;
k++;
if(r==0)
break;
}
for(i=0;i<k;i++)
{
if(t[k-1-i]>=0&&t[k-1-i]<=9)
d[i]=t[k-1-i]+'0';
else
if(t[k-1-i]>=10&&t[k-1-i]<=35)
d[i]=t[k-1-i]-10+'A';
}
for(i=0;i<k;i++)
printf("%c",d[i]);
getchar();
getchar();
}
|
55 | 27454 |
int main(){
int a,b,i=0,j=0,t=0;
double k,x;
char n[100],m[100];
cin>>a>>n>>b;
x=strlen(n);
for(i=0;i<x;i++)
{{if(n[i]>='A'&&n[i]<='Z')
k=n[i]-55;
else if(n[i]>='a'&&n[i]<='z')
k=n[i]-87;
else k=n[i]-48;}t=t+k*pow((double)a,x-i-1.0);
}
while(t/b!=0)
{m[j]=t%b;
t=t/b;
j++;
}m[j]=t%b;
while(j>=0){if(m[j]>9)(char)(m[j]+=55);
else (char)(m[j]+=48);
cout<<m[j];j--;}
return 0;
}
|
55 | 27455 | 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 | 27456 |
int mpow(int a,int b)
{
int i,c=1;
for(i=0;i<b;i++)c*=a;
return c;
}
main()
{
char a[10],d[10],c;
int aa[10],b[10];
int m=0,n=0,i=0,t=0,l=0,j=0,h=0;
int s=0;
scanf("%d%s%d",&m,a,&n);
i=strlen(a);
for(t=0;t<i;t++)
{
if(a[t]>=65 && a[t]<=90)
aa[t]=a[t]-55;
}
for(t=0;t<i;t++)
{
if(a[t]>=97 && a[t]<=122)
aa[t]=a[t]-87;
}
for(t=0;t<i;t++)
{
if(a[t]>=48 && a[t]<=57)
aa[t]=a[t]-48;
}
for(h=0;h<i;h++)
{
t=aa[h]*mpow(m,i-h-1);
s=s+t;
}
j=0;
if (s==0)
printf("0");
while(s>=1)
{
b[j]=s%n;
j++;
s=s/n;
}
j--;
for(l=j;l>=0;l--)
{
if (b[l]>9) d[l]=b[l]+'A'-10;
else d[l]=b[l]+'0';
}
for(l=j;l>=0;l--)
printf("%c",d[l]);
printf("\n");
} |
55 | 27457 | 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 | 27458 | void main()
{
int a,b,x[100],y[100],i,j,k,q;
long n=0;
scanf("%d",&a);
q=getchar();
for(i=0;;i++)
{x[i]=getchar();
if(x[i]==' ')break;
}
scanf("%d",&b);
for(j=0;j<i;j++)
{if(x[j]>=48&&x[j]<=57)
x[j]=x[j]-48;
if(x[j]>=65&&x[j]<=90)
x[j]=x[j]-55;
if(x[j]>=97&&x[j]<=122)
x[j]=x[j]-87;
}
for(j=0;j<i;j++)
n=a*n+x[j];
if(n==0)printf("0");
for(j=0;n!=0;j++)
{y[j]=n%b;
n=n/b;
if(y[j]>=10)y[j]=y[j]+55;
else
y[j]=y[j]+48;
}
for(k=j-1;k>=0;k--)
putchar(y[k]);
printf("\n");
}
|
55 | 27459 | //*???????
//*??????????????????????2???36?????????long?????????
int main( ) //?????
{ //?????
double a,b; //????
int i,L1,L2;
char n[32],m[32]; //???????
int p[32],q[32];
cin >>a >>n >>b;
L1=strlen(n); //??n???
for(i=0;i<L1;i++)
{
p[i]=n[i];
if(p[i]>=97) p[i]=p[i]-87;
else if(p[i]>=65) p[i]=p[i]-55;
else p[i]=p[i]-48;
}
int dec=0;
for(i=0;i<L1;i++) //?n???10???
dec=dec+p[i]*pow(a,L1-1-i);
if(dec==0) cout <<"0";
else
{
for(i=0;i<32;i++)
if(pow(b,i)>dec)
{
L2=i;
break;
}
for(i=0;i<L2;i++) //?10??????b???
{
q[i]=dec/(int)(pow(b,L2-1-i));
dec=dec-q[i]*pow(b,L2-1-i);
}
for(i=0;i<L2;i++)
{
if(q[i]<10) m[i]=q[i]+48;
else m[i]=q[i]+55;
}
m[L2]='\0';
cout <<m; //??b???
}
return 0; //???????????????????
} //???? |
55 | 27460 | int main()
{
char p[100],z[100],a; //??????????
long sum=0; //??????
int x,m,n,t,b;
int i,k,c;
scanf("%d",&m);
scanf("%s",p);
scanf("%d",&t);//????
n=strlen(p);//p???
for(i=0;p[i]!='\0';i++)
{
a=p[i];
if(a>='a'){b=a-'a'+10;}
else if(a>='A'){b=a-'A'+10;}
else if(a<='9'){b=a-'0';}
sum=sum+(long)(b*pow(m,n-1));
n--;
}//?p????????
long r=sum;
if(sum==0){printf("0");}
int w=0;
for(c=0;r>0;c++){ x=r%t;r=r/t;w++;}//?????
for(k=w-1;k>=0;k--)
{
x=sum%t;
sum=sum/t;
if(x<=10)
{
switch(x)
{
case 0:z[k]='0';break;
case 1:z[k]='1';break;
case 2:z[k]='2';break;
case 3:z[k]='3';break;
case 4:z[k]='4';break;
case 5:z[k]='5';break;
case 6:z[k]='6';break;
case 7:z[k]='7';break;
case 8:z[k]='8';break;
case 9:z[k]='9';break;
case 10:z[k]='A';break;
}
}
else if(x>=11&&x<=20)
{
switch(x)
{
case 11:z[k]='B';break;
case 12:z[k]='C';break;
case 13:z[k]='D';break;
case 14:z[k]='E';break;
case 15:z[k]='F';break;
case 16:z[k]='G';break;
case 17:z[k]='H';break;
case 18:z[k]='I';break;
case 19:z[k]='J';break;
case 20:z[k]='K';break;
}
}
else if(x>=21&&x<=30){
switch(x){
case 21:z[k]='L';break;
case 22:z[k]='M';break;
case 23:z[k]='N';break;
case 24:z[k]='O';break;
case 25:z[k]='P';break;
case 26:z[k]='Q';break;
case 27:z[k]='R';break;
case 28:z[k]='S';break;
case 29:z[k]='T';break;
case 30:z[k]='U';break;
}
}
else{
switch(x){
case 31:z[k]='V';break;
case 32:z[k]='W';break;
case 33:z[k]='X';break;
case 34:z[k]='Y';break;
case 35:z[k]='Z';break;
}
}//??????????????
}
z[w]='\0';//??
printf("%s",z);//????????
return 0;
} |
55 | 27461 | 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 | 27462 | void main()
{
int x[100]={0}, n, i, p, y;
char c[100]={'\0'} ;
int a, b, m, num=0;
scanf("%d",&a);
scanf("%s",c);
scanf("%d",&b);
n=strlen(c);
for(i=n-1;i>=0;i--)
{
m=pow(a,n-1-i);
if(c[i]<65)
num=num+m*(c[i]-48);
else if(c[i]<96)
num=num+(c[i]-55)*m;
else
num=num+(c[i]-87)*m;
}
y=0;
for(i=0;;i++)
{
y++;
x[i]=num%b;
m=pow(b,i);
p=num/b;
if(p<b)
break;
num=num/b;
}
if(p<=9&&p>0)
printf("%d",p);
else
if(p>9)
printf("%c",p+55);
for(i=y-1;i>=0;i--)
{
if(x[i]<=9)
printf("%d",x[i]);
else
printf("%c",(x[i]+55));
}
printf("\n");
}
|
55 | 27463 | int main ()
{
int a,b,l;
char n[50],d[50],m[50];
scanf ("%d %s %d",&a,n,&b);
if (n[0]=='0')
printf ("0\n");
else
{
l=strlen(n);
int x=0;
int j=0;
for (int i=0;i<l;i++)
{
if (n[i]>='a' && n[i]<='z' )
n[i]=n[i]-'a'+10;
else if (n[i]>='A' && n[i]<='Z')
n[i]=n[i]-'A'+10;
else if (n[i]>='0' && n[i]<='9')
n[i]=n[i]-'0';
x=x*a+n[i];
}
for (;x!=0;j++)
{
d[j]=x%b;
x=x/b;
}
d[j]='\0';
for (int y=0;y<j;y++)
{
m[y]=d[j-y-1];
}
m[j]='\0';
for (int z=0;z<j;z++)
{
if (m[z]<=9)
m[z]=m[z]+'0';
else
m[z]=m[z]+'A'-10;
}
printf ("%s",m);
getchar();
getchar();
}
}
|
55 | 27464 | 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 | 27465 | 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 | 27466 | void main()
{
long int a,b,n=0;
long int i,j,l;
char c[1000],d[1000];
scanf("%d",&a);
scanf("%s",c);
scanf("%d",&b);
l=strlen(c);
for(i=0;i<l;i++)
{ if(c[i]>=65&&c[i]<=90)
c[i]=c[i]-55;
else if(c[i]>=97&&c[i]<=122)
c[i]=c[i]-87;
else c[i]=c[i]-48;
}
for(i=0;i<l;i++)
n=n*a+c[i];
for(i=0,j=0;;i++,j++)
{
d[i]=n%b;
n=n/b;
if(n!=0)
continue;
else break;
}
for(i=0;i<=j;i++)
if(d[i]>=10)
d[i]=d[i]+55;
else
d[i]=d[i]+48;
for(i=j;i>=0;i--)
printf("%c",d[i]);
}
|
55 | 27467 | int main()
{
int a,b,i,e=0,num[100];
long n=0;
char sz[100];
scanf("%d%s%d",&a,sz,&b);
for(i=0;i<strlen(sz);i++)
{
if(sz[i]>='0'&&sz[i]<='9')
{
num[i]=sz[i]-'0';
}
if(sz[i]>='a'&&sz[i]<='z')
{
num[i]=sz[i]-'a'+10;
}
if(sz[i]>='A'&&sz[i]<='Z')
{
num[i]=sz[i]-'A'+10;
}
}
for(i=0;i<strlen(sz);i++)
{
n+=num[i]*pow(a,strlen(sz)-1-i);
}
while(n>=b)
{
num[e]=n%b;
n=n/b;
e++;
}
num[e]=n%b;
for(i=0;i<e+1;i++)
{
if(num[i]>=0&&num[i]<=9)
{
sz[i]=num[i]+'0';
}
if(num[i]>9)
{
sz[i]=num[i]+'A'-10;
}
}
for(i=e;i>=0;i--)
{
printf("%c",sz[i]);
}
return 0;
}
|
55 | 27468 | 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 | 27469 | void main()
{
int a,b,k,i,q,f=0;
char x[30],*p=x;
long n=0,t;
scanf("%d %s %d",&a,x,&b);
k=strlen(x)-1;
for(;k>=0;k--,p++)
{
if(*p>=48 && *p<=57) t=(long)*p-48;
else if(*p>=65 && *p<=90) t=(long)*p-55;
else if(*p>=97 && *p<=122) t=(long)*p-87;
i=k;
while(i>0)
{
t=t*a;
i--;
}
n+=t;
}
for(t=n,i=0;t>=b;i++)
{
t=t/b;
}
for(k=i,t=1;k>=0;k--,t=1)
{
i=k;
while(i>0)
{
t=t*b;
i--;
}
q=n/t;
if(q==0 && f==0) continue;
else if(f==0)
{
f=1;
goto z;
}
else
{
z: if(q>=0 && q<=9)
{
printf("%d",q);
}
else if(q>=10)
{
printf("%c",q+55);
}
n=n-q*t;
}
}
if(f==0) printf("0");
}
|
55 | 27470 | int main()
{
long a,b,i,n=0,t=0,sum;
char s[1000];
long q[1000];
char p[1000];
char m[1000];
scanf("%d %s %d",&a,s,&b);
for(i=0;s[i]!='\0';i++)
n=n+1;
for(i=0;i<=n-1;i++)
{
if(s[i]>='a'&&s[i]<='z')
s[i]=s[i]-'a'+10;
if(s[i]>='0'&&s[i]<='9')
s[i]=s[i]-'0';
if(s[i]>='A'&&s[i]<='Z')
s[i]=s[i]-'A'+10;
}
sum=1;
for(i=n-1;i>=0;i--)
{
t=s[i]*sum+t;
sum=sum*a;
}
if(t==0)
printf("0");
q[0]=t;
for(i=0;q[i]!=0;i++)
q[i+1]=q[i]/b;
for(i=0;q[i]!=0;i++)
{
p[i]=q[i]%b;
if(p[i]>9)
p[i]=p[i]-10+'A';
else
p[i]=p[i]+'0'-0;
}
p[i]='\0';
n=0;
for(i=0;p[i]!='\0';i++)
n=n+1;
for(i=0;i<=n-1;i++)
m[i]=p[n-i-1];
m[n]='\0';
printf("%s",m);
getchar();
getchar();
} |
55 | 27471 | char a[32];
int b[32];
char trans[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 main()
{
int n,m;
int i,j,k;
long int mid;
int ar;
scanf("%d %s %d",&n,a,&m);
int len=strlen(a);
for(k=0;k<len;k++)
{
if((a[k]>='0')&&(a[k]<='9'))
a[k]-='0';
if((a[k]>='a')&&(a[k]<='z'))
a[k]=a[k]-'a'+10;
if((a[k]>='A')&&(a[k]<='Z'))
a[k]=a[k]-'A'+10;
}
mid=0;
ar=1;
for(j=len-1;j>=0;j--)
{
mid+=a[j]*ar;
ar*=n;
}
k=0;
while(mid!=0)
{
b[k]=mid%m;
mid=mid/m;
k++;
}
for(i=k-1;i>=0;i--)
if(b[i]!=-1)
printf("%c",trans[b[i]]);
printf("\n");
return 0;
}
|
55 | 27472 | 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 | 27473 |
struct stack
{
char data[101];
int top;
};
long int change(int a, char *s);
int main()
{
long int a, b, n;
char str[101];
while(scanf("%ld %s %ld", &a, str, &b) != EOF)
{
n = change(a, str);
if(n == 0)
{
printf("0");
}else
{
int temp;
struct stack *s = (struct stack *)malloc(sizeof(struct stack));
s->top = 0;
while(n)
{
temp = n % b;
if(temp >= 0 && temp <= 9)
{
s->data[s->top ++] = temp + '0';
}else
{
s->data[s->top ++] = temp - 10 + 'A';
}
n /= b;
}
while(s->top)
{
printf("%c", s->data[-- s->top]);
}
}
printf("\n");
}
return 0;
}
long int change(int a, char *s)
{
int i, b;
long int n, c;
for(n = 0, c = 1, i = strlen(s) - 1; i >= 0; i --)
{
if(s[i] >= 'A' && s[i] <= 'Z')
b = s[i] - 55;
else if(s[i] >= 'a' && s[i] <= 'z')
b = s[i] - 87;
else
b = s[i] - '0';
n += b * c;
c *= a;
}
return n;
}
|
55 | 27474 | void main()
{
char shurudeshu[1000];int n,shijingzhi=0,i;
int jingzhi,daizhuanhuandejingzhi;
scanf("%d ",&jingzhi);scanf("%s ",shurudeshu);scanf("%d",&daizhuanhuandejingzhi);
n=strlen(shurudeshu);
for(i=0;i<=n-1;i++)
{
if(('A'<=shurudeshu[i])&&(shurudeshu[i]<='Z'))
shurudeshu[i]=shurudeshu[i]-'A'+10;
else if(('a'<=shurudeshu[i])&&(shurudeshu[i]<='z'))
shurudeshu[i]=shurudeshu[i]-'a'+10;
else if(('0'<=shurudeshu[i])&&(shurudeshu[i]<='9'))
shurudeshu[i]=shurudeshu[i]-'0';
}
for(i=0;i<=n-1;i++)
{
shijingzhi=shijingzhi+(int)(shurudeshu[i]*pow(jingzhi,n-i-1));
}
if(shijingzhi==0)
printf("%d",shijingzhi);
if(shijingzhi!=0)
{
int shang;int yushu[100],j;
shang=shijingzhi;
for(i=0;shang!=0;i++)
{
yushu[i]=shang%daizhuanhuandejingzhi;
shang=shang/daizhuanhuandejingzhi;
}
for(j=i-1;j>=0;j--)
{
if((0<=yushu[j])&&(yushu[j]<=9))
printf("%d",yushu[j]);
else if(yushu[j]>=10)
{
yushu[j]=yushu[j]+'A'-10;
printf("%c",yushu[j]);
}
}
}
printf("\n");
} |
55 | 27475 | int main()
{
int a,b,i,j,sum10=0,n10[100],nb[100],lenn,q;
char n[100],nc[100];
cin>>a>>n>>b;
lenn=strlen(n);
for(i=0;n[i]!='\0';i++)
{
if((n[i]>='a')&&(n[i]<='z'))
{
n10[i]=n[i]-'a'+10;
}else if((n[i]>='A')&&(n[i]<='Z'))
{
n10[i]=n[i]-'A'+10;
}else {n10[i]=n[i]-'0';}
for(j=1;j<=lenn-i-1;j++)
{
n10[i]=n10[i]*a;
}
sum10=sum10+n10[i];
}
if(sum10==0){cout<<0;}
else
{i=0;
while(sum10!=0)
{
nb[i]=sum10%b;
sum10=sum10/b;
i++;
}
for(j=i-1;j>=0;j--)
{
if(nb[j]>9)
{
nc[j]=nb[j]-10+'A';
}else nc[j]=nb[j]+'0';
cout<<nc[j];
}
}
cin>>q;
return 0;
}
|
55 | 27476 | int main()
{
int a,b,l; //?????????????????
long n=0;
char c[100];
cin>>a>>c>>b; //??
l=strlen(c);
for(int i=0;i<=l-1;i++) //????
if(c[i]<='z'&&c[i]>='a')
c[i]=c[i]-'a'+'A';
for(int i=0;i<l;i++) //??????
{
int m;
if(c[i]<='Z'&&c[i]>='A')
m=10+c[i]-'A';
else m=c[i]-'0';
n+=m*pow((double)a,l-i-1);
}
for(int i=0;;i++) //???????
{
int m;
m=n%b;
n=(n-m)/b;
if(m<10)
c[i]=m+'0';
else c[i]=m-10+'A';
if(n==0)
{
l=i+1;
break;
}
}
for(int i=l-1;i>=0;i--) //??
cout<<c[i];
return 0;
} |
55 | 27477 | int main(int argc, char* argv[])
{
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/=to;
}
for(i=len-1;i>=0;i--)
printf("%c",out[i]);
return 0;
}
|
55 | 27478 | int main()
{
int a,b,i=0,j=0,k=0,shijinzhi=0,power=1;
int x[30];
cin>>a;
x[0]=getchar()+1;
while(x[i]!=-16)
{
i++;
x[i]=getchar();
if(x[i]>96) x[i]-=87;
else if(x[i]>64) x[i]-=55;
else x[i]-=48;
}
if (x[1]==0) cout<<"0";
else
{
for(j=i-1;j>=1;j--)
{
shijinzhi+=x[j]*power;
power=power*a;
}
cin>>b;
i=0;
while(shijinzhi>0)
{
i++;
x[i]=shijinzhi%b;
shijinzhi=shijinzhi/b;
if(x[i]<10) x[i]+=48;
else x[i]+=55;
}
for(k=i;k>0;k--)
{
putchar(x[k]);
}
}
return 0;
}
|
55 | 27479 | 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 | 27480 | int power(long int a,long int i)
{
unsigned long j,k=1;
for (j=0;j<i;j++)
k=k*a;
return(k);
}
int main()
{
long int a,b,i,j,l,t,y,k;
unsigned long temp=0,x;
char p[100]={0},re[100]={0};
scanf("%d %s %d",&a,p,&b);
l=strlen(p);
for (i=0;i<l;i++)
{
if (p[l-1-i]>='a'&&p[l-1-i]<='z')
temp+=(p[l-1-i]-'a'+10)*power(a,i);
if (p[l-1-i]>='A'&&p[l-1-i]<='Z')
temp+=(p[l-1-i]-'A'+10)*power(a,i);
if (p[l-1-i]>='0'&&p[l-1-i]<='9')
temp+=(p[l-1-i]-'0')*power(a,i);
}
for (j=0;;j++)
{
x=power(b,j);
y=temp/x;
if (y<b)
break;
}
j++;
for (k=j-1;k>=0;k--)
{
x=power(b,k);
t=temp/x;
if (t>=10)
re[j-1-k]='A'+t-10;
else
re[j-1-k]='0'+t;
temp-=x*t;
}
printf("%s",re);
return (0);
}
|
55 | 27481 |
int chrtoint(char ch)
{
if (ch>='0' && ch<='9')
return ch-'0';
else if (ch>='A' && ch<='Z')
return ch-'A'+10;
else if (ch>='a' && ch<='z')
return ch-'a'+10;
else
return -1;
}
char inttochr(int a)
{
if (a>=0 && a<=9)
return (char)(a+'0');
else if (a>=10 && a<=35)
return (char)(a-10+'A');
else
return -1;
}
int main()
{
char str[100]={0};
long a, b;
long num;
scanf("%d %s %d", &a, str, &b);
int len=0, i;
while (str[len]>0)
len++; //???????
//a??->10??
num=0;
for (i=0;i<len;i++)
{
num=num*a+chrtoint(str[i]);
}
//10??->b??
str[0]='0';
len=0;
while (num>0)
{
str[len]=inttochr(num%b);
len++;
num/=b;
}
if (len==0) len++; //??0???
//????
for (i=len-1;i>=0;i--)
putchar(str[i]);
return 0;
}
|
55 | 27482 | int cifang(int u,int g)
{
long int l=1;
for(int i=1;i<=g;i++)
{
l=l*u;
}
return l;
}
int main()
{
int n,m;
long int sum=0;
char a[1000];
cin>>n;
cin>>a;
cin>>m;
char c[26]={'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 s=strlen(a);
for(int i=0;i<=s-1;i++)
{
if(a[i]>='0' && a[i]<='9')
{
int t=a[i]-'0';
sum=sum+t * cifang(n,s-1-i);
}
else if(a[i]>='A' && a[i]<='Z')
{
int t=a[i]-'A'+10;
sum=sum+t*cifang(n,s-1-i);
}
else if(a[i]>='a' && a[i]<='z')
{
int t=a[i]-'a'+10;
sum=sum+t*cifang(n,s-1-i);
}
}
int b[1000];
int j;
for(int d=0;d<=999;d++)
{
b[d]=sum%m;
sum=(sum-b[d])/m;
if(sum<m)
{
if (sum>0)
{
if(sum>10)
cout<<c[sum-10];
else
cout<<sum;
for(int f=d;f>=0;f--)
{
if(b[f]>=10)
{
cout<<c[b[f]-10];
}
else
{
cout<<b[f];
}
}
break;
}
else
{
for(int f=d;f>=0;f--)
{
if(b[f]>=10)
{
cout<<c[b[f]-10];
}
else
{
cout<<b[f];
}
}
break;
}
}
}
return 0;
} |
55 | 27483 | int main()
{
long int input,output,n,ex1[20000],ex2[20000],sum=0,s[20000],f[20000],g[20000],out[20000]; //?????????
char str1[20000],str2[20000],str3[20000]; //?????????
int i,j,k,l=0,m,h,o,p; //????????
cin>>input>>str1>>output; //?????? ???? ????
n=strlen(str1); //??????????
for(i=0;i<n;i++)
{ex1[i]=str1[i];} //????????????
for(j=0;j<n;j++)
{if((ex1[j]>=48)&&(ex1[j]<=57))
ex2[j]=ex1[j]-48;
else if((ex1[j]>=65)&&(ex1[j]<=90))
ex2[j]=ex1[j]-55;
else if((ex1[j]>=97)&&(ex1[j]<=122))
ex2[j]=ex1[j]-87;
} //??ascii????0z?????????
for(k=0;k<n;k++)
{sum=sum+ex2[k]*pow((double)input,n-1.0-k);} //??????????????
s[0]=sum;
while(s[l]>0)
{s[l+1]=s[l]/output;
f[l]=s[l]%output;
l=l+1;} //??????????????????????????????
for(m=0;m<l;m++)
g[m]=f[l-m-1];
for(h=0;h<m;h++){
if((g[h]>=0)&&(g[h]<=9))
out[h]=g[h]+48;
else if((g[h]>=10)&&(g[h]<=35))
out[h]=g[h]+55;
} //??acsii??????????????????????????
for(o=0;o<m;o++)
str3[o]=out[o]; //??acsii????????????????????????????????
for(p=0;p<m;p++)
cout<<str3[p];
if(sum == 0)
cout<<0;
//????
return 0;
}
|
55 | 27484 | 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 | 27485 | 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 | 27486 |
int main()
{
int i,j,a,b,l;
long s=0,ss[1001]={0};
char s1[1001],s2[1001];
cin>>a>>s1>>b;
l=strlen(s1);
for(i=0;i<1000;i=i+1)
s2[i]=',';
for(i=0;i<l;i=i+1)
{
if(s1[i]>='0'&&s1[i]<='9')
ss[i+1]=ss[i]*a+s1[i]-'0';
else if(s1[i]>='A'&&s1[i]<='Z')
ss[i+1]=ss[i]*a+s1[i]-'A'+10;
else
ss[i+1]=ss[i]*a+s1[i]-'a'+10;
}
s=ss[l];
for(i=0;i<1000;i=i+1)
{
j=s%b;
if(j<=9)
s2[i]='0'+j;
else
s2[i]='A'+j-10;
s=s/b;
if(s==0)
break;
}
for(i=0;i<1000;i=i+1)
if(s2[i]==',')break;
for(i=i-1;i>=0;i=i-1)
cout<<s2[i];
cout<<endl;
return 0;
}
|
55 | 27487 | int f1(char p);
char f2(int p);
void main()
{
long t=0;
char s[11],x[11]={""};
int a,b,i,k,n;
scanf("%d %s %d",&a,s,&b);
n=strlen(s);
for (i=0;i<=n-1;i++)
t=f1(s[i])+t*a;
n=0;
if (t==0) printf("0");
while(t!=0)
{ k=t%b;
t=(t-k)/b;
x[n]=f2(k);
n++;
}
for (i=n-1;i>=0;i--)
printf("%c",x[i]);
printf("\n");
}
int f1(char p)
{ int t;
if ((p>=48)&&(p<=57)) t=p-48;
else if ((p>=55)&&(p<=90)) t=p-55;
else t=p-87;
return(t);
}
char f2(int p)
{ char t;
if ((p>=0)&&(p<=9)) t=p+48;
else t=p+55;
return (t);
} |
55 | 27488 | void main()
{
unsigned long intonumber(char x);
char intochar(int y);
char str[N];
char former[3];
gets(str);
int i=0,c1=0,c2=0;
while(str[i]!=' ')
{
former[i]=intonumber(str[i]);
c2=c1+former[i];
c1=c2*10;
i++;
}
i++;
int j=0;
unsigned long n2=0,n1=0;char num[N];
while(str[i]!=' ')
{
num[j]=intonumber(str[i]);
n2=n1+num[j];
n1=n2*c2;
j++;i++;
}
i++;int k=0,l1=0,l2=0;char later[3];
while(str[i]!='\0')
{
later[k]=intonumber(str[i]);
l2=l1+later[k];
l1=l2*10;
i++;k++;
}
int f;char yu[M];
for(f=0;n2>0;f++)
{
yu[f]=intochar(n2%l2);
n2=n2/l2;
}
if(f==0)printf("%d",0);
for(f--;f>=0;f--)
printf("%c",yu[f]);
}
unsigned long intonumber(char x)
{
if(x>='a'&&x<='z')
x=x-87;
else if(x>='A'&&x<='Z')
x=x-55;
else if(x>=48&&x<=57)
x=x-48;
return(x);
}
char intochar(int y)
{
if(y>=0&&y<=9)
y=y+48;
else if(y>9&&y<=32)
y=y+55;
return(y);
}
|
55 | 27489 | main()
{
int a,b,i,sum=0,m,k,l;
char c[40];
scanf("%d %s %d",&a,c,&b);
m=strlen (c);
for(i=0;i<m;i++)
{
if (c[i]>='a')
c[i]=c[i]+'A'-'a';
if(c[i]>='A')
sum=(c[i]+10-'A')+sum*a;
else if(c[i]<='9')
sum=(c[i]-'0')+sum*a;
}
char d[40]={0};
l=sum;
for(i=0;;i++)
{
k=l%b;
l=l/b;
if(k<=9)
d[i]=k+'0';
else
d[i]=k-10+'A';
m=i+1;
if (l==0) break;
}
char e[m];
for(i=0;i<=m-1;i++)
{
e[m-1-i]=d[i];
}
e[m]='\0';
puts(e);
}
|
55 | 27490 | 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 | 27491 | main()
{
int x,y;int rest;int r,s,t;
char NUM[150];
scanf("%d %s %d",&x,NUM,&y);
int LEN;
LEN=strlen(NUM);
int i,j,k;int m=0,n=0;
char a='a',A='A',Z='Z',z='z';
char zero='0',nine='9';
for (i=0;i<LEN;i++)
{
if (NUM[i]>=a&&NUM[i]<=z)
NUM[i]=NUM[i]-a+10;
if (NUM[i]>=A&&NUM[i]<=Z)
NUM[i]=NUM[i]-A+10;
if (NUM[i]>=zero&&NUM[i]<=nine)
NUM[i]=NUM[i]-zero;
}
for (i=0;i<LEN;i++)
{
m=NUM[i];
for (j=1;j<=LEN-i-1;j++)
m*=x;
n+=m;
}
rest=n;
for (i=0;;i++)
{
if (rest==0) break;
rest/=y;
}
int PUT[1000];
int kk=i;
for (;kk>=1;kk--)
{
r=n%y;
n/=y;
PUT[kk-1]=r;
}
if (i==0) printf("0");
else for (j=0;j<i;j++)
{
if (PUT[j]>=10)
printf("%c",PUT[j]-10+A);
else
printf("%d",PUT[j]);
}
printf("\n");
}
|
55 | 27492 | int main ( )
{
int n1,n2,l,t;long s=0;char number1[40],number2[40],*p;
scanf("%d %s %d",&n1,number1,&n2);
l=strlen(number1);
for(p=number1;p<number1+l;p++)
{
if(*p>='0'&&*p<='9')
t=*p-'0';
else if(*p>='a'&&*p<='z')
t=*p-'a'+10;
else if(*p>='A'&&*p<='Z')
t=*p-'A'+10;
s=s*n1+t;
}
for(p=number2;1;p++)
{
if(s%n2>=0&&s%n2<=9)
*p=s%n2+48;
else if(s%n2>9)
*p=s%n2+55;
s=s/n2;
if(s==0)
break;
}
for(;p>=number2;p--)
printf("%c",*p);
printf("\n");
return 0;
} |
55 | 27493 | int main()
{
int a,b,num[100],top=0;//???????a?b
char s[100];//???????s
cin>>a;//??????
cin>>s;
cin>>b;
int i;
for(i=0;s[i]!='\0';i++){
if((s[i]>=65)&&(s[i]<=90))//???????????????
num[i]=s[i]-'A'+10;
else if((s[i]>=90)&&(s[i]<=122))//?????????????
num[i]=s[i]-'a'+10;
else if((s[i]>='0')&&(s[i]<='9'))//???????????
num[i]=s[i]-'0';
top++;
}
long int sum=0;//??sum
for(i=0;i<top;i++)//?sum????
sum=sum*a+num[i];
char s1[10000];//???????
int j;//??j
if(sum==0) cout<<"0"<<endl;//??sum??????0
else/* ???????? */
{for(j=0;sum;j++){
if((sum%b)>9) s1[j]=(char)((sum%b)-10+'A');
else s1[j]=(char)((sum%b)+'0');
sum=sum/b;
}
for(j=j-1;j>=0;j--){
cout<<s1[j];
}
cout<<endl;}
return 0;//?????
}
|
55 | 27494 | 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 | 27495 | void main()
{
int a,b,i,n,k,p[100];
long int m=0,j,q;
char in[100],t,out[100];
scanf("%d",&a);
for(i=0;i<=29;i++)
{
t=getchar();
n=i;
if(t==32)
{
if(i!=0)
{
break;
}
}
else
{
in[i-1]=t;
}
}
scanf("%d",&b);
for(i=0;i<=n-2;i++)
{
if(in[i]>47&&in[i]<58)
{
j=in[i]-48;
}
if(in[i]>64&&in[i]<91)
{
j=in[i]-55;
}
if(in[i]>96&&in[i]<123)
{
j=in[i]-87;
}
for(k=1+i;k<=n-2;k++)
{
j=j*a;
}
m=m+j;
q=m;
}
for(i=1;i<=500;i++)
{
m=m/b;
n=i;
if(m==0)
{
break;
}
}
for(i=0;i<=n-1;i++)
{
p[n-1-i]=(q%b);
q=q/b;
}
for(i=0;i<=n-1;i++)
{
if(p[i]>=0&&p[i]<=9)
{
out[i]=p[i]+48;
}
if(p[i]>=10&&p[i]<=35)
{
out[i]=p[i]+55;
}
}
for(i=0;i<=n-1;i++)
{
printf("%c",out[i]);
}
} |
55 | 27496 | main()
{
long int f(int y,int r);
int a,b,i,j,t=0;
long int q=0,w=0,p=0;
char n[800];
int m[1000];
scanf("%d",&a);
scanf("%s",n);
scanf("%d",&b);
if(n[0]=='0')
printf("%c",'0');
else
{
p=strlen(n);
for(i=0;i<p;i++)
{
if(n[i]>='A'&&n[i]<='Z')
n[i]=n[i]-'A'+10;
else if(n[i]>='a'&&n[i]<='z')
n[i]=n[i]-'a'+10;
else if(n[i]>='0'&&n[i]<='9')
n[i]=n[i]-'0';
}
w=0;
for(i=0;i<p;i++)
{
w=w*a+n[i];
}
for(j=0;;j++)
{
m[j]=w%b;
w=w/b;
if(w<b)
{ m[j+1]=w%b;
t=j+1;
break;
}
}
m[t+1]='\0';
for(i=t;i>=0;i--)
{
if(m[i]>9)
{
m[i]=m[i]+'A'-10;
printf("%c",m[i]);
}
else
printf("%c",m[i]+'0');
}
}
getchar();
getchar();
}
|
55 | 27497 |
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 | 27498 | void main()
{int a,b,l,i,t=0;
char n[100],m[100];
scanf("%d %s %d",&a,n,&b);
l=strlen(n);
for(i=0;i<l;i++)
{t*=a;
if(n[i]>='0'&&n[i]<='9')
t+=n[i]-'0';
else if(n[i]>='a'&&n[i]<='z')
t+=n[i]-'a'+10;
else
t+=n[i]-'A'+10;
}
if(t!=0)
{for(i=0;t!=0;i++)
{if(t%b>=0&&t%b<=9)
m[i]=t%b+'0';
else
m[i]=t%b-10+'A';
t=(t-t%b)/b;
}
for(t=i-1;t>=0;t--)
printf("%c",m[t]);
printf("\n");
}
else
printf("0\n");
} |
55 | 27499 | int main()
{
long int b,i=0,j=0,n_number[500],decdec=0,a2[10],k,ans[500],l;
int mi;
double a;
char n[500],ans2[500],a1[10];
a1[1]=48;
while((a1[i]=getchar())>=48) //??a
{
i++;
}
a2[0]=a1[0]-48;
a2[1]=a1[1]-48;
if(a2[1]>=0&&a2[1]<=9) a=a2[0]*10+a2[1];
else a=a2[0];
i=0;
while((n[i]=getchar())>=48) i++; //??n
cin>>b; //??b
i--;
for(j=0;j<=i;j++)
{
if(n[j]>=48&&n[j]<=57) n_number[j]=n[j]-48;
else if(n[j]>=65&&n[j]<=90) n_number[j]=n[j]-55;
else n_number[j]=n[j]-87;
}
mi=i;
for(l=0;l<=i;l++)
{
decdec=decdec+n_number[l]*pow(a,mi);
mi=mi-1;
} //??????10??????
if(decdec==0) cout<<"0";
else
{
k=0;
while(decdec>0)
{
ans[k]=decdec%b;
decdec=decdec/b;
k=k+1;
} //????????????b??????????
k--;
for(j=0;j<=k;j++)
{
if(ans[j]>=0&&ans[j]<=9) ans2[j]=ans[j]+48;
if(ans[j]>=10&&ans[j]<=35) ans2[j]=ans[j]+55;
} //???????????????????11?35??
for(j=k;j>=0;j--)
{
cout<<ans2[j];
} //??????
}
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.