id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
27,300 | int f(char n) //???????????????????
{int t;
if(n>47&&n<58) t=n-48;
else
{if(n>64&&n<91) t=n-55;
else
{
if(n>96&&n<123) t=n-87;
}
}
return t;
}
int main()
{
int a,i,s=0,k,b,g=1;
char n[32],m[32];//??????????????????
cin>>a>>n>>b;//??
for(i=0;i<strlen(n);i++)//????????????s
{ for(k=0;k<strlen(n)-i-1;k++)
g=g*a;
s=s+f(n[i])*g;
g=1;
}
i=0;//?i???0?????????
if(s==0) cout<<s;//?s?0???0
while(s!=0)
{ k=s%b;//?b???????????????
if (k>=10) m[i]=k+55;//?????10??????
else m[i]=k+48;//?????10????????????
s=s/b;//??s????????????
i++;//??m[i]
}
k=i;
for(i=k-1;i>=0;i--)
{ cout<<m[i];} //??????????
return 0;
}
| 55 |
27,301 |
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 |
27,302 | 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 |
27,303 | main()
{
int a,b,i,j,k,l,m,n;
long s=0;
int d[32];
char c[32],e[32];
scanf("%d %s %d",&a,c,&b);
if(c[0]=='0')
printf("%d\n",0);
else
{
n=strlen(c);
for(i=0;i<=n-1;i++)
{
if(c[i]<'A')
d[i]=c[i]-'0';
else if(c[i]>='A'&&c[i]<'a')
d[i]=c[i]-'A'+10;
else
d[i]=c[i]-'a'+10;
}
for(i=0;i<=n-1;i++)
{
k=d[i];
for(j=1;j<=n-1-i;j++)
k=k*a;
s=s+k;
}
for(i=0;s>0;i++)
{
l=s%b;
if(l<10)
e[i]=l+'0';
else
e[i]=l-10+'A';
s=s/b;
}
for(m=i-1;m>0;m--)
printf("%c",e[m]);
printf("%c\n",e[0]);
}
getchar();
getchar();
getchar();
} | 55 |
27,304 | int main()
{
int a,b,i,j,la,lb,decimal,number=0,t;
char str1[1000],str2[1000]={'\0'};
cin>>a;
cin.get();
cin.getline(str1,1000,' ');
cin>>b;
la=strlen(str1);
for(i=0;i<la;i++)
{
if (str1[i] >= '0' && str1[i] <= '9')
decimal = str1[i] - '0';
else if(str1[i]>='A'&&str1[i]<='Z')
decimal = str1[i] - 'A' + 10;
else
decimal=str1[i]-'a'+10;
number = number * a + decimal;
}
i=0;
do
{
str2[i]=number%b;
if(str2[i]>9)
str2[i]=str2[i]-10+'A';
else str2[i]=str2[i]+'0';
number=number/b;
i++;
}
while(number!=0);
t=i;
for(j=t-1;j>=0;j--)
{
cout<<str2[j];
}
return 0;
} | 55 |
27,305 | main()
{
int a,b,i,c,d,x[2000],s=0,e,l,k;
char s1[1000],s2[1000],y[2000];
scanf("%d %s %d",&a,s1,&b);
for(i=0;;i++)
{
if(s1[i]=='\0')
{
s2[i]='\0';
break;
}
if(s1[i]>='a'&&s1[i]<='z')
{
s1[i]=s1[i]-'a'+'A';
}
s2[i]=s1[i];
}
for(c=0;c<=i-1;c++)
{
if(s2[c]>='A'&&s2[c]<='Z')
x[c]=s2[c]-55;
else
x[c]=s2[c]-48;
}
for(d=i-1;d>=0;d--)
{
e=i-1-d;
if(e!=0)
{do
{
x[d]=x[d]*a;
e--;
}
while(e>0);}
if(e==0)
x[d]=x[d];
s=s+x[d];
}
if(s!=0)
{
for(l=0;s!=0;l++)
{
if(s%b<=9)
y[l]=s%b+'0';
else
y[l]=s%b+'7';
s=s/b;
}
for(k=l-1;k>=0;k--)
printf("%c",y[k]);
}
else
printf("0");
} | 55 |
27,306 | int convert1(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 convert2(int a)
{
if ((a >= 0) && (a <= 9))
return (a + 48);
else
return (a + 55);
}
int main()
{
int a , b , len , k = 1 , i , j;
long t = 0;
char num[100] , p;
int num1[100];
cin >> a >> num >> b;
len = strlen(num);
for (i = len - 1 ; i >= 0 ; i--)
{
t = t + k * convert1(num[i]);
k = k * a;
}
i = 1;
while(t >= b)
{
num1[i] = t % b;
i++;
t = t / b;
}
num1[i] = t;
for (j = i ; j >= 1; j--)
{
p = convert2(num1[j]);
cout << p;
}
return 0;
}
| 55 |
27,307 | 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 |
27,308 | void main()
{
char s[20]="0",d[20],k;
int a,b,c,i=0,e;
long n=0;
scanf("%d ",&a);
while((s[i]=getchar())!=' ')
{
i++;
}
scanf("%d",&b);
c=strlen(s)-1;
for(i=c-1;i>=0;i--)
{
if (s[i]>=65&&s[i]<=90)
s[i]=s[i]-55;
else if (s[i]>=48&&s[i]<=57)
s[i]=s[i]-48;
else if (s[i]>=97&&s[i]<=122)
s[i]=s[i]-87;
n=n+s[i]*pow(a,c-1-i);
}
i=0;
e=n;
do
{
d[i]=e%b;
if (d[i]>=10)
d[i]=d[i]+55;
else d[i]=d[i]+48;
i++;
e=e/b;
}while (e!=0);
for(i=i-1;i>=0;i--)
{
if (i!=0)
printf("%c",d[i]);
else printf("%c\n",d[i]);
}
} | 55 |
27,309 | int main()
{
int a,b,i,l,t=0,x;
long m=0;
char n[2][100];
scanf("%d %s %d",&a,n[0],&b);
l=strlen(n[0]);
if (a<=10)
{
for(i=0;i<l;i++)
{
m=m*a+n[0][i]-'0';
}
}
else
{
for(i=0;i<l;i++)
{
if((n[0][i]>='0')&&(n[0][i]<='9'))
m=m*a+n[0][i]-'0';
if((n[0][i]>='A')&&(n[0][i]<='Z'))
m=m*a+n[0][i]-'A'+10;
if((n[0][i]>='a')&&(n[0][i]<='z'))
m=m*a+n[0][i]-'a'+10;
}
}
x=m;
while(x>=b)
{
x=x/b;
t++;
}
for(i=t;i>=0;i--)
{
if(m%b>=0&&m%b<10)
{
n[1][i]=m%b+'0';
m=(m-n[1][i]+'0')/b;
}
else if(m%b>=10&&m%b<36)
{
n[1][i]=m%b-10+'A';
m=(m-n[1][i]-10+'A')/b;
}
}
for(i=0;i<=t;i++)
printf("%c",n[1][i]);
return 0;
}
| 55 |
27,310 |
int main()
{
int a,b,c,i,d=0,e;
char h[25];
char n[20];
int s[20];
cin>>a>>n>>b;
c=strlen(n);
for(i=0;i<=c-1;i++)
{
if(isdigit(n[i])!=0)
d=d+(n[i]-48)*(int)pow((double)a,c-1-i);
else if(islower(n[i])!=0)
d=d+(n[i]-87)*(int)pow((double)a,c-1-i);
else
d=d+(n[i]-55)*(int)pow((double)a,c-1-i);
}
for(i=0;d>=b;i++)
{
if(d%b<10)
h[i]=d%b+48;
else
h[i]=d%b+55;
d=d/b;
}
if(d<10)
h[i]=d+48;
else
h[i]=d+55;
for(;i>=0;i--)
cout<<h[i];
return 0;
}
| 55 |
27,311 | //*****************
//???????
//?????
//???2011-11-16
//*****************
char function(int); //????
int main()
{
int a, b, k = 0, sum = 0, t, i = 0, count = 0;
int sum1 = 1;
char n[100000], c[100000];
cin >> a >> n >> b;
for(i = 0;n[i] != '\0';i++) //??n????
k++;
for(i = k - 1;i >= 0;i--)
{
if(n[i] - '0' <= 9) //????n???10???
sum = sum + (n[i] - '0') * sum1;
if(n[i] - '0' > 9 && n[i] - '0' <= 42)
sum = sum +(n[i] - '0' - 7) * sum1;
if(n[i] - '0' > 42 && n[i] - '0' <= 74)
sum = sum + (n[i] - '0' - 39) * sum1;
sum1 = sum1 * a;
}
for(i = 0;;i++)
{
t = sum % b; //???
sum = sum / b;
c[i] = function(t);
count++; //?????????
if(sum == 0)
break;
}
for(i = count - 1;i >= 0;i--)
cout << c[i]; //??????
return 0;
}
char function(int t) //??????????????
{
char a[37] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
return a[t];
} | 55 |
27,312 | int main()
{
char input[100], output[100];
int in, out, num = 0, tmp, tmp1;
cin >> in >> input >> out;
for (int i = 0; input[i] != '\0'; i++)
{
if (input[i] > 47 && input[i] < 58)
tmp = input[i] - 48;
else if (input[i] > 64 && input[i] < 91)
tmp = input[i] - 55;
else
tmp = input[i] - 87;
num = num * in + tmp;
}
int i = 0;
for (;num != 0; i++)
{
tmp1 = num % out;
if (tmp1 < 10)
output[i] = tmp1 + 48;
else
output[i] = tmp1 + 55;
num /= out;
}
if (i == 0)
{
output[i] = 48;
i++;
}
for (int j = i - 1; j >= 0; j--)
{
cout << output[j];
}
cout << endl;
return 0;
}
| 55 |
27,313 | long int num(long int x,int i,int b)
{
long int a;
a=x;
int j;
for (j=0;j<i;j++)
a=a*b;
return a;
}
void main ()
{
int a,b,i,j,length;
char shu[100],zhuanhuan[100];
scanf("%d %s %d",&a,shu,&b);
long int k=0;
length=strlen(shu);
long int l;
for (i=0;i<length-1;i++)
{
if( ((shu[i]>='A')&&(shu[i]<='Z')))
{
l=shu[i]-'A'+10;
k=k+num(l,length-i-1,a);
}
if(((shu[i]>='0')&&(shu[i]<='9')))
{
l=shu[i]-'0';
k=k+num(l,length-i-1,a);
}
if( ((shu[i]>='a')&&(shu[i]<='z')))
{
l=shu[i]-'a'+10;
k=k+num(l,length-i-1,a);
}
}
if ((shu[length-1]>='A')&&(shu[length-1]<='Z'))
k=k+shu[length-1]-'A'+10;
if(((shu[length-1]>='0')&&(shu[length-1]<='9')))
k=k+shu[length-1]-'0';
if ((shu[length-1]>='a')&&(shu[length-1]<='z'))
k=k+shu[length-1]-'a'+10;
int m=0;
int n;
long int f=k;
do
{
n=f%b;
if ((n>=0)&&(n<=9))
{
zhuanhuan[m]=n+'0';
m++;
}
else
{
zhuanhuan[m]=n-10+'A';
m++;
}
f=f/b;
}while(f!=0);
for (i=m-1;i>=0;i--)
printf("%c",zhuanhuan[i]);
printf("\n");
} | 55 |
27,314 | int main()
{
long int a,b,s=0,i,j=0,t;
char c[100],d[100];
scanf("%d %s %d",&a,c,&b);
for(i=0;i<strlen(c);i++)
{
if(c[i]<='9')
s=s*a+c[i]-'0';
else if(c[i]>='a')
s=s*a+c[i]-'a'+10;
else s=s*a+c[i]-'A'+10;
}
if(s>0)
{
while(s>0)
{
t=s%b;
if(t<=9)
d[j]=t+48;
else d[j]=t+55;
j++;
s=s/b;
}
for(i=j-1;i>=0;i--)
printf("%c",d[i]);
}
else printf("0");
}
| 55 |
27,315 | int main()
{
long int a,b,i,m,j=0,c=0,d=0,k=0;
char s[100];
scanf("%d %s %d",&a,s,&b);
char x[100];
if(s[0]!=0)
{
for(i=0;s[i]!='\0';i++)
{
if(s[i]=='9')
s[i]=9;
else if(s[i]=='8')
s[i]=8;
else if(s[i]=='7')
s[i]=7;
else if(s[i]=='6')
s[i]=6;
else if(s[i]=='5')
s[i]=5;
else if(s[i]=='4')
s[i]=4;
else if(s[i]=='3')
s[i]=3;
else if(s[i]=='2')
s[i]=2;
else if(s[i]=='1')
s[i]=1;
else if(s[i]=='0')
s[i]=0;
else if(s[i]=='A'||s[i]=='a')
s[i]=10;
else if(s[i]=='B'||s[i]=='b')
s[i]=11;
else if(s[i]=='C'||s[i]=='c')
s[i]=12;
else if(s[i]=='D'||s[i]=='d')
s[i]=13;
else if(s[i]=='E'||s[i]=='e')
s[i]=14;
else if(s[i]=='F'||s[i]=='f')
s[i]=15;
else if(s[i]=='G'||s[i]=='g')
s[i]=16;
else if(s[i]=='H'||s[i]=='h')
s[i]=17;
else if(s[i]=='I'||s[i]=='i')
s[i]=18;
else if(s[i]=='J'||s[i]=='j')
s[i]=19;
else if(s[i]=='K'||s[i]=='k')
s[i]=20;
else if(s[i]=='L'||s[i]=='l')
s[i]=21;
else if(s[i]=='M'||s[i]=='m')
s[i]=22;
else if(s[i]=='N'||s[i]=='n')
s[i]=23;
else if(s[i]=='O'||s[i]=='o')
s[i]=24;
else if(s[i]=='P'||s[i]=='p')
s[i]=25;
else if(s[i]=='Q'||s[i]=='q')
s[i]=26;
else if(s[i]=='R'||s[i]=='r')
s[i]=27;
else if(s[i]=='S'||s[i]=='s')
s[i]=28;
else if(s[i]=='T'||s[i]=='t')
s[i]=29;
else if(s[i]=='U'||s[i]=='u')
s[i]=30;
else if(s[i]=='V'||s[i]=='v')
s[i]=31;
else if(s[i]=='W'||s[i]=='w')
s[i]=32;
else if(s[i]=='X'||s[i]=='w')
s[i]=33;
else if(s[i]=='Y'||s[i]=='y')
s[i]=34;
else if(s[i]=='Z'||s[i]=='z')
s[i]=35;
j++;
}
for(i=0;i<j;i++)
{
m=pow(a,j-i-1);
c=s[i]*m;
d=d+c;
}
for(i=0;d!=0;i++)
{
x[i]=d%b;
d=d/b;
k++;
}
for(i=0;i<k;i++)
{
if(x[i]==35)
x[i]='Z';
else if(x[i]==34)
x[i]='Y';
else if(x[i]==33)
x[i]='X';
else if(x[i]==32)
x[i]='W';
else if(x[i]==31)
x[i]='V';
else if(x[i]==30)
x[i]='U';
else if(x[i]==29)
x[i]='T';
else if(x[i]==28)
x[i]='S';
else if(x[i]==27)
x[i]='R';
else if(x[i]==26)
x[i]='Q';
else if(x[i]==25)
x[i]='P';
else if(x[i]==24)
x[i]='O';
else if(x[i]==23)
x[i]='N';
else if(x[i]==22)
x[i]='M';
else if(x[i]==21)
x[i]='L';
else if(x[i]==20)
x[i]='K';
else if(x[i]==19)
x[i]='J';
else if(x[i]==18)
x[i]='I';
else if(x[i]==17)
x[i]='H';
else if(x[i]==16)
x[i]='G';
else if(x[i]==15)
x[i]='F';
else if(x[i]==14)
x[i]='E';
else if(x[i]==13)
x[i]='D';
else if(x[i]==12)
x[i]='C';
else if(x[i]==11)
x[i]='B';
else if(x[i]==10)
x[i]='A';
else if(x[i]==9)
x[i]='9';
else if(x[i]==8)
x[i]='8';
else if(x[i]==7)
x[i]='7';
else if(x[i]==6)
x[i]='6';
else if(x[i]==5)
x[i]='5';
else if(x[i]==4)
x[i]='4';
else if(x[i]==3)
x[i]='3';
else if(x[i]==2)
x[i]='2';
else if(x[i]==1)
x[i]='1';
else if(x[i]==0)
x[i]='0';
}
for(i=k-1;i>=0;i--)
{
printf("%c",x[i]);
}
}
if(s[0]==0)
printf("0\n");
return 0;
}
| 55 |
27,316 |
int main()
{ int a,b,i,j=0,decimal,number=0;
char n[20],m[20];
cin>>a>>n>>b;
for(i=0;n[i]!='\0';i++)
if (n[i]>='a'&&n[i]<='z') n[i]-=32;
for(i=0;n[i]!='\0';i++)
{ if(n[i]>='0'&&n[i]<='9') decimal=n[i]-'0';
else decimal=n[i]-'A'+10;
number=a*number+decimal;
}
while (number>=b)
{ if((number%b)>=10)
m[j]=number%b-10+'A';
else m[j]=number%b+'0';
number=number/b;
j++;
}
if(number>=10) m[j]=number-10+'A';
else m[j]=number+'0';
for(i=j;i>=0;i--)
cout<<m[i];
return 0;
}
| 55 |
27,317 | 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 |
27,318 | void main()
{
int l,x,y,i,j;
long n;
char a[100],b[100];
n=0;
scanf("%d %s %d",&x,a,&y);
l=strlen(a);
for(i=0;i<l;i++)
{
if(a[i]<58)
n=x*n+a[i]-48;
else if(a[i]>96)
n=x*n+a[i]-87;
else
n=x*n+a[i]-55;
}
for(i=0;n!=0;i++)
{
if(n%y<10)
b[i]=n%y+48;
else
b[i]=n%y+55;
n=(n-n%y)/y;
}
if(i==0)
printf("0");
for(j=i-1;j>=0;j--)
printf("%c",b[j]);
printf("\n");
}
| 55 |
27,319 |
int main ()
{
char string1[1000];
int b,i;
long c = 0;;
int a;
cin>>a>>string1;
b=strlen(string1);
for(i=0;i<b;i++)
{
if(string1[i]>='0'&&string1[i]<='9')
c+=(string1[i]-'0')*pow(a,b-i-1);
if(string1[i]>='a'&&string1[i]<='z')
c+=(string1[i]-'a' + 10)*pow(a,b-i-1);
if(string1[i]>='A'&&string1[i]<='Z')
c+=(string1[i]-'A'+10)*pow(a,b-i-1);
//cout << c<<endl;
}
//cout << c<<endl;
int index = 0;
char string2[1000];
int d;
cin >> d;
int e;
if(c == 0)
cout << '0' << endl;
while(c != 0)
{
e = c % d;
c = c / d;
if(e >= 10)
string2[index] = 'A' + e - 10;
else
string2[index] = '0' + e;
index ++;
}
string2[index] = '\0';
for( i = index - 1;i>=0;i--)
cout<<string2[i];
cout<<endl;
//cout<<string2<<endl;
//while(1);
return 0;
} | 55 |
27,320 | int f(char c)
{
int w;
if(c>='0' && c<='9')
{
w=c-'0';
return w;
}
if(c>='a' && c<='z')
{
w=c-'a'+10;
return w;
}
if(c>='A' && c<='Z')
{
w=c-'A'+10;
return w;
}
}
char g(int a)
{
char c;
if(a>=0 && a<9)
{
c=a+'0';
return c;
}
if(a>=10)
{
c=a-10+'A';
return c;
}
}
int main()
{
int a,b,i,j,l,x;
long sum=0,y;
char n[10];
scanf("%d %s %d",&a,n,&b);
if(a==b)
printf("%s\n",n);
else
{
l=strlen(n);
for(i=0;i<l;i++)
{
x=f(n[i]);
y=(long)pow(a,l-i-1);
sum=sum+x*y;
}
if(sum==0)
printf("0");
else
{
char m[50];
long z;
l=(int)(log(sum)/log(b));
for(i=0;i<=l;i++)
{
if(i==l)
{
z=sum;
m[i]=g(z);
}
else
{
for(j=1;j<=b;j++)
{
z=j*pow(b,l-i);
if(z>sum)
{
z=(j-1)*pow(b,l-i);
sum=sum-z;
m[i]=g(j-1);
break;
}
}
}
}
for(i=0;i<=l;i++)
printf("%c",m[i]);
printf("\n");
}
}
return 0;
}
| 55 |
27,321 |
int main()
{
int a,b;
char c[PI];
scanf("%d %s %d",&a,c,&b);
int len;
len=strlen(c);
int i;
for (i=0;i<len;i++)
{
if (c[i]>='a'&&c[i]<='z')
{
c[i]=c[i]-32;
}
}
long int sum=0;
i=0;
int tmp;
int j=len;
while (i<len)
{
if (c[i]>=65&&c[i]<=90)
{
tmp=(c[i]-55)*(long int)pow(a,j-1);
}
if (c[i]>=48&&c[i]<=57)
{
tmp=(c[i]-48)*(long int)pow(a,j-1);
}
sum+=tmp;
j--;
i++;
}
char d[PI];
i=0;
if (sum==0)
printf("0");
while (sum!=0)
{
d[i]=sum%b;
sum=sum/b;
i++;
}
for (j=i-1;j>=0;j--)
{
if (d[j]>=0&&d[j]<=9)
{
printf("%c",d[j]+48);
}
if (d[j]>=10&&d[j]<=35)
{
printf("%c",d[j]+55);
}
}
return 0;
} | 55 |
27,322 | main()
{
int a,b;
int i,m=0;
long int n=0;
char w;
int f;
char s[64];
char t[64];
char *p;
char *r;
p=s;
r=t;
scanf("%d",&a);
scanf("%s",s);
scanf("%d",&b);
while ((*p)!='\0')
{
if ((*p)>='A'&&(*p)<='Z')
n=n*a+((*p)-'A'+10);
else if ((*p)>='a'&&(*p)<='z')
n=n*a+((*p)-'a'+10);
else if((*p)>='0'&&(*p)<='9')
n=n*a+((*p)-'0');
p++;
}
if (n==0)
printf("%d",n);
while(n!=0)
{
f=n%b;
n=n/b;
if (f>9)
*r='A'+f-10;
else *r=f+'0';
r++;
m++;
}
for(i=0;i<m/2;i++)
{
w=t[i];
t[i]=t[m-1-i];
t[m-1-i]=w;
}
for(i=0;i<m;i++)
{
printf("%c",t[i]);
}
}
| 55 |
27,323 | int main()
{
int a = 0, b = 0, length1 = 0, c = 0;
char shuru[200], result[200];
int result1[200];
cin >> a >> shuru >> b;
length1 = strlen(shuru);
int i = 0, j = 0, num = 0, l = 0;
for(i = 0; i <= length1 - 1; i++)
{
l = 0;
if(shuru[i] >= '0' && shuru[i] <= '9')
{
l = (int)shuru[i] - (int)'0';
}
if(shuru[i] >= 'a' && shuru[i] <= 'z')
{
l = (int)shuru[i] - (int)'a' + 10;
}
if(shuru[i] >= 'A' && shuru[i] <= 'Z')
{
l = (int)shuru[i] - (int)'A' + 10;
}
num = num * a + l;
}
while(1)
{
result1[j] = num % b;
num = num / b;
if(result1[j] >= 10)
{
result[j] = 'A' + result1[j] - 10;
}
else
{
result[j] = '0' + result1[j];
}
j++;
if(num == 0)
{
break;
}
}
c = j - 1;
for(i = c; i >= 0; i--)
{
cout << result[i];
}
cout << endl;
return 0;
} | 55 |
27,324 | main()
{
char a[100],b[100],c[100];
int m,n,i,k,t,q;
long j;
for(i=0;i<100;i++)
b[i]=0;
scanf("%d %s %d",&m,a,&n);
i=0;
j=0;
t=0;
q=0;
while(a[q]!=0)
{
t=t+(a[q]!='0');
q++;
}
if(t!=0)
{
while(a[i]!=0)
{
if(a[i]<='9')
k=a[i]-'0';
else
{
if(a[i]<='Z')
k=10+a[i]-'A';
else
k=10+a[i]-'a';
}
j=j*m+k;
i++;
}
i=0;
while(j!=0)
{
b[i]=j%n;
j=j/n;
i++;
}
for(j=0;j<=i-1;j++)
{
if(b[i-j-1]<=9)
c[j]=b[i-j-1]+'0';
else
c[j]=b[i-j-1]-10+'A';
}
for(j=0;j<100;j++)
{
if(!((c[j]>='0'&&c[j]<='9')||(c[j]>='A'&&c[j]<='Z')))
c[j]=0;
}
printf("%s\n",c);
}
else
printf("0\n");
}
| 55 |
27,325 | 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 |
27,326 | int f(int x,int y)
{
int j,p=1;
for(j=0;j<y;j++)
p=p*x;
return(p);
}
int main()
{
char a[100];
int i,m,n,p[100],t[100],q;
long int num=0;
scanf("%d %s %d",&m,a,&n);
q=strlen(a);
for(i=0;i<q;i++)
{
if(a[i]>='a'&&a[i]<='z')
a[i]=a[i]+'A'-'a';
if(a[i]>='0'&&a[i]<='9')
p[i]=a[i]-'0';
else if(a[i]>='A'&&a[i]<='Z')
p[i]=a[i]-'A'+10;
}
for(i=q-1;i>=0;i--)
num=num+p[i]*f(m,q-i-1);
for(i=0;num>=n;i++)
{
t[i]=num%n;
num=num/n;
}
t[i]=num%n;
for(;i>=0;i--)
{
if(t[i]>=0&&t[i]<=9)
p[i]=t[i]+'0';
else if(t[i]>=10&&t[i]<26)
p[i]=t[i]+'A'-10;
printf("%c",p[i]);
}
return 0;
} | 55 |
27,327 |
int main()
{
int shu=0,j,i,a,b,mm;
char m[100],n[100];
cin>>a;
cin.get();
cin>>m;
cin>>b;
for(i=0;m[i]!='\0';i++)
{if(m[i]>=65&&m[i]<=90) m[i]=m[i]+32;}
for(i=0;m[i]!='\0'; i++)
{
if(m[i]>=48&&m[i]<=57) mm=m[i]-48;
else mm=m[i]-97+10;
shu=shu*a+mm;
}
if(shu==0) cout<<shu<<endl;
for(i=0;shu!=0;i++)
{
n[i]=shu%b;
if(n[i]>=9) n[i]=n[i]+55;
else n[i]=n[i]+48;
shu=shu/b;
}
for(j=i-1;j>=0;j--) cout<<n[j];
return 0;
} | 55 |
27,328 | main()
{
int a,b,i,j,h,s,g,p,q,l;
char n[100];
int m[100];
char z[100];
scanf("%d %s %d",&a,n,&b);
l=strlen(n) ;
h=0;
for(i=1,g=1,s=0;i<=l;i++)
{ if(n[l-i]>='a'&&n[l-i]<='z')
h=n[l-i]-'a'+10;
else
{if(n[l-i]>='A'&&n[l-i]<='Z')
h=n[l-i]-'A'+10;
else
h=n[l-i]-'0';}
s=s+h*g;
g=g*a; }
if(s==0) printf("0");
else
{
for(j=0;s>0;j++)
{ m[j]=s%b;
s=s/b;
q=j;}
for(p=0;p<=q;p++)
{ if (m[p]>=0&&m[p]<=9)
z[q-p]=m[p]+'0';
else
z[q-p]=m[p]+'A'-10; }
z[q+1]='\0';
printf("%s",z);
}
}
| 55 |
27,329 | int main(int argc, char* argv[])
{
int from,to,i,j;
long sum=0;
char in[255],out[255]="0";
scanf ("%d%s%d",&from,in,&to);
char s10[100],s[]="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
for (i='0';i<='9';i++)
s10[i]=i-'0';
for (i='a';i<='z';i++)
s10[i]=i-'a'+10;
for (i='A';i<='Z';i++)
s10[i]=i-'A'+10;
for (i=0;in[i]!='\0';i++)
sum=sum*from+s10[in[i]];
for (i=0;i<255;i++)
{
out[i]=s[sum%to];
sum=sum/to;
if (sum==0) break;
}
for (j=i;j>=0;j--)
printf ("%c",out[j]);
return 0;
} | 55 |
27,330 | //????
//2010?11?16?
//1000012753 ???
int main()
{
char str1[200];
char stdard[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 i, j, l1, l2, l3, r, str2[200];
double a, b, medium = 0.0;
cin >> a >> str1 >> b;
l1 = strlen(str1);
for (i = 0; i < l1; i++)
{
if (str1[i] >= 'a' && str1[i] <= 'z')
str1[i] -= 'a' - 'A';
}
j = 0;
for (i = l1 - 1; i >= 0; i--)
str2[j++] = str1[i];
for (i = 0; i < l1; i++)
{
for (j = 0; j < 36; j++)
{
if (str2[i] == stdard[j])
medium += j * pow (a, i);
}
}
// cout << medium;
j = 0;
while ((int)medium >= (int)b)
{
str2[j++] = (int)medium % (int)b;
medium = (int)medium/(int)b;
}
str2[j] = (int)medium;
for ( ; j >= 0; j--)
cout << stdard[str2[j]];
cout << endl;
// itoa(medium, buf, (int)b);
/* l2 = strlen(buf);
r = 0;
for (i = 0; i < l2; i++)
{
r = ((r * 10) + buf[i] - '0') % (int)b;
for (j = 0; j < 36; j++)
{
if (j == r)
{
str2[i] = stdard[j];
break;
}
}
}
str2[i] = '\0';
l3 = strlen(str2);
for (i = l3 - 1; i >= 0; i--)
cout << str2[i];
cout << endl;*/
return 0;
}
| 55 |
27,331 | void main()
{
long a,b,k,h,n,i,m;
char s[100],t[100];
scanf("%d%s%d",&a,&s,&b);
n=strlen(s);
for(k=0,i=0;i<n;i++)
{
if(s[i]<='Z'&&s[i]>='A')
s[i]=s[i]-55;
else if(s[i]<='z'&&s[i]>='a')
s[i]=s[i]-87;
else
s[i]=s[i]-48;
for(h=1,m=(int)s[i];h<=n-i-1;h++)
m=m*a;
k=k+m;
}
h=0;
if(k!=0)
{
while (k!=0)
{
t[h]=k%b;
h++;
k=k/b;
}
for(i=h-1;i>=0;i--)
{
if(t[i]<10)
t[i]=t[i]+48;
else
t[i]=t[i]+55;
printf("%c",t[i]);
}
}
else
printf("0");
printf("\n");
}
| 55 |
27,332 |
int fim[255], map[37]; char C[1000];
int main(void) {
int a, b; char ch[100];
for (int i = 0; i <= 36; i++) if (i <= 9) fim[i + 48] = i; else fim['a' + i - 10] = i; //??????
for (int i = 0; i <= 36; i++) if (i <= 9) map[i] = i + 48; else map[i] = i + 'A' - 10; //??
scanf("%d %s %d", &a, ch, &b);
int S = 0;
for (int i = 0; i < (int)strlen(ch); i++) {
ch[i] = tolower(ch[i]);
S = S * a + fim[ch[i]];
} //??????
if (S == 0) {
puts("0");
} else {
int l = 0;
while (S)
C[l++] = map[S % b], S /= b; //???b??
reverse(C, C + l);
puts(C);
}
return 0;
}
| 55 |
27,333 | //????????
int main()
{
int i,m,len,num,sum=0,n,j=0;//????
char zi[1000];
int goal[1000];
cin>>m>>zi>>n;//??
len=strlen(zi);
for(i=0;i<len;i++)
{
if(zi[i]>64&&zi[i]<91)
num=(int)zi[i]-55;
else if(zi[i]>96&&zi[i]<123)
num=(int)zi[i]-87;
else
num=(int)zi[i]-48;
sum=sum+num*pow(m*1.0,len-i-1);//??????
}
while(sum>=n)
{
goal[j]=sum%n;
sum=sum/n;
j++;//???n??
}
goal[j]=sum;
for(i=j;i>=0;i--)
{
if(goal[i]>=10)
cout<<(char)(goal[i]+55);//????
else
cout<<goal[i];
}
cout<<endl;
return 0;
} | 55 |
27,334 | int b;
void main()
{ void PF(int k);
int a; char n[10];int i,len;
scanf("%d %s %d",&a,n,&b);
len=strlen(n);
int sum=0;
for(i=0;i<len;i++)
{
if(n[i]>='0'&&n[i]<='9')
sum=sum*a+n[i]-'0';
else
if(n[i]>='a'&&n[i]<='z')
sum=sum*a+n[i]-'a'+10;
else
sum=sum*a+n[i]-'A'+10;
}
PF(sum);
}
void PF(int k)
{
if(k<b)
{
if(k>=0&&k<=9)
printf("%c",k+'0');
else
printf("%c",k-10+'A');
}
else
{
PF(k/b);
if(k%b>=0&&k%b<=9)
printf("%c",k%b+'0');
else
printf("%c",k%b-10+'A');
}
}
| 55 |
27,335 | //*********************************************
//*??????? **
//*?????? 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 |
27,336 | int main()
{
int i,j,len,a,b,t=0;
long shu1;
char s[100];
int c[100];
scanf("%d",&a);
scanf("%s",s);
scanf("%d",&b);
len=strlen(s);
if(a<=10)
{
shu1=s[0]-'0';
for(i=1;i<len;i++)
{
shu1=shu1*a+s[i]-'0';
}
}
else
{
if(s[0]>='0'&&s[0]<='9')
shu1=s[0]-'0';
else if(s[0]>='a'&&s[0]<='z')
shu1=s[0]-'a'+10;
else if(s[0]>='A'&&s[0]<='Z')
shu1=s[0]-'A'+10;
for(i=1;i<len;i++)
{
if(s[i]>='0'&&s[i]<='9')
shu1=shu1*a+s[i]-'0';
else if(s[i]>='a'&&s[i]<='z')
shu1=shu1*a+s[i]-'a'+10;
else if(s[i]>='A'&&s[i]<='Z')
shu1=shu1*a+s[i]-'A'+10;
}
}
if(b<=10)
{
if(shu1==0)
printf("0\n");
else
{
for(i=0;shu1!=0;i++)
{
c[i]=shu1%b;
shu1=shu1/b;
}
for(j=i-1;j>=0;j--)
{
printf("%d",c[j]);
}
printf("\n");
}
}
else if(b>10)
{
if(shu1==0)
printf("0\n");
else
{
for(i=0;shu1!=0;i++)
{
c[i]=shu1%b;
shu1=shu1/b;
}
for(j=i-1;j>=0;j--)
{
if(c[j]>=10)
printf("%c",'A'+c[j]-10);
else
printf("%d",c[j]);
}
}
printf("\n");
}
return 0;
}
| 55 |
27,337 | void main()
{
char c[101],q[101];
int a,i,j,b,len;
long int p=0,x,d;
scanf("%d",&a);
scanf("%s",c);
scanf("%d",&b);
len=strlen(c);
for(i=0;i<len;i++)
{
if((c[i]>='A')&&(c[i]<='Z')) x=c[i]-'A'+10;
else if((c[i]>='a')&&(c[i]<='z')) x=c[i]-'a'+10;
else x=c[i]-'0'+0;
for(j=1;j<len-i;j++) x*=a;
p+=x;
}
i=0;
do
{
x=p%b;
if(x>9) q[i]=x-10+'A';
else q[i]='0'+x;
p/=b;
i++;
}while(p!=0);
for(j=i-1;j>=0;j--) printf("%c",q[j]);
} | 55 |
27,338 | main()
{
int a,b;
char n[100];
scanf("%d",&a);
scanf("%s",n);
scanf("%d",&b);
long c=0,x;
int i,j,k,l=strlen(n);
for(i=0;i<l;i++)
{
if(n[i]>='A'&&n[i]<='Z')
x=n[i]-'A'+10;
else if(n[i]>='a'&&n[i]<='z')
x=n[i]-'a'+10;
else
x=n[i]-'0';
for(j=1;j<=l-i-1;j++)
x=a*x;
c+=x;
}
int m[100]={-1};
for(j=0;;j++)
{
m[j]=c%b;
c=c/b;
if(c==0)
break;
}
for(k=j;k>=0;k--)
{
if(m[k]>=10)
{
char y;
y='A'+m[k]-10;
printf("%c",y);
}
else
printf("%d",m[k]);
}
} | 55 |
27,339 | int main()
{
char s[20],r[40];
int i,j,a,b,l;
long n=0;
scanf("%d%s%d",&a,s,&b);
l=strlen(s);
for(i=0;i<l;i++)
{
if(s[i]>='a'&&s[i]<='z')
n=a*n+s[i]-'a'+10;
else if(s[i]>='A'&&s[i]<='Z')
n=a*n+s[i]-'A'+10;
else n=a*n+s[i]-'0';
}
//printf("%ld\n",n);
i=0;
if(n==0)
{
printf("0\n");
return 0;
}
while(n>0)
{
if(n%b<=9)
r[i++]=n%b+'0';
else
r[i++]=n%b-10+'A';
n=n/b;
}
for(j=i-1;j>=0;j--)
{
printf("%c",r[j]);
}
printf("\n");
return 0;
}
| 55 |
27,340 | int zheng(char x);
char fan(int x);
int main(int argc, char* argv[])
{
int n,m,f,sum,i;
char zhuan[50];
scanf("%d",&n);
char x[10];
scanf("%s",x);
scanf("%d",&m);
f=strlen(x);
sum=0;
int wei=0;
for(i=0;i<f;i++){
sum=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;
switch(x){
case '1':m=1;break;
case '2':m=2;break;
case '3':m=3;break;
case '4':m=4;break;
case '5':m=5;break;
case '6':m=6;break;
case '7':m=7;break;
case '8':m=8;break;
case '9':m=9;break;
case '0':m=0;break;
case 'a':m=10;break;
case 'A':m=10;break;
case 'b':m=11;break;
case 'B':m=11;break;
case 'c':m=12;break;
case 'd':m=13;break;
case 'e':m=14;break;
case 'f':m=15;break;
case 'g':m=16;break;
case 'h':m=17;break;
case 'i':m=18;break;
case 'j':m=19;break;
case 'k':m=20;break;
case 'l':m=21;break;
case 'm':m=22;break;
case 'n':m=23;break;
case 'o':m=24;break;
case 'p':m=25;break;
case 'q':m=26;break;
case 'r':m=27;break;
case 's':m=28;break;
case 't':m=29;break;
case 'u':m=30;break;
case 'v':m=31;break;
case 'w':m=32;break;
case 'x':m=33;break;
case 'y':m=34;break;
case 'z':m=35;break;
case 'C':m=12;break;
case 'D':m=13;break;
case 'E':m=14;break;
case 'F':m=15;break;
case 'G':m=16;break;
case 'H':m=17;break;
case 'I':m=18;break;
case 'J':m=19;break;
case 'K':m=20;break;
case 'L':m=21;break;
case 'M':m=22;break;
case 'N':m=23;break;
case 'O':m=24;break;
case 'P':m=25;break;
case 'Q':m=26;break;
case 'R':m=27;break;
case 'S':m=28;break;
case 'T':m=29;break;
case 'U':m=30;break;
case 'V':m=31;break;
case 'W':m=32;break;
case 'X':m=33;break;
case 'Y':m=34;break;
case 'Z':m=35;break;
}
return m;
}
char fan(int x){
char m;
switch(x){
case 0:m='0';break;
case 1:m='1';break;
case 2:m='2';break;
case 3:m='3';break;
case 4:m='4';break;
case 5:m='5';break;
case 6:m='6';break;
case 7:m='7';break;
case 8:m='8';break;
case 9:m='9';break;
case 10:m='A';break;
case 11:m='B';break;
case 12:m='C';break;
case 13:m='D';break;
case 14:m='E';break;
case 15:m='F';break;
case 16:m='G';break;
case 17:m='H';break;
case 18:m='I';break;
case 19:m='J';break;
case 20:m='K';break;
case 21:m='L';break;
case 22:m='M';break;
case 23:m='N';break;
case 24:m='O';break;
case 25:m='P';break;
case 26:m='Q';break;
case 27:m='R';break;
case 28:m='S';break;
case 29:m='T';break;
case 30:m='U';break;
case 31:m='V';break;
case 32:m='W';break;
case 33:m='X';break;
case 34:m='Y';break;
case 35:m='Z';break;
}
return m;
}
| 55 |
27,341 |
int main(){
int i,j;
int a,b;
long mid=0;
char out[100];
cin>>a;
cin.get();
char tempC;
int temp;
while((tempC = cin.get()) != ' '){
if(tempC>='0' && tempC<='9')
temp = tempC-'0';
else if(tempC>='a' && tempC<='z')
temp = tempC-'a'+10;
else if(tempC>='A' && tempC<='Z')
temp = tempC-'A'+10;
mid *= a;
mid += temp;
}
cin>>b;
i = 0;
while(mid > 0){
temp = mid%b;
if(temp >9){
tempC = temp-10+'A';
}
else{
tempC = temp+'0';
}
out[i]=tempC;
++i;
mid /= b;
}
if(i==0)
cout<<"0"<<endl;
else{
for(j = i-1;j>=0;--j){
cout<<out[j];
}
cout<<endl;
}
cin>>a;
return 0;
}
| 55 |
27,342 | /**
* @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 |
27,343 |
int main()
{
int a, b, i;
long int x = 0, y;
char num1[100], num2[100], c;
scanf("%d%s%d", &a, &num1, &b);
for ( i = 0; i < strlen(num1); i ++ ){
if ( num1[i] >= 'a' && num1[i] <= 'z' )
x = x * a + num1[i] - 'a' + 10;
if ( num1[i] >= 'A' && num1[i] <= 'Z' )
x = x * a + num1[i] - 'A' + 10;
if ( num1[i] >= '0' && num1[i] <= '9' )
x = x * a + num1[i] - '0';
}
if ( x == 0 ){
printf("0");
return 0;
}
i = 0;
while ( x > 0 ){
num2[i++] = x % b;
x = x / b;
}
for ( ; i > 0; i-- ){
if ( num2[i - 1] >= 0 && num2[i - 1] <= 9 )
printf("%d", num2[i - 1]);
if ( num2[i - 1] >9)
printf("%c", num2[i - 1] - 10 + 'A');
}
printf("\n");
return 0;
}
| 55 |
27,344 | //????????
//??????
int main ()
{
char string1[1000],string2[1000]; //?????string1,string2
int b,c=0,i; //??????????b,?????c,????i
float a,d; //????????????a,????????????d
cin>>a>>string1>>d;
b=strlen(string1); //?????string1???
for(i=0;i<b;i++) //??a?????10??
{
if(string1[i]>='0'&&string1[i]<='9')
c+=(string1[i]-48)*pow(a,b-i-1);
if(string1[i]>='a'&&string1[i]<='z')
c+=(string1[i]-87)*pow(a,b-i-1);
if(string1[i]>='A'&&string1[i]<='Z')
c+=(string1[i]-55)*pow(a,b-i-1);
}
int index=0; //????????index,????e
int e;
if(c==0)
cout<<'0'<<endl; //????10????0,????0
while(c!=0) //???????d??
{
e=c%(int)d;
c=c/d;
if(e>=10)
string2[index]='A'+e-10;
else
string2[index] ='0'+e;
index++;
}
for(i=index-1;i>=0;i--)
cout<<string2[i]; //??????d???
cout<<endl;
return 0;
}
| 55 |
27,345 | /*???????
??????
???1100012802*/
void trans(int num,int b)
{
int m;
char l;
if(num != 0)
{
m = num % b;
if(m >= 10)
l = 'A' + m - 10;
else
l = m + '0';
num = num / b;
trans(num,b);
cout << l;
}
}
void shuzhi(char m[],int a,int b)
{
int i = 0,temp,num = 0;//i?????
while(m[i] != ' ')
{
if(m[i] >= 'a' && m[i] <= 'z')
temp = m[i] - 'a' + 10;
else if(m[i] >= 'A' && m[i] <= 'Z')
temp = m[i] - 'A' + 10;
else
temp = m[i] - '0';
num = num * a + temp;
i++;
}
if(num == 0)
cout << 0;
else
trans(num,b);
}
int main()
{
char a[20];
int z1,z2,i = -1;
cin >> z1;
cin.get();
do
{
i++;
a[i] = cin.get();
}while(a[i] != ' ');
cin >> z2;
shuzhi(a,z1,z2);
return 0;
}
| 55 |
27,346 | int main()
{
int a,b,s=0;
int i,c,j,k,o;
int number2[40];
char number[40],number1[40],number3[40];
scanf("%d",&a);
scanf("%s",number);
scanf("%d",&b);
int q1,p1;
p1=strlen(number);
for(q1=0;number[q1]!='\0';q1++)
number1[p1-q1-1]=number[q1];
number1[p1]='\0';
for(i=0;number1[i]!='\0';i++)
{
if(number1[i]>=97)
c=number1[i]-87;
else
{
if(number1[i]>=65)
c=number1[i]-55;
else
c=number1[i]-48;
}
o=1;
for(int l=1;l<=i;l++)
{
o=o*a;
}
s=o*c+s;
}
if(s==0)
puts("0");
else
{
for(j=0;s!=0;j++)
{
number2[j]=s%b;
s=s/b;
}
int q2,p2;
p2=j;
for(q2=0;q2<p2;q2++)
{
if(number2[q2]>9)
number2[q2]=number2[q2]+55;
else
number2[q2]=number2[q2]+48;
number3[p2-q2-1]=number2[q2];
}
number3[p2]='\0';
puts(number3);
}
getchar();
getchar();
getchar();
getchar();
return 0;
} | 55 |
27,347 | main()
{
char n[33],m[33];
long c,x,y;
int a,b,d,e,l,i;
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]=n[i]+10-'a';
if(n[i]>='A'&&n[i]<='Z') n[i]=n[i]+10-'A';
if(n[i]>='0'&&n[i]<='9') n[i]=n[i]-'0';}
c=0;
for(i=0;i<=l-1;i++)
{
c=c*a+n[i];
}
d=0;
do
{
x=c/b;
y=c%b;
for(i=d-1;i>=0;i--) m[i+1]=m[i];
m[0]=y;
c=x;
d++;
} while(x!=0);
m[d]='\0';
for(i=0;i<d;i++)
{
if(m[i]>=0&&m[i]<=9) m[i]=m[i]+'0';
else m[i]=m[i]+'A'-10;
}
printf("%s\n",m);
} | 55 |
27,348 | void main()
{
int a=0,b=0,begin,end,i,j;long int e=0;char c[40]={0};int f(char x);char g(int x);
gets(c);
for(i=0;c[i]!=' ';i++)
a=a*10+c[i]-'0';
begin=i+1;
for(i=begin;c[i]!=' ';i++);
end=i-1;
for(i=end+2;c[i+1]!=0;i++)
b=b*10+c[i]-'0';
for(i=begin;i<=end;i++)
e=a*e+f(c[i]);
if(e==0)printf("0");
for(j=0;e>0;j++)
{
c[j]=g(e%b);
e=e/b;
}
for(i=0;i<j/2;i++)
{
c[39]=c[i];c[i]=c[j-i-1];c[j-i-1]=c[39];
}
c[j]=0;
puts(c);
}
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 |
27,349 | long f1(char n[500], int a, int l)
{
long m;
int i, j, k, c[500] = {0};
m = 0;
k = 0;
for (i = l - 1; i >= 0; i--)
if (n[i] <= '9' && n[i] >= '0')
c[i] = n[i] - '0';
else
if (n[i] <= 'Z' && n[i] >= 'A')
c[i] = n[i] - 'A' + 10;
else
if (n[i] <= 'z' && n[i] >= 'a')
c[i] = n[i] - 'a' + 10;
for (i = l - 1; i >= 0; i--)
{
k = c[i];
for (j = 1; j < l - i; j++)
k = k * a;
m = m + k;
}
return m;
}
void f2(long m, int b)
{
int a[500] = {0}, i = 0, j;
char c[500];
do
{
i++;
a[i] = m % b;
m = m / b;
}while(m != 0);
for (j = 1; j <= i; j++)
if (a[j] <= 9 && a[j] >= 0)
c[j] = '0' + a[j];
else
c[j] = a[j] + 'A' - 10;
for (j = i ; j > 0; j--)
cout << c[j];
}
int main()
{
int a, b, l;
long m;
char n[500];
cin >> a >> n >> b;
l = strlen(n);
m = f1(n, a, l);
f2(m, b);
return 0;
}
| 55 |
27,350 | main()
{
int a,b,num1[100],num2[100],l1=0,l2=0,i,j=0;
long n=0;
char ch1[100],ch2[100],c;
for(i=0;i<100;i++)
{
num1[i]=0;
num2[i]=0;
ch1[i]='0';
ch2[i]='0';
}
scanf("%d ",&a);
for(i=0;(c=getchar())!=' ';i++)
{
l1++;
ch1[i]=c;
if('0'<=c&&c<='9')num1[i]=c-'0';
else if('a'<=c&&c<='z')num1[i]=c-'a'+10;
else if('A'<=c&&c<='Z')num1[i]=c-'A'+10;
}
scanf("%d",&b);
for(i=0;i<l1;i++)
n=n+num1[i]*(int)pow(a,l1-1-i);
for(i=1;j==0;i++)
{
if(n/(int)pow(b,i)==0)
{
j=1;
break;
}
}
l2=i;
for(i=0;i<l2;i++)
{
num2[99-i]=n%b;
n=(n-num2[99-i])/b;
if(0<=num2[99-i]&&num2[99-i]<=9)ch2[99-i]=num2[99-i]+'0';
else if(10<=num2[99-i])ch2[99-i]=num2[99-i]-10+'A';
}
for(i=0;i<l2;i++)
printf("%c",ch2[100-l2+i]);
}
| 55 |
27,351 | main()
{
int i,j,d,b,s;
int a[10000];
char c[10000];
scanf("%d %s %d",&d,c,&b);
//d=15;
//b=7;
s=0;
if(c[0]-'0'==0){printf("0");}
else
{for(i=0;c[i]!='\0';i++)
{
if(c[i]>='a'&&c[i]<='z'){c[i]=c[i]-32;}
if(c[i]>=65&&c[i]<=90){a[i]=c[i]-55;}
//if(c[i]>='A'&&c[i]<='Z'){a[i]=c[i]-'0'+10;printf("%d\n",a[i]);}
else
{a[i]=c[i]-'0';}
//printf("%d\n",a[i]);
}
//printf("%d\n",i);
for(j=0;j<i;j++)
{
s=d*s+a[j];
}
for(i=0;s!=0;i++)
{
a[i]=s%b;
s=s/b;
// printf("%d\n",a[i]);
if(a[i]>=10)
{
c[i]='A'+a[i]-10;
}
else
{c[i]=a[i]+'0';}
// printf("%c\n",c[i]);
//printf("%d\n",i);
}
for(j=i-1;j>=0;j--)
{
printf("%c",c[j]);
}
}
getchar();
getchar();
getchar();
} | 55 |
27,352 | int main()
{
long mizhi(int input1,int input2);
long a,b,temp,temp1=0,temp2,temp3;
int n,i,j,k=0;
char str[1000];
scanf("%d%s%d",&a,&str,&b);
n=strlen(str);
for(i=0;i<n;i++)
{
if(str[i]>=65&&str[i]<=90)
{
temp2=str[i]-55;
}
else if(str[i]>=97&&str[i]<=122)
{
temp2=str[i]-87;
}
else if(str[i]>=48&&str[i]<=57)
{
temp2=str[i]-48;
}
temp1=temp1+temp2*mizhi(a,n-1-i);
}
temp=temp1;
for(j=0;;j++)
{
if(temp<b)
{
break;
}
else
{
temp=temp/b;
k++;
}
}
for(i=0;i<=k;i++)
{
if(temp1>=b)
{
if(temp1/mizhi(b,k-i)<=9)
{
printf("%ld",temp1/mizhi(b,k-i));
temp1=temp1%mizhi(b,k-i);
}
else
{
printf("%c",55+temp1/mizhi(b,k-i));
temp1=temp1%mizhi(b,k-i);
}
}
else if(temp1<b&&k-i!=0)
{
printf("0");
}
else
{
if(temp1<=9)
{
printf("%ld",temp1);
}
else
{
printf("%c",55+temp1);
}
break;
}
}
}
long mizhi(int input1,int input2)
{
int z=1,k=1;
if(input2==0)
{
return(1);
}
else
{
do
{
z=z*input1;
k++;
}while(k<=input2);
}
return(z);
} | 55 |
27,353 | int change(char m);
char trans(int n);
int main()
{
char f[10000];
int g[10000];
int a,b,i,len,s=0,t=0;
scanf("%d %s %d",&a,f,&b);
len=strlen(f);
for(i=0;i<len;i++)
{
s=change(f[i])+s*a;
}
while(s/b)
{
g[t]=s%b;
s/=b;
t++;
}
g[t]=s%b;
for(i=t;i>=0;i--)
{
printf("%c",trans(g[i]));
}
return 0;
}
int change(char m)
{
int result;
if((m-'0'>=0)&&(m-'0'<10))
{
result=m-'0';
}
else if((m-'a'>=0)&&(m-'a'<26))
{
result=m-'a'+10;
}
else if((m-'A'>=0)&&(m-'A'<26))
{
result=m-'A'+10;
}
return result;
}
char trans(int n)
{
char last;
if(n>=0||n<10)
{
last='0'+n;
}
if(n>9)
{
last='A'+n-10;
}
return last;
}
| 55 |
27,354 |
char CHR[120];
int p1,p2,p3,num;
int deal(char Q)
{
if ((Q>='0')&&(Q<='9')) return Q-'0';
if ((Q>='A')&&(Q<='Z')) return Q-'A'+10;
return -1;
}
char laed(int Q)
{
if ((Q>=0)&&(Q<=9)) return '0'+Q;
if (Q>9) return 'A'+Q-10;
}
void output(int ans)
{
if (ans==0) return;
else
{
output(ans/p3);
cout<<laed(ans%p3);
}
}
int main()
{
cin>>p1;cin.get();
p2=0;num=0;
while ((CHR[p2]=cin.get())!=' ')
{
if ((CHR[p2]>='a')&&(CHR[p2]<='z')) CHR[p2]=CHR[p2]-'a'+'A';
num=num*p1+deal(CHR[p2]);
p2++;
}
cin>>p3;
if (num==0) cout<<0;
else output(num);
cout<<endl;
return 0;
}
| 55 |
27,355 | //????a?
long long nta(long long a)
{
if(a>=10)
{
char b;
b=(char)('A'-10+a);
return ((char) (b));
}
else
{
char b;
b=(char)('1'-1+a);
return ((char) (b));
}
}
//a????
long long atn(char i)
{
long long j=i;
if(j>96)
{
j=j-'a'+10;
}
else
{ if ((j>33)&&(j<58))
{
j=j-'1'+1;
}
else
{
j=j-'A'+10;
}
}
return((long long)(j));
}
//???????
long long ten(long long k)
{
long long l,m;
l=k;
for (long long n = 0; n < 69; n++)
{
l=l/10;
if (l>0)
{
m=n+1;
}
}
return (m);
}
//??e??
long long loe(long long t,long long v)
{
long long u,w=0;
u=t;
for (long long x = 0; x < 69; x++)
{
u=u/v;
if (u>0)
{
w=x+1;
}
}
return (w);
}
//??????
long long lth(char o[])
{
long long f=0;
for (long long g = 0; g <69 ; g++)
{
if((o[g]!=0)&&(o[g]!=32))f=f+1;
}
return ((f));
}
int main()
{
long long d,e;
char h[70];
memset(h,0,sizeof(h));
cin>>d>>h>>e;
long long p;
p=lth(h);
long long s=0;
long long ae[100];
ae[0]=1;
for (long long af= 1; af< 20; af++)
{
ae[af]=ae[af-1]*d;
}
for (long long q = p-1; q >=0 ; q--)
{
s=s+(atn(h[q])*ae[p-1-q]);
}
long long y;
y=(loe(s,e));
char aa[70];
memset(aa,0,sizeof(aa));
long long ab=s,ac=0;
for (long long z = 0; z < y+1; z++)
{
ac=ab;
ab=ab/e;
if (ab>0)
{
aa[z]=nta(ac%e);
}
else
{
aa[z]=nta(ac);
}
}
for (long long ad = 0; ad < y+1; ad++)
{
cout<<aa[y-ad];
}
return 0;
} | 55 |
27,356 | 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 |
27,357 | int main()
{
int n,a,b,i,k=-1,dec=0,temp[33];
char num[33],result[33];
cin>>a>>num>>b;
n=strlen(num);
for(i=0;i<n;i++)
{
if(num[i]>='A'&&num[i]<='Z')
num[i]=num[i]+'a'-'A';
}
for(i=0;i<n;i++)
{
if(num[i]>='a'&&num[i]<='z')
dec=dec*a+(num[i]-'a'+10);
else
dec=dec*a+(num[i]-'0');
}
if(dec==0)
cout<<'0'<<endl;
else
while(dec>0)
{
k=k+1;
temp[k]=dec%b;
dec=(dec-dec%b)/b;
}
for(i=k;i>=0;i--)
{
if(temp[i]<10)
result[i]=temp[i]+'0';
else
result[i]=temp[i]+'A'-10;
cout<<result[i];
}
cout<<endl;
return 0;
}
| 55 |
27,358 | void main()
{
long int f=0,e,b,c,i,g,k=0,j=0,v=1;
char d[100],a[100];
int h[100];
e=0;
scanf("%d",&b);//d???
for(i=0;;i++)
{a[i]=getchar();
if (a[i]==' ') break;
}//??????
for(i=0;;i++)
{d[i]=getchar();
if (d[i]==' ') break;j++;
}
scanf("%d",&c);//?????
//for(i=0;i<4;i++)
//printf("%c\n",d[i]);
//printf("%d %d",b,c);
g=b;//????
{
for(i=0;;i++)
{if (d[i]==' ') break;
if (d[i]< 59 ) h[i]=d[i]-48;
else if (d[i]<='Z') h[i]=d[i]-55;
else h[i] = d[i]-87;
//printf("%d\n",h[i]);
};
for(i=j-1;i>=0;i--)
{f=f+h[i]*b/g;b=b*g;}
// printf("%d\n",f);//??
}//??10
{
for(i=0;;i++)
{
h[i]=f%c;f=f/c;k++;
if (f==0) break;
};//??
for(i=0;i<k;i++)
{ if (h[i]<=9)
d[i]=h[i]+48;
else d[i]=h[i]+55;
}
for(i=k-1;i>=0;i--)
if (j>=10) {printf("2147483647");break;}
else printf("%c",d[i]);
printf("\n");//????
}
}
| 55 |
27,359 | main()
{
int a,b,flag;
char n[100],m[100];
char c;
long i,s=0,k,x,y,t,u;
scanf("%d%s%d",&a,n,&b);
for(i=0;n[i]!='\0';i++) {}
k=i-1;
for(i=0;i<=k;i++)
{
c=n[i];
if(c>='a' && c<='z') x=c-87;
if(c>='A' && c<='Z') x=c-55;
if(c>='0' && c<='9') x=c-48;
if(c=='0') flag=0;
s=s+x*(long)pow(a,k-i);
}
t=s;
for(i=0;t>0;i++)
u=t%b,t=(t-u)/b;
k=i-1;
for(i=0;s>0;i++)
{
y=s%b;
if(y>9) c=y+55;
else c=y+48;
m[k-i]=c;
s=(s-y)/b;
}
for(i=0;i<=k;i++) printf("%c",m[i]);
if(flag==0) printf("0");
printf("\n");
} | 55 |
27,360 | int main(){
char s[100];
int a,b;
scanf("%d %s %d",&a,s,&b);
//?????????
int l,k,i;
l=strlen(s);
int sz[100];
for(i=0;i<l;i++){
if(s[i]>='a'&&s[i]<='z')
sz[i]=10+s[i]-'a';
if(s[i]>='A'&&s[i]<='Z')
sz[i]=10+s[i]-'A';
if(s[i]>='0'&&s[i]<='9')
sz[i]=0+s[i]-'0';
}
for(i=0;i<l;i++){
//printf("sz[%d]=%d",i,sz[i]);
k=l-i-1;
while(k--){
sz[i]=sz[i]*a;}
//printf("sz[%d]=%d",i,sz[i]);
}
int num10=0;//shijinzhishu
for(i=0;i<l;i++){
num10+=sz[i];
}
//printf("%d",num10);
//zhuanhuawei b jinzhi
int shang,yushu;
shang=num10/b;
yushu=num10%b;
int geweiyushu[100];
if(shang==0){printf("%d",yushu);}
else {for(i=0;shang!=0;i++){
geweiyushu[i]=yushu;
yushu=shang%b;
shang=shang/b;
}
geweiyushu[i]=yushu;}
int weishu;
weishu=i+1;
//printf("weishu=%d",weishu);
//???string
char s2[100];
for(i=0;i<weishu;i++){
if(geweiyushu[i]>=10){s2[i]=geweiyushu[i]-10+'A';}
else s2[i]=geweiyushu[i]-0+'0';
}
int y=0;
for(i=0;i<l;i++){
if(s[i]!='0')
y++;
}
//printf("y=%d\n",y);
if(y!=0){
for(i=weishu-1;i>=0;i--){
printf("%c",s2[i]);
}}
//else printf("0");
return 0;
}
| 55 |
27,361 | main ()
{
int a2i[128],from,to,len=0,i;
char i2a[] ="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ" ,in[255],out[255]="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]);
}
| 55 |
27,362 | void main()
{
char num[50];
int answer=0,i,j,a,b,n,an[50];
scanf("%d%s%d",&a,num,&b);
n=strlen(num);
for(i=0;i<n;i++)
{
if(num[i]>47&&num[i]<58)
answer=answer+(num[i]-48)*pow(a,n-i-1);
if(num[i]>64&&num[i]<91)
answer=answer+(num[i]-55)*pow(a,n-i-1);
if(num[i]>96&&num[i]<123)
answer=answer+(num[i]-87)*pow(a,n-i-1);
}
for(j=0;;j++)
{
i=answer%b;
answer=(answer-i)/b;
if(i>=0&&i<10)
an[j]=i+48;
if(i>=10)
an[j]=i+55;
if(answer==0)
break;
}
for(i=j;i>=0;i--)
printf("%c",an[i]);
} | 55 |
27,363 | int zheng(char x);
char fan(int x);
int main(){
int n,m,f,sum,i;
char zhuan[50];
scanf("%d",&n);
char x[10];
scanf("%s",x);
scanf("%d",&m);
f=strlen(x);
sum=0;
int wei=0;
for(i=0;i<f;i++){
sum=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;
switch(x){
case '1':m=1;break;
case '2':m=2;break;
case '3':m=3;break;
case '4':m=4;break;
case '5':m=5;break;
case '6':m=6;break;
case '7':m=7;break;
case '8':m=8;break;
case '9':m=9;break;
case '0':m=0;break;
case 'a':m=10;break;
case 'A':m=10;break;
case 'b':m=11;break;
case 'B':m=11;break;
case 'c':m=12;break;
case 'd':m=13;break;
case 'e':m=14;break;
case 'f':m=15;break;
case 'g':m=16;break;
case 'h':m=17;break;
case 'i':m=18;break;
case 'j':m=19;break;
case 'k':m=20;break;
case 'l':m=21;break;
case 'm':m=22;break;
case 'n':m=23;break;
case 'o':m=24;break;
case 'p':m=25;break;
case 'q':m=26;break;
case 'r':m=27;break;
case 's':m=28;break;
case 't':m=29;break;
case 'u':m=30;break;
case 'v':m=31;break;
case 'w':m=32;break;
case 'x':m=33;break;
case 'y':m=34;break;
case 'z':m=35;break;
case 'C':m=12;break;
case 'D':m=13;break;
case 'E':m=14;break;
case 'F':m=15;break;
case 'G':m=16;break;
case 'H':m=17;break;
case 'I':m=18;break;
case 'J':m=19;break;
case 'K':m=20;break;
case 'L':m=21;break;
case 'M':m=22;break;
case 'N':m=23;break;
case 'O':m=24;break;
case 'P':m=25;break;
case 'Q':m=26;break;
case 'R':m=27;break;
case 'S':m=28;break;
case 'T':m=29;break;
case 'U':m=30;break;
case 'V':m=31;break;
case 'W':m=32;break;
case 'X':m=33;break;
case 'Y':m=34;break;
case 'Z':m=35;break;
}
return m;
}
char fan(int x){
char m;
switch(x){
case 0:m='0';break;
case 1:m='1';break;
case 2:m='2';break;
case 3:m='3';break;
case 4:m='4';break;
case 5:m='5';break;
case 6:m='6';break;
case 7:m='7';break;
case 8:m='8';break;
case 9:m='9';break;
case 10:m='A';break;
case 11:m='B';break;
case 12:m='C';break;
case 13:m='D';break;
case 14:m='E';break;
case 15:m='F';break;
case 16:m='G';break;
case 17:m='H';break;
case 18:m='I';break;
case 19:m='J';break;
case 20:m='K';break;
case 21:m='L';break;
case 22:m='M';break;
case 23:m='N';break;
case 24:m='O';break;
case 25:m='P';break;
case 26:m='Q';break;
case 27:m='R';break;
case 28:m='S';break;
case 29:m='T';break;
case 30:m='U';break;
case 31:m='V';break;
case 32:m='W';break;
case 33:m='X';break;
case 34:m='Y';break;
case 35:m='Z';break;
}
return m;
}
| 55 |
27,364 | 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 |
27,365 |
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 |
27,366 | void main()
{
char c[101],d[101];
int a,b,i,j,p,x;
long n=0;
scanf("%d %s %d",&a,c,&b);
for(i=0;i<=100;i++)
{
if(c[i]==0)break;
else if(c[i]<='Z'&&c[i]>='A')c[i]=c[i]-'A'+10;
else if(c[i]<='z'&&c[i]>='a')c[i]=c[i]-'a'+10;
else if(c[i]<='9'&&c[i]>='0')c[i]=c[i]-'0';
}x=i;
for(i=0;i<=x-1;i++)
{
p=1;
for(j=1;j<=x-i-1;j++)
{
p=p*a;
}
n=n+p*c[i];
}
i=0;
while((n/b)!=0)
{
i++;
d[i]=n%b;
n=n/b;
}
d[i+1]=n%b;
i++;
for(j=1;j<=i;j++)
{
if(d[j]>=10){d[j]=d[j]-10+'A';}
else d[j]=d[j]+'0';
}
for(j=i;j>=1;j--)
{
printf("%c",d[j]);
}
} | 55 |
27,367 | int main()
{
int a,b,i,j,l,s;
int c[1000];
char str1[1000],str2[1000];
scanf("%d%s%d",&a,str1,&b);
l=strlen(str1);
s=0;
for(i=0;i<l;i++)
{
if(str1[i]>='A'&&str1[i]<='Z')
str1[i]=str1[i]-'A'+10;
else if(str1[i]>='a'&&str1[i]<='z')
str1[i]=str1[i]-'a'+10;
else
str1[i]=str1[i]-'0';
s=str1[i]+(s*a);
}
if(s==0)
printf("0");
for(i=0;s!=0;i++)
{
c[i]=s%b;
s=s/b;
}
for(j=0;j<i;j++)
{
if(c[j]<=9)
str2[i-j-1]=c[j]+'0';
else
str2[i-j-1]=c[j]+'A'-10;
}
printf("%s\n",str2);
getchar();
getchar();
}
| 55 |
27,368 | // ????.cpp : Defines the entry point for the console application.
// ?????????
int main()
{
char a[100],b[100];
int p=0,q=0,m,n;
cin>>m>>a>>n;
for(int i=0;i<strlen(a);i++)
{
if(a[i]>='a')
a[i]=a[i]-'a'+10;
else if(a[i]>='A')
a[i]=a[i]-'A'+10;
else
a[i]=a[i]-'0';
p=p*m+a[i];
}
while(p>0)
{
b[q]=p%n;
if(b[q]>=10)
b[q]=b[q]-10+'A';
else
b[q]=b[q]+'0';
p=p/n;
q++;
}
for(int i=q-1;i>=0;i--)
cout<<b[i];
if (q==0) cout<<0;
cout<<endl;
return 0;
}
| 55 |
27,369 |
int zh(char a)
{
int b;
if((a>='A')&&(a<='Z'))
{
b=(int)(a)-55;
return b;
}
else
{
b=(int)(a)-48;
return b;
}
}
char fzh(int a)
{
char b;
if(a>9)
{
b=(char)(a+55);
return b;
}
else
{
b=(char)(a+48);
return b;
}
}
int cf(int a,int b)
{
int i;
int sum=a;
if(b==0)
{
sum=1;
}
for(i=0;i<b-1;i++)
{
sum*=a;
}
return sum;
}
int main()
{
int a,b;
int i,j;
int l;
char c[10000];
char t[10000];
int sum=0;
scanf("%d%s%d",&a,c,&b);
l=strlen(c);
for(i=0;i<l;i++)
{
if((c[i]>='a')&&(c[i]<='z'))
{
c[i]=c[i]-'a'+'A';
}
}
for(i=0;i<l;i++)
{
sum+=cf(a,l-1-i)*zh(c[i]);
}
if(sum==0)
{
printf("0");
}
for(i=0;sum!=0;i++)
{
t[i]=fzh(sum%b);
sum=sum/b;
}
for(j=i-1;j>=0;j--)
{
printf("%c",t[j]);
}
printf("\n");
return 0;
}
| 55 |
27,370 | 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 |
27,371 | void main()
{
char ch[300];
int a,b;
scanf("%d %s %d",&a,ch,&b);
long k=0;
int i;
for(i=0;i<strlen(ch);i++)
{
if(ch[i]>='0'&&ch[i]<='9')
{
k=k*a+ch[i]-'0';
continue;
}
if(ch[i]>='A'&&ch[i]<='Z')
{
k=k*a+ch[i]-'A'+10;
continue;
}
if(ch[i]>='a'&&ch[i]<='z')
{
k=k*a+ch[i]-'a'+10;
continue;
}
}
int save[1000];
i=0;
if(k==0)
printf("0");
else
{
while(k>0)
{
save[i]=k%b;
k=k/b;
i++;
}
i--;
while(i>=0)
{
if(save[i]<10)
printf("%d",save[i]);
else
printf("%c",save[i]+55);
i--;
}
}
} | 55 |
27,372 |
long toDex(int a,char n[]);
int toB(long Dn,int b,char answer[]);
main()
{
int a,b,len,i;
char n[50]={"0"},answer[50]={"0"};
long Dn;
scanf("%d%s%d",&a,n,&b);
for (i=0;i<=strlen(n)-1;i++)
n[i]=toupper(n[i]);
Dn=toDex(a,n);
len=toB(Dn,b,answer);
for (i=len-1;i>=0;i--)
printf("%c",answer[i]);
}
long toDex(int a,char n[])
{
int i,j;
long Dn=0,sqr;
for (i=0;i<strlen(n);i++)
{
sqr=1;
for (j=0;j<strlen(n)-i-1;j++)
sqr*=a;
if ((int)(n[i])>=65) Dn+=sqr*((int)(n[i])-55);
else Dn+=sqr*((int)(n[i])-48);
}
return Dn;
}
int toB(long Dn,int b,char answer[])
{
long shang=Dn;
int i=0,yu;
do
{
yu=shang%b;
(yu>=10)?(answer[i]=(char)(yu)+55):(answer[i]=(char)(yu)+48);
i++;
shang=shang/b;
}while (shang!=0);
return i;
}
| 55 |
27,373 | //******************************************************
//* ? ? ? ?? ? ? ? *
//* ? ? ?? ? ? *
//* ? ? ? ??2010 ? 11 ? 24 ? *
//* ? ? ?1000010185 *
//******************************************************
int main()
{
int a, b, dec = 0, l, k = 1, j = 0;
char n[32], nb[32];
cin >> a >> n >> b;
l = strlen(n);
for (int i = l - 1; i >= 0; i --)
{
if (n[i] >= '0' && n[i] <= '9')
dec += (n[i] - '0') * k;
if (n[i] >= 'a' && n[i] <= 'z')
dec += (n[i] - 'a' + 10) * k;
if (n[i] >= 'A' && n[i] <= 'Z')
dec += (n[i] - 'A' + 10) * k;
k *= a;
}
do
{
if (dec % b <= 9)
nb[j ++] = dec % b + '0';
else
nb[j ++] = dec % b - 10 + 'A';
dec /= b;
} while (dec != 0);
for (int i = j - 1; i >= 0; i --)
cout << nb[i];
return 0;
}
| 55 |
27,374 | 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 |
27,375 | void main()
{
int a,b,m=0,i,c[100],k=1,e=0,d=0;
long sum=0;
char n[100];
scanf("%d%s%d",&a,n,&b);
m=strlen(n);
for(i=0;n[i]!='\0';i++)
{
if(n[i]>='a')
c[i]=(int)(n[i])-87;
else if(n[i]>='A')
c[i]=(int)(n[i])-55;
else
c[i]=(int)(n[i])-48;
}
for(i=m-1;i>=0;i--)
{
sum+=c[i]*k;
k*=a;
}
for(i=0,k=1;sum>0;i++)
{
c[i]=sum%b;
sum=(sum-c[i])/b;
k*=b;
e++;
}
for(i=e-1;i>=0;i--)
{
if(c[i]<10)
n[i]=(char)(c[i]+48);
else
n[i]=(char)(c[i]+55);
printf("%c",n[i]);
d=1;
}
if(d==0)
printf("0");
}
| 55 |
27,376 | void main()
{
char n[35]={'0'},y[35]={'0'};
unsigned long r,x1,x=1;
int i,a,b,x2=0,y1,p,q,xm=0,k;
scanf("%d%s%d",&a,n,&b);
unsigned long m=0;
p=strlen(n);
r=pow(a,p-1);
for(i=0;i<p;i++)
{
if(n[i]>47&&n[i]<58)
{
q=n[i]-48;
m=m+q*r;
}
else
{
if(n[i]>64&&n[i]<91)
{
q=n[i]-55;
m=m+q*r;
}
else if(n[i]>96&&n[i]<123)
{
q=n[i]-87;
m=m+q*r;
}
}
r=r/a;
}
while((m/b)>x)
{
x=b*x;
xm=xm+1;
}
y1=0;
for(i=xm;i>=0;i--)
{
k=m%b;
if(k<10)
y[i]=k+48;
else y[i]=k+55;
m=(m-k)/b;
}
printf("%s",y);
} | 55 |
27,377 | 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;//??a,n,b
size=strlen(n);//??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;//?n10??????????
for(i=0;i<size;i++)
n10=n10+m[i]*pow(a,size-i-1);//??n10????long???
if(n10==0)
cout<<"0";//?n10=0?????0
else
{
for(i=0;i<32;i++)
if(pow(b,i)>n10)
{
k=i;
break;
}//??n10?b?????k?
c[0]=n10/pow(b,k-1);//???????1?c[0]
for(i=1;i<k;i++)
{
n10=n10-c[i-1]*pow(b,k-i);
c[i]=n10/(pow(b,k-1-i));
}//???????2??k?c[1]?c[k-1]
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;//?c[i]????????ascii?
for(i=0;i<k;i++)
t[i]=d[i];//t[i]?????
t[k]='\0';//t[k]???
cout<<t;//??b???t
}
return 0;
}//????? | 55 |
27,378 | int main()
{
int a,n,b,s,i,j,k,l,sz[100],zh[100];
char zf[100],tj[100];
scanf("%d %s %d",&a,zf,&b);
l=strlen(zf);
for(i=0;i<l;i++){
if(zf[i]>='0'&&zf[i]<='9'){
sz[i]=zf[i]-'0';
}
else if(zf[i]>='a'&&zf[i]<='z'){
sz[i]=zf[i]-'a'+10;
}
else if(zf[i]>='A'&&zf[i]<='z'){
sz[i]=zf[i]-'A'+10;
}
}
s=0;
for(i=0;i<l;i++){
s=s*a+sz[i];
}
j=0;
if(s==0){
zh[j]=0;
j++;
}
else{
while(s>0){
zh[j]=s%b;
s=s/b;
j++;
}
}
for(k=0;k<j;k++){
if(zh[k]>9){
tj[k]='A'+zh[k]-10;
}
else{
tj[k]=zh[k]+'0';
}
}
for(k=j-1;k>=0;k--){
printf("%c",tj[k]);
}
return 0;
}
| 55 |
27,379 | int zhsh (int, int, int, char[], int, int, int);//???????
int main ()
{
char s[100], u[100];
int a, b, l, k = 0, i = 0, j = 0, r, l1;
cin >> a >> s >> b;
l = strlen(s);
int sum = 1;
zhsh (i, j, l, s, k, sum, a);//?????????????????
if(zhsh (i, j, l, s, k, sum, a) == 0)//??0??????????
cout << "0" << endl;
else
{
k = zhsh (i, j, l, s, k, sum, a);
for (j = 0; k != 0; j++)//????0?
{
r = k % b;
if (r >= 10)//??????????
u[j] = r - 10 + 'A';
else
u[j] = r + '0';
k=k/b;
}
u[j] = '\0';//????????????
l1 = strlen(u);
for ( j= l1 - 1; j >= 0; j--)
cout << u[j];
cout << endl;
}
return 0;
}
int zhsh(int i,int j,int l,char s[],int k,int sum,int a)//???????
{
for(i = 0, j = l - 1; j >= 0; i++ , j--)
{
if(s[j] >= 65)
{
if(s[j] >= 97)
k = k + (s[j] - 87) * sum;
else
k = k + (s[j] - 55) * sum;
}
else
k = k + (s[j] - 48) * sum;
sum = sum * a;
}
return k;
}
| 55 |
27,380 | 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 |
27,381 | 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 |
27,382 |
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 |
27,383 | void main()
{
long int f=0,e=0,b,c,i,g,k=0,j=0,v=1;
char d[100],a[100];
int h[100];
scanf("%d",&b);//d???
for(i=0;;i++)
{a[i]=getchar();
if (a[i]==' ') break;
}//??????
for(i=0;;i++)
{d[i]=getchar();
if (d[i]==' ') break;j++;
}
scanf("%d",&c);//?????
//for(i=0;i<4;i++)
//printf("%c\n",d[i]);
//printf("%d %d",b,c);
g=b;//????
{
for(i=0;;i++)
{if (d[i]==' ') break;
if (d[i]< 59 ) h[i]=d[i]-48;
else if (d[i]<='Z') h[i]=d[i]-55;
else h[i] = d[i]-87;
//printf("%d\n",h[i]);
};
for(i=j-1;i>=0;i--)
{f=f+h[i]*b/g;b=b*g;}
// printf("%d\n",f);//??
}//??10
{
for(i=0;;i++)
{
h[i]=f%c;f=f/c;k++;
if (f==0) break;
};//??
for(i=0;i<k;i++)
{ if (h[i]<=9)
d[i]=h[i]+48;
else d[i]=h[i]+55;
}
for(i=k-1;i>=0;i--)
if (j>=10) {printf("2147483647");break;}
else printf("%c",d[i]);
printf("\n");//????
}
}
| 55 |
27,384 |
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 |
27,385 |
int main()
{
int num=0,j,i,a,b,x;
char m[50],n[50];
cin>>a;
cin.get();
cin>>m;
cin>>b;
for(i=0;m[i]!='\0';i++)
{if(m[i]>=65&&m[i]<=90) m[i]=m[i]+32;} //??????????
for(i=0;m[i]!='\0'; i++)
{
if(m[i]>=48&&m[i]<=57) x=m[i]-48;
else x=m[i]-97+10;
num=num*a+x; //?a??????10????num???
}
if(num==0) cout<<num<<endl;
for(i=0;num!=0;i++)//??????b????n????
{
n[i]=num%b;
if(n[i]>=9) n[i]=n[i]+55;
else n[i]=n[i]+48;
num=num/b;
}
for(j=i-1;j>=0;j--) cout<<n[j];
cout<<endl;
return 0;
}
| 55 |
27,386 |
int t[100]={0};
int a,b;
unsigned long int atoten(char *p)
{
unsigned long int s=0;
int len,i;
len=strlen(p);
p=p+len-1;
for(i=0;i<len;i++,p--)
{
if(*p>='0' && *p<='9')
s=s+(*p-'0')*pow(a,i);
else if(*p>='a' && *p<='z')
s=s+(*p-'a'+10)*pow(a,i);
else s=s+(*p-'A'+10)*pow(a,i);
}
return s;
}
int tentob(unsigned long int s)
{
int i,k;
for(i=0;s!=0;i++)
{
t[i]=s%b;
s=s/b;
}
k=i-1;
return k;
}
void print(int k)
{
int i;
if(k<0) printf("0");
for(i=k;i>=0;i--)
{
if(t[i]>9)
{
t[i]+='A'-10;
printf("%c",t[i]);
}
else printf("%d",t[i]);
}
}
void main()
{
unsigned long int s;
char n[100]={'\0'};
int k;
scanf("%d %s %d",&a,n,&b);
s=atoten(n);
k=tentob(s);
print(k);
} | 55 |
27,387 | int main()
{
int a,b,i=0,k=0,len;
char n[100],m[100];
cin>>a>>m>>b;
len=strlen(m);
for(i=0;m[i]!='\0';i++)
{
k*=a;
if(m[i]>='a'&&m[i]<='z')
k+=m[i]-'a'+10;
else if(m[i]>='A'&&m[i]<='Z')
k+=m[i]-'A'+10;
else if(m[i]>='0'&&m[i]<='9')
k+=m[i]-'0';
}
i=0;
n[0]='0';
n[1]='\0';
while(k!=0)
{
if(k%b<=9)
{
n[i++]='0'+k%b;
k=k/b;
}
else
{
n[i++]='A'+k%b-10;
k=k/b;
}
}
if(i!=0)
n[i]='\0';
len=strlen(n);
for(i=len-1;i>=0;i--)
{
cout<<n[i];
}
cout<<endl;
return 0;
} | 55 |
27,388 | //*???????
//*??????????????????????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 |
27,389 | void main()
{
int a,b,i,j,t,k;
char m[32],n[32];
long middle,mult;
middle=0;
scanf("%d",&a);
scanf("%s",m);
scanf("%d",&b);
i=strlen(m);
for(j=0;j<=i-1;j++)
{
if(m[j]>='0'&&m[j]<='9')m[j]=m[j]-'0';
if(m[j]>='a'&&m[j]<='z')m[j]=m[j]-'a'+10;
if(m[j]>='A'&&m[j]<='Z')m[j]=m[j]-'A'+10;
}
for(j=0;j<=i-1;j++)
{
mult=1;
for(t=i-1-j;t>=1;t--)
{
mult=mult*a;
}
middle=middle+m[j]*mult;
}
if(middle==0)printf("0");
if(middle>0)
{ j=0;
while(middle>0)
{
n[j]=middle%b;
middle=middle/b;
j++;
}
for(k=0;k<=j-1;k++)
{
if(n[k]<=9&&n[k]>=0)n[k]=n[k]+'0';
else if(n[k]>=10)n[k]='A'-10+n[k];
}
for(k=j-1;k>=0;k--)
{
printf("%c",n[k]);
}
}
} | 55 |
27,390 | int f(char x)
{
int xx;
xx=x-48;
if(xx>9)xx=x-'A'+10;
if(xx>36)xx=x-'a'+10;
return xx;
}
char g(int y)
{
char yy;
if(y<10)yy=y+'0';
if(y>=10)yy=y-10+'A';
return yy;
}
int main()
{
long nn=0;
int a,b,i;
char n[500];
scanf("%d %s %d",&a,n,&b);
int length=strlen(n);
int k=1;
for(i=length-1;i>=0;i--)
{
nn+=f(n[i])*k;
k*=a;
}
int m[500];
int j=0;
do
{
m[j]=nn%b;
nn=nn/b;
j++;
}
while(nn>=1);
for(i=j-1;i>=0;i--)printf("%c",g(m[i]));
} | 55 |
27,391 | int main()
{
int count(int,int);
int a,b,len1,len2,i,m=0,x=0;
long int t=0,r;
char n[20],s[50]={'\0'};
scanf("%d %s %d",&a,n,&b);
len1=strlen(n);
for(i=len1-1;i>=0;i--)
{
switch(n[i])
{
case '0':t=t;break;
case '1':t=t+count(a,len1-1-i);break;
case '2':t=t+2*(count(a,len1-1-i));break;
case '3':t=t+3*(count(a,len1-1-i));break;
case '4':t=t+4*(count(a,len1-1-i));break;
case '5':t=t+5*(count(a,len1-1-i));break;
case '6':t=t+6*(count(a,len1-1-i));break;
case '7':t=t+7*(count(a,len1-1-i));break;
case '8':t=t+8*(count(a,len1-1-i));break;
case '9':t=t+9*(count(a,len1-1-i));break;
case 'a':t=t+10*(count(a,len1-1-i));break;
case 'A':t=t+10*(count(a,len1-1-i));break;
case 'b':t=t+11*(count(a,len1-1-i));break;
case 'B':t=t+11*(count(a,len1-1-i));break;
case 'c':t=t+12*(count(a,len1-1-i));break;
case 'C':t=t+12*(count(a,len1-1-i));break;
case 'd':t=t+13*(count(a,len1-1-i));break;
case 'D':t=t+13*(count(a,len1-1-i));break;
case 'e':t=t+14*(count(a,len1-1-i));break;
case 'E':t=t+14*(count(a,len1-1-i));break;
case 'f':t=t+15*(count(a,len1-1-i));break;
case 'F':t=t+15*(count(a,len1-1-i));break;
case 'g':t=t+16*(count(a,len1-1-i));break;
case 'G':t=t+16*(count(a,len1-1-i));break;
case 'h':t=t+17*(count(a,len1-1-i));break;
case 'H':t=t+17*(count(a,len1-1-i));break;
case 'i':t=t+18*(count(a,len1-1-i));break;
case 'I':t=t+18*(count(a,len1-1-i));break;
case 'j':t=t+19*(count(a,len1-1-i));break;
case 'J':t=t+19*(count(a,len1-1-i));break;
case 'k':t=t+20*(count(a,len1-1-i));break;
case 'K':t=t+20*(count(a,len1-1-i));break;
case 'l':t=t+21*(count(a,len1-1-i));break;
case 'L':t=t+21*(count(a,len1-1-i));break;
case 'm':t=t+22*(count(a,len1-1-i));break;
case 'M':t=t+22*(count(a,len1-1-i));break;
case 'n':t=t+23*(count(a,len1-1-i));break;
case 'N':t=t+23*(count(a,len1-1-i));break;
case 'o':t=t+24*(count(a,len1-1-i));break;
case 'O':t=t+24*(count(a,len1-1-i));break;
case 'p':t=t+25*(count(a,len1-1-i));break;
case 'P':t=t+25*(count(a,len1-1-i));break;
case 'q':t=t+26*(count(a,len1-1-i));break;
case 'Q':t=t+26*(count(a,len1-1-i));break;
case 'r':t=t+27*(count(a,len1-1-i));break;
case 'R':t=t+27*(count(a,len1-1-i));break;
case 's':t=t+28*(count(a,len1-1-i));break;
case 'S':t=t+28*(count(a,len1-1-i));break;
case 't':t=t+29*(count(a,len1-1-i));break;
case 'T':t=t+29*(count(a,len1-1-i));break;
case 'u':t=t+30*(count(a,len1-1-i));break;
case 'U':t=t+30*(count(a,len1-1-i));break;
case 'v':t=t+31*(count(a,len1-1-i));break;
case 'V':t=t+31*(count(a,len1-1-i));break;
case 'w':t=t+32*(count(a,len1-1-i));break;
case 'W':t=t+32*(count(a,len1-1-i));break;
case 'x':t=t+33*(count(a,len1-1-i));break;
case 'X':t=t+33*(count(a,len1-1-i));break;
case 'y':t=t+34*(count(a,len1-1-i));break;
case 'Y':t=t+34*(count(a,len1-1-i));break;
case 'z':t=t+20*(count(a,len1-1-i));break;
case 'Z':t=t+20*(count(a,len1-1-i));break;
}
}
r=t;
do
{
t=r;
x=t%b;
if(x>=0&&x<=9)
{
s[m]=x+48;m++;
}
if(x>9)
{
s[m]=x+55;m++;
}
r=t/b;
}while(r>=b);
if(r>0&&r<=9)
{
s[m]=r+48;
}
if(r>9)
{
s[m]=r+55;
}
len2=strlen(s);
for(i=len2-1;i>=0;i--)
{
printf("%c",s[i]);
}
return 0;
}
int count(int a,int h)
{
int y,s=1;
if(h==0) s=1;
else
{
for(y=0;y<h;y++)
{
s=s*a;
}
}
return s;
} | 55 |
27,392 | void main()
{
int a,b;
char n[100];
scanf("%d %s %d",&a,n,&b);
int i,j=0;
int ten[100];
for(i=0;n[i]!='\0';i++)
{
j++;
if(n[i]>='0' && n[i]<='9')
ten[i]=n[i]-48;
else if(n[i]>='A' && n[i]<='Z')
ten[i]=n[i]-55;
else
ten[i]=n[i]-87;
}
int te[100];
te[0]=1;
for(i=0;i<j;i++)
te[i+1]=te[i]*a;
int t=0;
for(i=0;i<j;i++)
t+=te[i]*ten[j-i-1];
char m[100];
int ben[100];
j=0;
if(t==0)
printf("0\n");
else
{
for(i=0;t!=0;i++)
{
j++;
ben[i]=t%b;
t=t/b;
}
for(i=0;i<j;i++)
{
if(ben[j-i-1]>=0 && ben[j-1-i]<=9)
m[i]=ben[j-1-i]+48;
else
m[i]=ben[j-1-i]+55;
}
for(i=0;i<j;i++)
printf("%c",m[i]);
printf("\n");
}
} | 55 |
27,393 | int main()
{
int a,b;
int l,j,m,k;
int s=0;
char n[40],x[40],y[40];
scanf("%d %s %d",&a,n,&b);
l=strlen(n);
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 n[i]=n[i]-'0';
s=n[i]+s*a;
}
if(s==0) printf("0");
else
{
for(j=0;s!=0;j++)
{
x[j]=s%b;
s=(int)s/b;
}
for(k=0;k<j;k++)
{
y[k]=x[j-1-k];
}
for(int i=0;i<j;i++)
{
if(y[i]>9) y[i]=y[i]-10+'A';
else y[i]=y[i]+'0';
}
y[j]='\0';
printf("%s",y);
}
getchar();
getchar();
} | 55 |
27,394 | int main()
{
int sys2,oct=0,homo,i,j,t; //??sys1?sys2????????????
double sys1,length; //?????????,??sys1?double
char num[32]; //????????
cin>>sys1>>num>>sys2;
length=strlen(num); //????????
for(i=0;i<length;i++) //?????????????????????
num[i]=(char)toupper(num[i]);
for(i=0;i<length;i++) //???????????
{
if(num[i]>=48&&num[i]<=57)
homo=num[i]-48;
else
homo=num[i]-55;
oct=oct+homo*pow(sys1,length-i-1);
}
int change[32];
for(i=0;;i++) //????????sys2???????sys2???
{
change[i]=oct%sys2;
oct=oct/sys2;
if(oct==0)
break;
}
for(j=0;j<=i-j;j++) //???????????????????
{
t=change[j];
change[j]=change[i-j];
change[i-j]=t;
}
char ans[32];
for(j=0;j<=i;j++) //??????ASCII?
{
if(change[j]>=10)
ans[j]=change[j]+55;
else
ans[j]=change[j]+48;
cout<<ans[j]; //??????
}
cout<<endl;
return 0;
} | 55 |
27,395 |
int main()
{
int a,b,number=0;
char num[100];
cin>>a>>num>>b;
if(num[0]=='0')
{
cout<<0;
return 0;
}
for(int i=0; num[i]!='\0'; i++)
if(num[i]>='A' && num[i]<='Z') num[i]=num[i]+32;
for(int i=0; num[i]!='\0'; i++)
{
if(num[i]>='0' && num[i]<='9')
num[i]=num[i]-48;
else num[i]=num[i]-97+10;
number=number*a+num[i];
}
char na[100];
int i;
for( i=0; number!=0; i++)
{
na[i]=number%b;
if(na[i]>9) na[i]=na[i]+55 ;
else na[i]=na[i]+48;
number=number/b;
}
for(int j=i-1; j>=0; j--) cout<<na[j];
return 0;
}
| 55 |
27,396 | void main()
{
int a,b,l,i,m,t,j;
long sum=0;
char n[40],y[40],z[40];
scanf("%d %s %d",&a,n,&b);
l=strlen(n);
m=1;
for(i=1;i<=l;i++)
{
t=n[l-i];
if(t<60)
sum=sum+(n[l-i]-48)*m;
else if(t<91)
sum+=(n[l-i]-55)*m;
else
sum+=(n[l-i]-87)*m;
m=m*a;
}
//printf("%d",sum);
i=0;
if(sum!=0)
{while(sum!=0)
{
i++;
t=sum%b;
if(t<=9)
y[29-i]=t+48;
else
y[29-i]=t+55;
sum=sum/b;
}
for(j=0;j<=i-1;j++)
{
z[j]=y[29-i+j];
}
z[i]='\0';
printf("%s",z);}
else
printf("0");
} | 55 |
27,397 | int main ()
{
int number = 0;
int inum[1000] ;
int b, e;
int p = 0;
char cnum[1000];
cin >> b >> cnum >> e;
int len = strlen (cnum);
int i;
for (i = len - 1; i >= 0; i--)
{
if ( cnum [i] >= '0' && cnum[i] <= '9')
inum[p++] = cnum[i] - '0';
else if (cnum[i] >= 'a' && cnum[i] <= 'z')
inum[p++] = cnum[i] - 'a' + 10;
else inum[p++] = cnum[i] - 'A' + 10;
}
for (i = p - 1; i > 0; i--)
{
number = (number + inum[i]) * b;
}
int temp;
number += inum[0];
if (number == 0)
cout << "0" << endl;
for (i = 0; number > 0; i++)
{
temp = number % e;
number = number / e;
if (temp <= 9 && temp >= 0)
cnum[i] = temp + '0';
else
cnum[i] = temp + 'a' - 42;
}
for (p = i - 1; p >= 0; p--)
cout << cnum[p];
cout << endl;
return 0;
}
| 55 |
27,398 | 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 |
27,399 | 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 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.