id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
27,400 | void main()
{ int a,b,i=0,k;
long unsigned x[100]={0},y=0;
scanf("%d",&a);
k=getchar();
while((k=getchar())!=' '){
if(k>='A'&&k<='Z') k=k-55;
if(k>='a'&&k<='z') k=k-55-32;
if(k>='0'&&k<='9') k=k-48;
y=y*a+k;
}
scanf("%d",&b);
i=0;
if(y==0) printf("0");
while(y>0){
x[i]=y%b;
y=y/b;
i++;
}
for(i--;i>=0;i--)
{if(x[i]<10) printf("%d",x[i]);
else printf("%c",x[i]+55);
}
} | 55 |
27,401 | int main ()
{
int m,n;
int num,tot;
int i,j,k1,k2;
int a,b;
char c;
num=tot=0;
m=n=0;
a=b=0;
char s[300];
char s1[300];
int s2[300];
cin >>a;
gets(s);
k1=strlen(s);
k2=k1;
while (s[k1]!=' ') k1--;
k1--;
j=1;
for (i=k1;i>=1;i--)
{
if (isdigit(s[i]))
{
num=(int)s[i];
num=num-48;
tot=tot+j*num;
}
if (islower(s[i]))
{
num=(int)s[i];
num=num-97+10;
tot=tot+j*num;
}
if (isupper(s[i]))
{
num=(int)s[i];
num=num-65+10;
tot=tot+j*num;
}
j=j*a;
}
j=1;
for (i=k2-1;i>=k1+2;i--)
{
num=(int)s[i];
num=num-48;
b=b+j*num;
j=j*10;
}
m=0;
if (tot==0) cout <<0 <<endl;
while (tot>0)
{
m++;
s2[m]=tot%b;
tot=tot/b;
}
if (b<=10)
{
for (i=1;i<=m;i++)
cout <<s2[m-i+1];
}
else
{
for (i=1;i<=m;i++)
if (s2[m-i+1]<=9) cout <<s2[m-i+1];
else
{
n=s2[m-i+1]+65-10;
cout <<(char)n;
}
}
cout <<endl;
return 0;
}
| 55 |
27,402 | void zhuanhuan(char a[])
{
char t;
int i,length;
length=strlen(a);
for(i=0;i<length/2;i++)
{
t=a[i];
a[i]=a[length-i-1];
a[length-i-1]=t;
}
}
void main()
{
unsigned int i=0;
int sum=0,a,b;
char num_1[100],num_2[100];
scanf("%d %s %d",&a,num_1,&b);
while(num_1[i]!='\0')
{
if(num_1[i]>='0'&&num_1[i]<='9')
sum=sum*a+num_1[i]-'0';
else if(num_1[i]>='A'&&num_1[i]<='Z')
sum=sum*a+num_1[i]-'A'+10;
else if(num_1[i]>='a'&&num_1[i]<='z')
sum=sum*a+num_1[i]-'a'+10;
i++;
}
i=0;
while(sum/b!=0)
{
int yu=sum%b;
if(yu>=0&&yu<=9)num_2[i]='0'+yu;
else if(yu>=10)
num_2[i]='A'+yu-10;
sum=sum/b;
i++;
}
if(sum>=0&&sum<=9)num_2[i]='0'+sum;
if(sum>=10)num_2[i]='A'+sum-10;
num_2[i+1]='\0';
zhuanhuan(num_2);
if(num_2[0]!=0)puts(num_2);
else for(i=1;i<strlen(num_2)-1;i++)printf("%c",num_2[i]);
} | 55 |
27,403 |
int main()
{
int i,j,n,num,sum=0,x,k,o,t,a,b;
char *p;
sum=0;
p=(char*)malloc(sizeof(char)*20);
scanf("%d %s %d",&a,p,&b);
for(j=0;j<strlen(p);j++)
if(*(p+j)<='z'&&*(p+j)>='a')
*(p+j)-=32;
for(j=0;j<strlen(p);j++)
{
if(*(p+j)<='9'&&*(p+j)>='0')
{num=(int)*(p+j)-48;
t=strlen(p)-j;
while(t>1) num*=a,t--;}
else
{num=(int)*(p+j)-65+10;
t=strlen(p)-j;
while(t>1) num*=a,t--;}
sum+=num;
}
x=sum; k=0;
while(x/b!=0) k++,x=x/b;
char *q;
q=(char*)malloc(sizeof(char)*k);
x=sum;
*(q+k+1)='\0';
while(k>=0)
{o=x%b;
if(o<=9&&o>=0)
{*(q+k)=(char)(o+48);
x=x/b;
k--;}
else
{*(q+k)=(char)(o+55);
x=x/b;
k--;}
}
printf("%s\n",q);
}
| 55 |
27,404 | int main()
{
long int a,b,c,s,i,j,n,d[1000];
char t[10000];
scanf("%d%s%d",&a,&t,&b);
s=0;c=1;
n=strlen(t);
for(i=n-1;i>=0;i--)
{ if (t[i]>='a'&&t[i]<='z') s=s+c*(t[i]-87);
if (t[i]>='A'&&t[i]<='Z') s=s+c*(t[i]-55);
if (t[i]>='0'&&t[i]<='9') s=s+c*(t[i]-'0');
c=c*a;
}
i=0;
if (s==0) printf("%d",s);
while(s!=0)
{ if ((s%b)>9) d[i]=s%b+55;
else d[i]=s%b;
i++;
s=s/b;
}
for (j=i-1;j>=0;j--)
{ if (d[j]>=0&&d[j]<=9) printf("%d",d[j]);
if (d[j]>=65&&d[j]<=90) printf("%c",d[j]);
}
}
| 55 |
27,405 | int power(int,int);
int main ()
{
char number1[100],number2[100];
int i,first,second,ten=0,l1,l2=0,remain;
cin >> first ;
cin.get();
cin.getline(number1,100,' ');
cin >> second;
l1=strlen(number1);
for (i=0;i<l1;i++)
{
if (number1[i]>='a'&&number1[i]<='z')
ten=(number1[i]-'a'+10)*(int)(power(first,l1-i-1))+ten;
if (number1[i]>='A'&&number1[i]<='Z')
ten=(number1[i]-'A'+10)*(int)(power(first,l1-i-1))+ten;
if (number1[i]>='0'&&number1[i]<='9')
ten=(number1[i]-'0')*(int)(power(first,l1-i-1))+ten;
} //??????
remain=ten;
while (remain!=0)
{
remain=remain/second;
l2++;
}
if (ten==0)
l2=1;
for (i=0;i<l2;i++)
{
number2[i]=ten/(int)(power(second,l2-i-1));
ten=ten-number2[i]*(int)(power(second,l2-i-1));
if (number2[i]>=10)
number2[i]=number2[i]-10+'A';
else
number2[i]=number2[i]+'0';
}
number2[l2]='\0';
cout << number2 << endl;
return 0;
}
int power(int a,int b)
{
int i,sum = 1;
for(i = 1; i <= b; i++)
sum = sum * a;
return sum;
}
| 55 |
27,406 | 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 |
27,407 | int ppow(int a,int b){
int i,j;
j=1;
for(i=1;i<=b;i++){
j=j*a;
}
return j;
}
int qq(char t){
if(t<=57&&t>=48)
return t-48;
if(t<=90&&t>=65)
return t-55;
if(t<=122&&t>=97)
return t-87;
}
char rr(int t){
if(t<=9&&t>=0)
return t+48;
if(t<=35&&t>=10)
return t+55;
}
int main(){
char n[10000];
int a,b,m,i,j;
cin>>a>>n>>b;
if (n[0]=='0')
{
cout<<'0';
return 0;
}
m=0;
j=0;
while(n[m]!='\0')
m++;
for(i=0;i<=m-1;i++)
{
j=j+qq(n[i])*ppow(a,m-i-1);
}
m=(int)(log(j)/log(b))+1;
for(i=0;i<=m-1;i++){
cout<<rr(j/ppow(b,m-i-1));
j=j-(j/ppow(b,m-i-1))*ppow(b,m-i-1);
}
return 0;
} | 55 |
27,408 | int main(int argc, char* argv[])
{
long b,i,c,d,e=0,f;
char a[50],s[50];
long z[50];
scanf("%d%s%d",&b,a,&c);
d=strlen(a);
for(i=0;i<d;i++)
{
if(a[i]>='0'&&a[i]<='9')
z[i]=a[i]-48;
else if(a[i]>='A'&&a[i]<='Z')
z[i]=a[i]-55;
else if(a[i]>='a'&&a[i]<='z')
z[i]=a[i]-87;
}
for(i=0;i<d;i++)
{
for(f=0;f<d-i-1;f++)
z[i]=z[i]*b;
}
for(i=0;i<d;i++)
{
e=e+z[i];
}
for(i=0;;i++)
{
s[i]=e%c+48;
e=e/c;
if(e==0)
break;
}
long w;
w=i+1;
char t[50];
for(i=0;i<w;i++)
{
if(s[i]>'9')
s[i]=s[i]+7;
}
for(i=0;i<w;i++)
{
t[w-1-i]=s[i];
}
int y;
y=strlen(t);
for(i=0;i<w;i++)
{
if(t[i]!='\0')
printf("%c",t[i]);
else break;
}
return 0;
}
| 55 |
27,409 | 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 |
27,410 | void main()
{
long m,n,len,i,total=0,t=0;
char a[100],b[100];
scanf("%d%s%d",&m,&a,&n);
len=strlen(a);
for(i=0;i<len;i++)
{
if(a[i]<='9'&&a[i]>='0')
{
total=total+(a[i]-'0')*pow(m,len-1-i);
}
else
{
if(a[i]<='z'&&a[i]>='a')
{
total=total+(a[i]-'a'+10)*pow(m,len-1-i);
}
else
{
total=total+(a[i]-'A'+10)*pow(m,len-1-i);
}
}
}
if(total==0)printf("0\n");
else
{
for(i=0;total!=0;i++)
{
b[i]=total%n;
total=total/n;
t++;
if(b[i]<=9)b[i]=b[i]+'0';
else b[i]=b[i]+'A'-10;
}
for(i=t-1;i>=0;i--)
{
printf("%c",b[i]);
}
printf("\n");
}
} | 55 |
27,411 | void main()
{
int a,b,len,len2,i,j=0,m=1,k;
char c,str[50]={0},str2[50]={0};
long n=0;
scanf("%d",&a);
scanf("%s",str);
scanf("%d",&b);
len=strlen(str);
for(i=0;i<len;i++)
{
if((str[i]<='z')&&(str[i]>='a'))k=str[i]-87;
else if((str[i]<='Z')&&(str[i]>='A'))k=str[i]-55;
else if((str[i]<='9')&&(str[i]>='0'))k=str[i]-48;
n=a*n+k;
}
while(m!=0)
{
str2[j]=n%b;
if((str2[j]<=35)&&(str2[j]>=10))str2[j]+=55;
else if((str2[j]<=9)&&(str2[j]>=0))str2[j]+=48;
n=n/b;
m=n;
j++;
}
len2=strlen(str2);
for(j=len2-1;j>=0;j--)printf("%c",str2[j]);
printf("\n");
} | 55 |
27,412 |
int main(int argc, char* argv[])
{
int a,b,i=0,k,x=0,n=0,m=0;
char s[20];
int t[20];
scanf("%d%s%d",&a,s,&b);
while(s[i]!='\0')
{
n++;
i++;
}
for(i=0;i<n;i++)
{
if(s[i]<=57) k=(int)s[i]-48;
else if(s[i]<=90) k=(int)s[i]-55;
else k=(int)s[i]-87;
x=x+k*(int)pow(a,n-i-1);
}
i=0;
loop:;
t[i]=x%b;
x=x/b;
i++;
m++;
if(x!=0) goto loop;
for(i=m-1;i>=0;i--)
{
if(t[i]<=9)
printf("%d",t[i]);
else if(t[i]>=10)
{
t[i]=t[i]+55;
printf("%c",t[i]);
}
}
return 0;
}
| 55 |
27,413 | void main()
{
int i,j,k,l,a,b,c,s,m=0;
char n[32],x[32];
scanf("%d %s %d",&a,n,&b);
l=strlen(n);
for(i=0;i<l;i++)
{
for(j=1,s=1;j<=i;j++)s=s*a;
if(n[l-i-1]>=65&&n[l-i-1]<=90) k=n[l-i-1]-55;
else
if(n[l-i-1]>=97&&n[l-i-1]<=122) k=n[l-i-1]-87;
else k=n[l-i-1]-48;
k=k*s;
m=m+k;
}
for(i=0;;i++)
{
c=m%b;
if(c<=9) x[i]=c+48;
else x[i]=c+55;
if(m/b==0) break;
m=m/b;
}
for(j=0;j<=i;j++)
printf("%c",x[i-j]);
}
| 55 |
27,414 | int main()
{
int a,b,c=0;
char num1[200],num2[200];
cin>>a>>num1>>b;
for(int i=0;i<strlen(num1);i++)
{
if(num1[i]>=(int)'A'&&num1[i]<=(int)'Z')
num1[i]+=32;
}
for(int i=0;i<strlen(num1);i++)
{
if(num1[i]>=(int)'a'&&num1[i]<=(int)'z') c+=((int)num1[i]-87)*pow((double)a,(double)(strlen(num1)-1-i));
else if(num1[i]>=(int)'1'&&num1[i]<=(int)'9') c+=((int)num1[i]-48)*pow((double)a,(double)(strlen(num1)-1-i));
}
if(c==0) cout<<c<<endl;
else{
int j=0;
for(;;)
{
if(c==0) break;
if(c%b<10) num2[j]=(char)(c%b+48);
else num2[j]=(char)(c%b+55);
c=c/b;
j++;
}
for(int i=j-1;i>=0;i--)
{
cout<<num2[i];
}
cout<<endl;
}
return 0;
}
| 55 |
27,415 | 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 |
27,416 | int main()
{
int n=-1,a=0,b=0,num,s=0,i=0,j=1;//??????n ???a ????b ??????????num ??????????s ????i,j
char numb[32];//??????
cin >>a;//?????
numb[0]=cin.get();
do
{n++;}
while ((numb[n]=cin.get())!=' '); //??????
for (i=0;i<n;i++)//???????????
{
num=1;
if (numb[i]<58)
numb[i]=numb[i]-48;
else if (numb[i]>96)
numb[i]=numb[i]-87;
else numb[i]=numb[i]-55;
for (j=1;j<n-i;j++) num=num*a;
s+=num*numb[i];
}
cin >>b;
n=0;
do
{
num=s%b;
if (num<10)
numb[n]=num+48;
else
numb[n]=num+55;
n++;
s=s/b;
}
while (s!=0) ;
for (n=n-1;n>=0;n--) cout <<numb[n];//????????
return 0;
}
| 55 |
27,417 |
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 |
27,418 | void main ()
{
int a,b,i,j,len;
long k;
long num;
char c[70];
scanf ("%d%s%d",&a,&c,&b);
len=strlen(c);
for (i=len-1,num=0,k=1;i>=0;i=i-1,k=k*a)
{
if (c[i]>='a'&&c[i]<='z') c[i]=c[i]-'a'+10;
else if (c[i]>='A'&&c[i]<='Z') c[i]=c[i]-'A'+10;
else c[i]=c[i]-'0'+0;
num=num+c[i]*k;
} /*ok*/
if (num==0) printf ("0");
for (i=0,k=b;num!=0;i++,num=num/k)
{
c[i]=num%k;
if (c[i]<=9) c[i]=c[i]+'0';
else c[i]=c[i]-10+'A';
}
for (j=i-1;j>=0;j--) printf("%c",c[j]);
} | 55 |
27,419 | //******************************************
//*???????.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 |
27,420 | int main()
{
double a,b,d;
int e[1000];
char c[1000];
cin>>a>>c>>b;
d=strlen(c);
for(int i=0;i<d;i++)
{
if(c[i]>='0'&&c[i]<='9')
{
e[i]=c[i]-48;
}
else if(c[i]>='A'&&c[i]<='Z')
{
e[i]=c[i]-55;
}
else if(c[i]>='a'&&c[i]<='z')
{
e[i]=c[i]-87;
}
}
long long num=0;
for(int i=0;i<d;i++)
{
num=num+e[i]*pow(a,(d-i-1));
}
long long k[1000];
long long sum;
sum=num;
int t=-1;
int m;
m=b/1;
for(int i=0;i<1000;i++)
{
k[i]=sum%m;
sum=sum/m;
t=t+1;
if(sum<1)break;
}
char l[1000];
for(int i=0;i<=t;i++)
{
if(k[t-i]>=0&&k[t-i]<=9)
{
l[i]=k[t-i]+48;
}
else if(k[t-i]>=10&&k[t-i]<=35)
{
l[i]=k[t-i]+55;
}
}
for(int i=0;i<=t;i++)
{
cout<<l[i];
}
cout<<endl;
return 0;
} | 55 |
27,421 | void main()
{
int temp=0,a,b,k,i,o,p,j;
char c[40],s[40];
scanf("%d%s%d",&a,c,&b);
k=strlen(c);
for(i=0;i<k;i++)
{
if(c[i]>='a'&&c[i]<='z')
temp=a*temp+10+c[i]-'a';
else if(c[i]>='A'&&c[i]<='Z')
temp=a*temp+10+c[i]-'A';
else if(c[i]>='0'&&c[i]<='9')
temp=a*temp+c[i]-'0';
}
if(temp<b)
{
if(temp<=9)
printf("%c",temp+'0');
else
printf("%c",temp-10+'A');
}
else
{
for(p=0;;p++)
{
o=temp%b;
if(o<=9)
s[p]=o+'0';
else
s[p]=o-10+'A';
temp=temp/b;
if(temp<b)
break;
}
if(temp<=9)
s[p+1]=temp+'0';
else
s[p+1]=temp-10+'A';
for(j=0;j<=p+1;j++)
{
printf("%c",s[p+1-j]);
}
}
printf("\n");
}
| 55 |
27,422 | 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 |
27,423 | 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 |
27,424 | 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 |
27,425 | void main()
{
int a,b,t,i,j,n;
char s1[33],s2[33],temp;
scanf("%d %s %d",&a,s1,&b);
n=strlen(s1);
t=0;
for(i=0;i<n;i++)
{
if(s1[i]>='0'&&s1[i]<='9') t=t*a+(s1[i]-'0');
if(s1[i]>='a'&&s1[i]<='z') t=t*a+(s1[i]-'a'+10);
if(s1[i]>='A'&&s1[i]<='Z') t=t*a+(s1[i]-'A'+10);
}
i=0;
do
{
if(t%b>=0&&t%b<=9) s2[i]=t%b+'0';
if(t%b>=10&&t%b<36) s2[i]=t%b-10+'A';
t=t/b;
i++;
}
while(t!=0);
s2[i]='\0';
for(j=i-1;j>=i/2;j--)
{
temp=s2[j];
s2[j]=s2[i-1-j];
s2[i-1-j]=temp;
}
printf("%s",s2);
} | 55 |
27,426 | int main ()
{
long b,c,i,j,d=0,z[100],sum=0,k;
char a[100],s[36];
for (i=0;i<36;i++)
{
if(i>=0&&i<=9)
s[i]=i+48;
else
s[i]=i+55;
}
scanf ("%d %s %d",&b,a,&c);
d=strlen(a);
for (i=0;i<d;i++)
{
if (a[i]<123&&a[i]>96)
a[i]=a[i]-32;
}
for (i=0;i<d;i++)
{
for(j=0;j<36;j++)
{
if (a[i]==s[j])
sum=sum+j*pow(b,d-1-i);
}
}
for (i=0;i>=0;i++)
{
if (sum==0)
{
k=i;
break;
}
else
{
z[i]=sum%c;
sum=sum/c;
}
}
for(i=k-1;i>=0;i--)
printf("%c",s[z[i]]);
if (a[0]=='0')
printf("%c",a[0]);
return 0;
} | 55 |
27,427 | 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 |
27,428 | main()
{
int a,b,l,i,m,j,s;
char n[100];
scanf("%d %s %d",&a,&n,&b);
l=strlen(n);
for(i=0;i<=l-1;i++)
{
if(n[i]>='A'&&n[i]<='Z')
n[i]=n[i]-'A'+10;
else if(n[i]>='a')
n[i]=n[i]-'a'+10;
else
n[i]=n[i]-'0';
}
s=0;
for(i=l-1;i>=0;i--)
{
m=n[i];
for(j=0;j<l-i-1;j++)
{
m*=a;
}
s+=m;
}
i=0;
int x[100];
int y[100];
for(s=s;s>=b;s=s/b)
{
x[i]=s%b;
i++;
}
x[i]=s;
for(j=0;j<=i;j++)
{
y[j]=x[i-j];
}
for(j=0;j<=i;j++)
{
if(y[j]<=9&&y[j]>=0)
{
n[j]=y[j]+48;
}
else
n[j]=y[j]+55;
}
n[j]='\0';
puts(n);
}
| 55 |
27,429 | long times(int a ,int n)
{
long sum =1;
for (int i = 1;i<=n;i++)
{
sum*=a;
}
return sum;
}
long input(char n[1000],int a)
{
int la;
long out= 0;
la = strlen(n);
for (int i = la-1;i>=0;i--)
{
if (n[i]<=57)
{
int p;
p = (int)n[i]-48;
out+= ((long)p) *times(a,(la-i-1));
}
else
{
if (n[i]<=90)
{
int p;
p = (int)n[i]-55;
out+= ((long)p)*times(a,(la-i-1));
}
else
{
int p ;
p = (int)n[i]-87;
out+=((long)p)*times(a,(la-i-1));
}
}
}
return out;
}
int main()
{
int a ,b;
char n[1000];
cin>>a>>n>>b;
long out;
out = input(n,a);
char on[1000];
int la;
la = strlen(n);
int l;
for (l = 1; out/(long)b >= times(b,l-1);l++)
{
}
for (int i = 0;i<l;i++)
{
int p;
for (p = 0;out-times(b,(l-1-i))>=0;p++)
{
out-=times(b,(l-1-i));
}
if (p<=9)
{
on[i]=(char)(p+48);
}
else
{
on[i]=(char)(p+55);
}
}
on[l]='\0';
cout<<on;
}
| 55 |
27,430 | 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 |
27,431 | int main()
{
char n[1000];
int a,b,i,j=0,num=0,m[1000];
cin>>a>>n>>b;
int length=strlen(n);
for(i=0;i<length;i++)
{
if(n[i]>64 && n[i]<91) n[i]+=32;
}
for(i=0;i<length;i++)
{
if(n[i]>96 && n[i]<123)
{
num+=(n[i]-'a'+10)* pow ( (double)a ,(double)(length-1-i) );
}
else num+=(n[i]-'0') * pow( (double)a , (double)(length-1-i) );
}
for(i=0;;i++)
{
m[i] = num % b;
num = num/b;
j++;
if(num==0) break;
}
for(i=j-1;i>=0;i--)
{
if(m[i]>9) cout<<(char)(m[i]-10+'A');
else cout<<m[i];
}
return 0;
} | 55 |
27,432 | int main()
{
double a;int b;
char c[1000];
cin>>a;
cin>>c;
cin>>b;
int num=0,len,i;
int remain;
double x[1000];
len=strlen(c);
char m[1000];
int o[1000];
for(i=0;i<len;i++)
{
if(c[i]>='a'&&c[i]<='z')
x[i]=c[i]-'a'+10;
if(c[i]<='Z'&&c[i]>='A')
x[i]=c[i]-'A'+10;
if(c[i]>='0'&&c[i]<='9')
x[i]=c[i]-'0';
}
for(i=0;i<len;i++)
{ num+=x[i]*pow(a,len-1-i);}
remain=num;
int p=0;
do
{
o[p]=remain%b;
remain=(remain-o[p])/b;
p++;
}
while(remain>0);
for(i=0;i<p;i++)
{
if(o[i]>=10)
m[i]=o[i]-10+'A';
else
m[i]=o[i]+'0';
}
for(i=p-1;i>=0;i--)
cout<<m[i];
return 0;
} | 55 |
27,433 | void main()
{
int a,b,i,j;long int shijinzhi=0,result=0,q,p=0,k=0;
char n[100];
scanf("%d%s%d",&a,n,&b);
if(n[0]>=48&&n[0]<=57)
j=n[0]-48;
if(n[0]>=65&&n[0]<=90)
j=n[0]-55;
if(n[0]>=97&&n[0]<=122)
j=n[0]-87;
shijinzhi=shijinzhi+j;
for(i=1;;i++)
{
if(n[i]=='\0')
break;
else
{
if(n[i]>=48&&n[i]<=57)
j=n[i]-48;
if(n[i]>=65&&n[i]<=90)
j=n[i]-55;
if(n[i]>=97&&n[i]<=122)
j=n[i]-87;
shijinzhi=shijinzhi*a+j;
}
}
q=shijinzhi;
int s=1,t;
shijinzhi=shijinzhi/b;
while(shijinzhi!=0)
{
shijinzhi=shijinzhi/b;
s=s*b;
p++;
}
shijinzhi=q;
while(shijinzhi!=0)
{
t=shijinzhi/s;
if(t<=9)
printf("%c",t+48);
else
printf("%c",t+55);
shijinzhi=shijinzhi-t*s;
s=s/b;
k++;
}
if(k<p+1)
{
for(i=0;i<p+1-k;i++)
printf("%c",48);
}
}
| 55 |
27,434 | /* Note:Your choice is C IDE */
main()
{
int f(int a,int b);
int a,b,i,n,sum=0;
char s[999];
scanf("%d %s %d",&a,s,&b);
n=strlen(s);
for(i=0;i<n;i++)
{if(s[i]>=97&&s[i]<=122)
s[i]-=87;
else if(s[i]>=65&&s[i]<=90)
s[i]-=55;
if(s[i]>=48&&s[i]<=57)
s[i]-=48;}
for(i=0;i<n;i++)
sum+=s[i]*f(a,n-i-1);
for(i=0;;i++)
{
s[i]=sum%b;
sum=(sum-s[i])/b;
if(s[i]>9)
s[i]+=55;
if(sum==0)
break;
}
for(i=i;i>=0;i--)
{
if(s[i]>9)
printf("%c",s[i]);
else printf("%d",s[i]);
}
}
int f(int a,int b)
{
int i,n=1;
for(i=0;i<b;i++)
n*=a;
return n;
} | 55 |
27,435 | int main(){
int a,b,l,i,j,k=0,d[255];
char c[255];
long num=0;
scanf("%d%s%d",&a,c,&b);
l=strlen(c);
for(i=0;i<l;i++){
if(c[i]>='0' && c[i]<='9') d[i]=c[i]-'0';
else if(c[i]>='a' && c[i]<='z') d[i]=c[i]-'a'+10;
else d[i]=c[i]-'A'+10;
// printf("%d ",d[i]);
}
for(j=0;j<l;j++){
num+=d[j]*pow(a,i-1);
i--;
// printf("%ld ",num);
}
// printf("%d ",num);
if(num==0)printf("0\n");
else{
while(num>0){
d[k]=num%b;
if(d[k]>=0 && d[k]<=9) c[k]=d[k]+'0';
else if(d[k]>=10 && d[k]<='z'-'a'+10) c[k]=d[k]-10+'A';
num=num/b;
k++;
}
k--;
while(k>0){
printf("%c",c[k]);
k--;
}
printf("%c\n",c[k]);
}
return 0;
} | 55 |
27,436 | void main()
{
int a,b,i,j;
long k;
char n[50],m[50],s[50];
scanf("%d %s %d",&a,n,&b);
k=0;
for(i=0;i<strlen(n);i=i+1)
{
if(n[i]>=48&&n[i]<=57)
k=k*a+n[i]-48;
if(n[i]>='A'&&n[i]<='Z')
k=k*a+n[i]-55;
if(n[i]>='a'&&n[i]<='z')
k=k*a+n[i]-87;
}
if(k==0)
printf("0");
for(i=0;k>0;i=i+1)
{
if(k%b<10)
m[i]=k%b+48;
else m[i]=k%b+55;
k=k/b;
}
i=i-1;
for(j=0;i>=0;j=j+1)
{
s[j]=m[i];
i=i-1;
}
for(i=0;i<j;i=i+1)
{
printf("%c",s[i]);
}
}
| 55 |
27,437 | //
// main.cpp
// hw
//
// Created by ? ? on 12-12-16.
// Copyright (c) 2012? ? ?. All rights reserved.
//
char *atob(int a,int b,char *str1)
{
int len1=strlen(str1),Sum=0;
static char str2[100]={0};
for (int i=0; i<len1; i++) {//a????????
int s;
if (str1[i]<=57) {//?????????
s=str1[i]-'0';
}
if(str1[i]>=65&&str1[i]<=90)
{
s=str1[i]-'A'+10;
}
if(str1[i]>90)
{
s=str1[i]-'a'+10;
}
Sum+=s*pow(a, len1-i-1);
}
for (int i=0; Sum>0; i++) {//??????b??
if (Sum%b<10) {
str2[i]=Sum%b+'0';
}
else
{
str2[i]=Sum%b-10+'A';
}
Sum-=Sum%b;
Sum/=b;
}
int len=strlen(str2);
str2[len]=0;
return str2;
}
int main(int argc, const char * argv[])
{
int a,b;
char str1[100]={0};
cin>>a>>str1>>b;
if (str1[0]=='0') {
cout<<"0";
return 0;
}
char *str2=atob(a,b,str1);
int len=strlen(str2);
for (int i=len-1; i>=0; i--) {
cout<<*(str2+i);
}
return 0;
}
| 55 |
27,438 | //????
int main()
{
int a,b,j=0;
char str1[33],str2[33],str3[33];
cin>>a>>str1>>b; //????????????????
int i=0,dec=0;
while(str1[i]!=0) //?????????
{
dec=dec*a;
if(str1[i]<='9'&&str1[i]>='0')
dec=dec+str1[i]-'0';
else if(str1[i]>='A'&&str1[i]<='Z')
dec=dec+str1[i]-'A'+10;
else if(str1[i]>='a'&&str1[i]<='z')
dec=dec+str1[i]-'a'+10;
i++;
}
if(dec==0){
cout<<dec<<endl;
return 0;
}
while(dec!=0) //??????b???
{
str3[j]=dec%b;
if(str3[j]>9||str3[j]<0) str3[j]=str3[j]+'A'-10;
else str3[j]+='0';
dec=dec/b;
j++;
}
for(j--;j>=0;j--) //????
{
cout<<str3[j];
}
cout<<endl;
return 0;
}
| 55 |
27,439 | void main()
{
int a1,b1,temp=0,numtemp[10];
char num1[10],num2[10],c;
int i=0,j=0,k=0,n;
scanf("%d %s %d",&a1,num1,&b1);
while(num1[i]!='\0')
{
if(num1[i]>=97&&num1[i]<=122)
num1[i]-=32;
if(num1[i]>=65&&num1[i]<=90)
numtemp[i]=num1[i]-55;
else
numtemp[i]=num1[i]-48;
i+=1;
}
i-=1;
for(j=0;j<=i;j++)
temp+=numtemp[j]*power(a1,i-j);
i=0;
j=0;
while(power(b1,i)<temp)
i++;
j=i-1;
for(k=0;k<i;k++)
{
n=temp/power(b1,j);
if(n>=10)
c=(char)(n+55);
else
c=(char)(n+48);
temp-=power(b1,j)*n;
j--;
num2[k]=c;
n=0;
}
num2[k]='\0';
if(k!=0)
printf("%s\n",num2);
else
printf("0\n");
} | 55 |
27,440 | 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;
} | 55 |
27,441 | int main() //5
{
double m=0,n=0,sum=0;
char a[100]="0";
int b[100];
char c[100]="0"; //10
cin>>m;
cin>>a[0];
for(int i=1;i<100;i++)
{
if((a[i]=getchar())==' ')break; //15
}
cin>>n;
int longa=strlen(a);
for(int j=0;j<(longa-1);j++)
{ //20
b[j]=a[j];
if(b[j]>47&&b[j]<58)sum=sum+(b[j]-48)*pow(m,(longa-j-2));
if(b[j]>64&&b[j]<91)sum=sum+(b[j]-55)*pow(m,(longa-j-2));
if(b[j]>96&&b[j]<123)sum=sum+(b[j]-87)*pow(m,(longa-j-2));
} //25
int z=0,x=0,sum2=sum,n2=n;
do
{
z=sum2%n2;
sum2=sum2/n2; //30
if(z>=0&&z<10)c[x]=z+48;
if(z>=10&&z<37)c[x]=z+55;
x++;
}
while(sum2!=0); //35
int longc=strlen(c);
for(int y=1;y<=longc;y++)
{
cout<<c[longc-y];
} //40
return 0;
} | 55 |
27,442 |
long decimal(char c[],long x)
{
long d=0;
for(int i=0;c[i]!='\0';i++)
{
if(c[i]>='0'&&c[i]<='9')
d=d*x+c[i]-'0';
if(c[i]>='A'&&c[i]<='Z')
d=d*x+c[i]-'A'+10;
if(c[i]>='a'&&c[i]<='z')
d=d*x+c[i]-'a'+10;
}
return d;
}
int main()
{
long a,b;
int length;
char n[65] = {0};
cin>>a>>n>>b;
long x = decimal(n,a);
for(int i=0;x>=0;i++)
{
int remainder=x%b;
n[i]=remainder<10?'0'+remainder:'A'+remainder-10;
x=(x-remainder)/b;
length=i;
if(x==0)
break;
}
for(int i=length;i>=0;i--)
cout<<n[i];
cout<<endl;
return 0;
} | 55 |
27,443 | 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 |
27,444 | void main()
{
int a,b,i,j=0,x=0,y,z=1;
scanf("%d",&a);
char a_shu[65],b_shu[65];
while(1)
{
if((y=getchar())!=' ')
a_shu[j++]=y;
else
if(j>0)
{
a_shu[j]='\0';
break;
}
}
for(i=0;a_shu[i]!='\0';i++)
{
if(a_shu[i]<='z'&&a_shu[i]>='a')
a_shu[i]-='a'-10;
else
if(a_shu[i]<='Z'&&a_shu[i]>='A')
a_shu[i]-='A'-10;
else
a_shu[i]-=48;
}
scanf("%d",&b);
for(i--;i>=0;i--)
{
x+=a_shu[i]*z;
z=z*a;
}
for(i=0;x>=b;i++)
{
b_shu[i]=x%b;
x=x/b;
if(b_shu[i]>=10)
b_shu[i]+='A'-10;
}
if(x>=10)
{
x+='A'-10;
printf("%c",x);
}
else
printf("%d",x);
for(i--;i>=0;i--)
if(b_shu[i]>=10)
printf("%c",b_shu[i]);
else
printf("%d",b_shu[i]);
}
| 55 |
27,445 | int main()
{
long a,b,n,i,p[100];
long sum=0;
char u[100];
scanf("%ld%s%ld",&a,u,&b);
n=strlen(u);
if(u[0]=='0')
printf("0\n");
else{
for(i=0;i<n;i++)
{
if(u[i]>='0'&&u[i]<='9')
sum=sum+(u[i]-48)*pow(a,n-i-1);
if(u[i]>='a'&&u[i]<='z')
sum=sum+(u[i]-87)*pow(a,n-i-1);
if(u[i]>='A'&&u[i]<='Z')
sum=sum+(u[i]-55)*pow(a,n-i-1);
}
long t;
t=sum;
i=0;
n=0;
while(t!=0)
{
p[i]=t%b;
t=t/b;
i++;
n++;
}
for(i=n-1;i>=0;i--)
{
if(p[i]<=9)
printf("%ld",p[i]);
if(p[i]>=10)
printf("%c",p[i]+55);
}
}
return 0;
} | 55 |
27,446 | int main(int argc, char* argv[])
{
int a[50],i,z1,z2,n;
long x,z;
char s1[3],s2[50],s3[3],s[50];
scanf("%s %s %s",s1,s2,s3);
z1=atoi(s1);z2=atoi(s3);z=1;x=0;
n=strlen(s2);
for (i=0;i<n;i++)
if ((s2[i]>='A')&&(s2[i]<='Z')) s2[i]=s2[i]+32;
for (i=0;i<n;i++)
{
if (s2[i]<='9') a[i]=s2[i]-'0';
else a[i]=s2[i]-'a'+10;
}
for (i=n-1;i>=0;i--)
{
x=x+a[i]*z;
z=z*z1;
}
i=0;
while (x!=0)
{
a[i]=x%z2;
i++;
x=(x-x%z2)/z2;
}
if (i==0) printf("0");
else
{
n=i-1;
for (i=n;i>=0;i--)
if (a[i]<10) s[n-i]='0'+a[i];
else s[n-i]='A'+a[i]-10;
s[n+1]='\0';
puts(s);
}
return 0;
}
| 55 |
27,447 | 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 |
27,448 | void main()
{
int a,b,k,i,m,j,n,o;
long ten=0;
char x[32]="\0"; char y[32]="\0";
scanf("%d %s %d",&a,x,&b);
k=strlen(x);
for(i=0;i<k;i++)
{
ten=a*ten;
if(x[i]<60)
ten=ten+(x[i]-48);
else if(x[i]<95) ten=ten+(x[i]-55);
else ten+=(x[i]-87);
}
j=0;
do{
m=ten%b;
ten=(ten-m)/b;
if(m<10) y[j]=m+48;
else y[j]=m+55;
j++;
}
while(ten!=0);
n=strlen(y);
for(o=n-1;o>=0;o--)
{
printf("%c",y[o]);
}
} | 55 |
27,449 | //vc++??????
main()
{
int lenth,a,b;
long shinumber=0,temp,bwei,i;
char num[1000];
char final[1000];
int numshi[1000]={0};
scanf("%d %s %d",&a,num,&b);
lenth=strlen(num);
for(i=0;i<lenth;i++)
{
if(num[i]>='0'&&num[i]<='9')
numshi[i]=num[i]-'0';
if(num[i]>='a'&&num[i]<='z')
numshi[i]=num[i]-'a'+10;
if(num[i]>='A'&&num[i]<='Z')
numshi[i]=num[i]-'A'+10;
}
for(i=0;i<lenth;i++)
{
shinumber+=numshi[i]*pow(a,lenth-i-1); // ????
}
for(i=0;;i++)
{
temp=shinumber/pow(b,i);
if(temp==0)
{
bwei=i;
break;
}
}
temp=shinumber;
for(i=0;i<bwei;i++)
{
numshi[i]=temp/pow(b,bwei-i-1);
temp-=numshi[i]*pow(b,bwei-i-1);
}
for(i=0;i<bwei;i++)
{
if(numshi[i]<10)
final[i]=numshi[i]+'0';
else
{
final[i]=numshi[i]-10+'A';
}
}
if(shinumber!=0)
for(i=0;i<bwei;i++)
{
printf("%c",final[i]);
}
else
printf("0");
}
| 55 |
27,450 |
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 |
27,451 | main()
{
int a,n,b,i,j;
int l;
int sum=0;
char c[40];
int d[40];
char e[40];
char f[40];
scanf("%d %s %d",&a,c,&b);
l=strlen(c);
if(c[0]=='0')
printf("0");
else
{
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++)
{
if(c[i]>='a')
d[i]=c[i]-'a'+10;
else
d[i]=c[i]-'0';
sum=sum*a+d[i];
}
for(i=0;sum!=0;i++)
{
e[i]=sum%b;
sum=sum/b;
if(e[i]>9)
e[i]=e[i]-10+'A';
else
e[i]=e[i]+'0';
}
for(j=0;j<=i;j++)
f[j]=e[i-j-1];
f[i]='\0';
printf("%s",f);
getchar();
getchar();
}
}
| 55 |
27,452 | void main()
{
int a1,a2,i,len,j;
unsigned long t=0,n[40],k;
char num1[40];
scanf("%d%s%d",&a1,&num1,&a2);
len=strlen(num1);
for(i=len-1,j=0;i>=0;i--,j++)
{
if(num1[i]>='A'&&num1[i]<='Z')n[i]=10+num1[i]-'A';
if(num1[i]>='a'&&num1[i]<='z')n[i]=10+num1[i]-'a';
if(num1[i]>='0'&&num1[i]<='9')n[i]=1+num1[i]-'1';
t=t+n[i]*(int)pow(a1,j);
}
for(i=0;;i++)
{
k=t/(int)pow(a2,i);
if(k<a2)/* ! */
break;
}
for(;i>=0;i--)
{
n[i]=t/(int)pow(a2,i);
t=t-(int)pow(a2,i)*n[i];
if(n[i]>=0&&n[i]<=9)
printf("%c",n[i]+48);
if(n[i]>=10&&n[i]<=35)
printf("%c",n[i]+55);
}
}
| 55 |
27,453 | void main()
{long int num=0;
char s[50],t[50];
int a,b,i,x=0,j;
scanf("%d",&a);
scanf("%s",s);
scanf("%d",&b);
for(i=0;s[i]!='\0';i++)
{if(s[i]>='a'&&s[i]<='z')s[i]=s[i]-'a'+10;
else if(s[i]>='A'&&s[i]<='Z')s[i]=s[i]-'A'+10;
else if(s[i]>='0'&&s[i]<='9')s[i]=s[i]-'0';}
for(i=0;s[i]!='\0';i++)
num=num*a+s[i];
for(i=49;i>=0;i--)
{t[i]=num%b;
num=num/b;}
i=0;
while(x==0)
{if(t[i]==0)i++;
else x++;
if (i==50){printf("0");x++;}}
for(j=i;j<=49;j++)
{if(t[j]>=10&&t[j]<=35)
t[j]=t[j]+'A'-10;
else t[j]=t[j]+'0';
printf("%c",t[j]);}
} | 55 |
27,454 | int main()
{
double a;int b;
char c[1000];
cin>>a;
cin>>c;
cin>>b;
double num=0;
int len,i;
int remain;
double x[1000];
len=strlen(c);
char m[1000];
int o[1000];
for(i=0;i<len;i++)
{
if(c[i]>='a'&&c[i]<='z')
x[i]=c[i]-87;
if(c[i]<='Z'&&c[i]>='A')
x[i]=c[i]-55;
if(c[i]>='0'&&c[i]<='9')
x[i]=c[i]-48;
}
for(i=0;i<len;i++) //
{ num+=x[i]*pow(a,len-1-i);}
remain=num;
int p=0;
while(remain>0)
{
o[p]=remain%b;
remain=(remain-o[p])/b;
p++;
}
for(i=0;i<p;i++)
{
if(o[i]>=10)
m[i]=o[i]+55;
else
m[i]=o[i]+48;
}
for(i=p-1;i>=0;i--)
cout<<m[i];
if(p==0)
cout<<0<<endl;
return 0;
}
| 55 |
27,455 | 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 |
27,456 | 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 |
27,457 | long f(long a,char str[20],int l);
long F(long n,long b);
int main()
{
long a,b,n;int i,l;char str[20];
cin >> a >> str >> b;
l=strlen(str);
for(i=0;i<l;i++)
{
if(str[i]>96&&str[i]<123)
str[i]=str[i]-32;
}
n=f(a,str,l);
F(n,b);
return 0;
}
long f(long a,char str[20] ,int l)
{
long sum=0;int i,t,num=1;
for(i=l-1;i>=0;i--)
{
if(str[i]>64&&str[i]<91)
{
t=str[i]-'A'+10;
}
else
t=str[i]-'0';
sum=sum+t*num;
num=num*a;
}
return sum;
}
long F(long n,long b)
{
int i=0,str[200];char a;
if(n==0)
cout << "0" << endl;
while(n>0)
{
str[i]=n%b;
n=n/b;
i++;
}
for(i=i-1;i>=0;i--)
{
if(str[i]>=0&&str[i]<=9)
cout << str[i];
else
{
a='A'+str[i]-10;
cout << a;
}
}
cout << endl;
return 0;
}
| 55 |
27,458 | 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 |
27,459 | /*
* ????
* ???1000010549
* ?????
* ???2010-11-13
*/
int main()
{
double a,n1[10000],sum1; //??????
int i,j,b,sum2,k1,k2,la,s[1000];
char l[10000],n[10000],n2[10000],a1[2],b1[2];
cin.getline(l,10000); //?????
i=0;
while (l[i]!=' ') //??????n????
{
a1[i]=l[i];
i++;
}
la=i;
i=i+1;
k1=0;k2=0;
while (l[i]!=' ') //??????????
{
n[k1]=l[i];
i++;
k1++;
}
i=i+1;
while (l[i]!='\0') //????????
{
b1[k2]=l[i];
i++;
k2++;
}
if (la==1) //????????
a=(int)a1[0]-48;
else
a=((int)a1[0]-48)*10+(int)a1[1]-48;
if (k2==1)
b=(int)b1[0]-48;
else
b=((int)b1[0]-48)*10+(int)b1[1]-48;
for(i=0;i<k1;i++) //????????????
{
if ('a'<=n[i]&&n[i]<='z')
{
n[i]=n[i]-32;
}
}
sum1=0;
for(i=0;i<k1;i++)
{
if('0'<=n[i]&&n[i]<='9')
{
n1[i]=(int)(n[i])-48;
sum1=sum1+n1[i]*pow(a,k1-i-1);
}
else
{
n1[i]=(int)(n[i])-55;
sum1=sum1+n1[i]*pow(a,k1-i-1);
}
}
sum2=(int)sum1;
if (b==10) //?????????????
cout<<sum2<<endl;
else if (b<10) //??????????
{
for(i=0;i<1000;i++)
s[i]=1;
i=0;
while (sum2>=b)
{
s[i]=sum2%b;
sum2=(sum2-s[i])/b;
i++;
}
cout<<sum2;
for(j=i-1;j>=0;j--)
cout<<s[j];
}
else if (10<b&&b<=36) //????11?36???
{
for(i=0;i<1000;i++)
s[i]=1;
i=0;
while (sum2>=b)
{
s[i]=sum2%b;
sum2=(sum2-s[i])/b;
if(s[i]<10)
{n2[i]='0'+s[i];}
else
{n2[i]='A'+s[i]-10;}
i++;
}
if(sum2<10)
{n2[i]='0'+sum2;}
else
{n2[i]='A'+sum2-10;}
for (j=i;j>=0;j--)
{cout<<n2[j];}
}
return 0;
}
| 55 |
27,460 | long int sum=0;
char a[10000];
long int c[10000];
int main()
{
long int i,j,k,l,n,m,y=0,x,t=0;
long int hhh(int q, int p);
char b[10000];
scanf("%d %s %d",&n,a,&x);
l=strlen(a);
for(i=0;i<l;i++)
{if(a[i]>96&&a[i]<123)
a[i]=a[i]-87;
if(a[i]>64&&a[i]<91)
a[i]=a[i]-55;
if(a[i]>47&&a[i]<58)
a[i]=a[i]-48;
}
for(i=l-1;i>=0;i--)
{c[i]=(int)a[i]*hhh(n,l-1-i);
}
for(i=0;i<l;i++)
sum=sum+c[i];
if(sum==0)t=1;
while(sum>0)
{b[y]=sum%x;
sum=sum/x;
y++;
}
for(i=0;i<y;i++)
{if(b[i]>9)
b[i]=b[i]+55;
else b[i]=b[i]+48;
}
if(t==0)
{
for(i=y-1;i>=0;i--)
printf("%c",b[i]);
}
if(t==1)
printf("0");
}
long int hhh(int q, int p)
{
long int i,w=1;
for(i=0;i<p;i++)
w=q*w;
return w;
}
| 55 |
27,461 | 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 |
27,462 | 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 |
27,463 | /************************************
2.cpp
???Nov 9, 2011
??(12.9) ????
?? 1100012886
************************************/
/*
note:
0-48
A-65
a-97
*/
char str[100], res[100]; //???????????
int a, b, decimal = 0; //decimal??????10???????
void fix() //?????????????????
{
int i = 0;
do
{
if (str[i] > 96) str[i] = str[i] - 32;
i++;
} while (str[i] != '\0');
}
void turn1() //?????????10??
{
int i = 0, t; //t??????????
do
{
if (str[i] > 64) t = str[i] - 55; else t = str[i] - 48;
decimal = decimal * a + t;
i++;
} while (str[i] != '\0');
}
void turn2() //???10?????b?????
{
int i = 0, j, t; //t??????????
//????
while (decimal >= b)
{
t = decimal % b;
if (t > 9) res[i] = t + 55; else res[i] = t + 48;
decimal = decimal / b;
i++;
}
t = decimal % b;
if (t > 9) res[i] = t + 55; else res[i] = t + 48;
//????
for (j = i; j >= 0; j--) cout << res[j];
}
int main()
{
cin >> a >> str >> b;
fix();
turn1();
turn2();
return 0;
} | 55 |
27,464 | 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 |
27,465 | void main()
{
int m,n;
char a[100];
scanf("%d %s %d",&m,a,&n);
int x,i;
long int t=0;
x=strlen(a);
for(i=0;i<=x-1;i++)
{if(a[i]>='0'&&a[i]<='9')t=t*m+a[i]-48;
else if(a[i]>='a'&&a[i]<='z')t=t*m+a[i]-87;
else if(a[i]>='A'&&a[i]<='Z')t=t*m+a[i]-55;}
char b[100];
for(i=0;i<=99;i++) b[i]='\0';
for(i=99;t!=0;i--)
{if(t%n>=0&&t%n<=9) {b[i]=t%n+48;t=t/n;}
else if(t%n>=10) {b[i]=t%n+55;t=t/n;}
}
for(i=0;b[i]=='\0'&&i<=99;i++){}
if(i==100) printf("0");
for(i;i<=99;i++) {putchar(b[i]);}
printf("\n");
}
| 55 |
27,466 | int main()
{
int a,b,i,x=0,len,c[10000],m[10000];
char n[10000]; cin>>a>>n>>b;
for (i=0;n[i]!='\0';i++)
{ if (n[i]>='a' && n[i]<='z' )
c[i]=n[i]-'a'+10;
else if(n[i]>='A' && n[i]<='Z')
c[i]=n[i]-'A'+10;
else c[i]=n[i]-'0';
x=x*a+c[i];
}
i=0;
for (i=0;x>=b;i++)
{
m[i]=x%b;
x=x/b;
}
m[i]=x; len=i;
for (i=len;i>=0;i--)
{
if (m[i]>9) cout<<(char)(m[i]-10+'A');
else cout<<m[i];
}
return 0;
}
| 55 |
27,467 | 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 |
27,468 | int main()
{
int jinzhi1,jinzhi2,length,i,j,m=0,n,sum=0,k;//jinzhi1?????????jinzhi2???????,length???????i?j?m?n?k?????sum??????
int shu[40],shu2[40];//??????????????????
char input[40],output[40];//input?????output??????
cin>>jinzhi1>>input>>jinzhi2;
length=strlen(input);//???????
for(i=0;i<length;i++)
{
shu[i]=input[i];//??????????????ASCII?
if(shu[i]<65) shu[i]=shu[i]-48;//?????
else if (shu[i]<97) shu[i]=shu[i]-55;//????
else shu[i]=shu[i]-87;//????
for(j=length-i-1;j>0;j--) shu[i]=shu[i]*jinzhi1;
sum=sum+shu[i];//??????
}
if (sum==0) cout<<sum;
else
{
for(k=0;sum>0;k++)
{
shu2[k]=sum%jinzhi2;//??????
sum=sum/jinzhi2;
if (shu2[k]<10) shu2[k]=shu2[k]+48;//????ASCII??????
else shu2[k]=shu2[k]+55;
output[k]=shu2[k];
m++;
}
for(n=m-1;n>=0;n--) cout<<output[n];//???????????????????
}
cin.get();
cin.get(); cin.get(); cin.get(); cin.get(); cin.get();
return 0;
} | 55 |
27,469 | int main()
{
long a,b,i,j,length,result=0;
char c[100];
long final[100];
long temp;
scanf("%d %s %d",&a,c,&b);
int decimal[100];
length=strlen(c);
char finalString[1000];
for(i=0;i<length;i++)
{
if(c[i]>='A'&&c[i]<='Z')
{
decimal[i]=c[i]-'A'+10;
}
else if(c[i]>='a'&&c[i]<='z')
{
decimal[i]=c[i]-'a'+10;
}
else if(c[i]>='0'&&c[i]<='9')
{
decimal[i]=c[i]-'0';
}
}
for(i=0;i<length;i++)
{
result=result+decimal[length-i-1]*(int)(pow((double)a,i));
}
if(result==0)
{
printf("0");
}
else
{
for(i=0;result!=0;i++)
{
final[i]=result%b;
result=result/b;
}
for(j=0;j<i/2;j++)
{
temp=final[j];
final[j]=final[i-j-1];
final[i-j-1]=temp;
}
for(j=0;j<i;j++)
{
if(final[j]<10)
{
finalString[j]=final[j]+'0';
}
else
{
finalString[j]=final[j]+'A'-10;
}
}
finalString[i]='\0';
puts(finalString);
printf("\n");
}
}
| 55 |
27,470 |
int chf(int x,int y)
{
int j,z;
for (z=1,j=0;j<y;j++){
z=z*x;
}
return z;
}
int main(int argc, char* argv[])
{
char c1[50];
int a1,a2,i,l,k,sh=0,count=0;
int b[50],d[50];
scanf("%d",&a1);
scanf("%s",c1);
scanf("%d",&a2);
l=strlen(c1);
for (i=0;i<l;i++){
if (c1[i]=='0')
b[i]=0;
if (c1[i]=='1')
b[i]=1;
if (c1[i]=='2')
b[i]=2;
if (c1[i]=='3')
b[i]=3;
if (c1[i]=='4')
b[i]=4;
if (c1[i]=='5')
b[i]=5;
if (c1[i]=='6')
b[i]=6;
if (c1[i]=='7')
b[i]=7;
if (c1[i]=='8')
b[i]=8;
if (c1[i]=='9')
b[i]=9;
if (c1[i]=='a'||c1[i]=='A')
b[i]=10;
if (c1[i]=='b'||c1[i]=='B')
b[i]=11;
if (c1[i]=='c'||c1[i]=='C')
b[i]=12;
if (c1[i]=='d'||c1[i]=='D')
b[i]=13;
if (c1[i]=='e'||c1[i]=='E')
b[i]=14;
if (c1[i]=='f'||c1[i]=='F')
b[i]=15;
if (c1[i]=='g'||c1[i]=='G')
b[i]=16;
if (c1[i]=='h'||c1[i]=='H')
b[i]=17;
if (c1[i]=='i'||c1[i]=='I')
b[i]=18;
if (c1[i]=='j'||c1[i]=='J')
b[i]=19;
if (c1[i]=='k'||c1[i]=='K')
b[i]=20;
if (c1[i]=='l'||c1[i]=='L')
b[i]=21;
if (c1[i]=='m'||c1[i]=='M')
b[i]=22;
if (c1[i]=='n'||c1[i]=='N')
b[i]=23;
if (c1[i]=='o'||c1[i]=='O')
b[i]=24;
}
for (i=0;i<l;i++){
sh=sh+b[i]*chf(a1,l-1-i);
}
if (sh==0) { printf("0"); return 0;}
for (i=0;;i++){
d[i]=sh%a2;
sh=sh/a2;
count++;
if (sh<a2)
{
d[i+1]=sh;
break;
}
}
for (k=i+1;k>=0;k--){
if (d[k]==17)
printf("H");
if (d[k]==16)
printf("G");
if (d[k]==15)
printf("F");
if (d[k]==14)
printf("E");
if (d[k]==13)
printf("D");
if (d[k]==12)
printf("C");
if (d[k]==11)
printf("B");
if (d[k]==10)
printf("A");
if (d[k]==9)
printf("9");
if (d[k]==8)
printf("8");
if (d[k]==7)
printf("7");
if (d[k]==6)
printf("6");
if (d[k]==5)
printf("5");
if (d[k]==4)
printf("4");
if (d[k]==3)
printf("3");
if (d[k]==2)
printf("2");
if (d[k]==1)
printf("1");
if (d[k]==0)
printf("0");
if (d[k]==18)
printf("I");
if (d[k]==19)
printf("J");
if (d[k]==20)
printf("K");
if (d[k]==21)
printf("L");
if (d[k]==22)
printf("M");
if (d[k]==23)
printf("N");}
return 0;
}
| 55 |
27,471 | void main()
{
char c[100],d[100],e='a';
long int a,b,m,k,s=0,p,q,i=0,j;
scanf("%d%s%d",&a,c,&b);
m=strlen(c);
while(c[i]!=0)
{
if('A'<=c[i]&&c[i]<='Z')
c[i]+='a'-'A';
i++;
}
for(i=0;i<m;i++)
{
if(a<=10)
k=c[i]-48;
else
{
if(48<=c[i]&&c[i]<=57)
k=c[i]-48;
else
{
k=9;
while(e<=c[i])
{
k=k++;
e++;
}
}
}
for(j=1;j<(m-i);j++)
k=k*a;
s=s+k;
e='a';
}
i=0;
e='A';
if(s==0)
printf("0");
else
{
while(s>0)
{
p=s/b;
q=s%b;
s=p;
if(0<=q&&q<=9)
d[i]=q+48;
else
for(j=10;j<=q;j++)
{
d[i]=e;
e++;
}
i++;
e='A';
}
i--;
for(;i>=0;i--)
printf("%c",d[i]);
}
} | 55 |
27,472 | //****************************************
//*??????? **
//*????? 1100013004 **
//*???2010.11.13 **
//****************************************
int a,b,i,j,n,sum = 0,mi,k = 1;
char num[100],input[100];
void calc(){
for(i = n - 1; i >= 0 ;i--)
{
if(num[i] <= '9')
sum += (num[i] - '0') * k;
else
{
if(num[i] <= 'Z')
sum += ((num[i] - 'A') + 10) * k;
else
sum += ((num[i] - 'a') + 10) * k;
}
k *= a;
}
}
int main()
{
cin>>a;
cin.get();
cin.getline(num,100,' ');
cin>>b;
for(i = 0; num[i] != 0;i++);
n = i;
calc();
i = 0;
do
{
mi = sum % b;
if (mi < 10)
input[i] = mi + '0';
else
input[i] = 'A' + mi - 10;
sum = sum / b;
i++;
}while(sum > 0);
for (j = i - 1;j >= 0;j--)
cout<<input[j];
return 0;
}
| 55 |
27,473 | int main()
{
long convert_to10(char str[], int a);
void convert_from10(long a, int b);
int a, b;
char str[100];
cin >> a >> str >> b;
convert_from10(convert_to10(str, a), b);
return 0;
}
long convert_to10(char str[], int a)
{
int len, i;
long num10 = 0;
len = strlen(str);
for (i = 0; i < len; i++)
{
if (str[i] >= 'A' && str[i] <= 'Z')
num10 = num10 * a + str[i] - 'A' + 10;
if (str[i] >= 'a' && str[i] <= 'z')
num10 = num10 * a + str[i] - 'a' + 10;
if (str[i] >= '0' && str[i] <= '9')
num10 = num10 * a + str[i] - '0';
}
return num10;
}
void convert_from10(long a, int b)
{
char str[10000];
int i, j, k, len;
for (i = 0;;i++)
{
k = a % b;
if (k < 10)
str[i] = k + '0';
else
str[i] = k - 10 + 'A';
a = (a - k) / b;
len = i;
if (a == 0)
{
for (j = len; j >= 0; j--)
cout << str[j];
break;
}
}
}
| 55 |
27,474 | main()
{
char c[40];
int a,b,x,i,l,k;
scanf("%d %s %d",&a,c,&b);
l=strlen(c);
if (c[0]=='0')
printf("0\n");
else
{
for (i=0;i<l;i++)
{
if (c[i]>='A'&&c[i]<='Z')
c[i]=c[i]-'A'+'a';
}
x=0;
int d;
for(i=0;i<l;i++)
{
if (c[i]>='a')
d=c[i]-'a'+10;
else
d=c[i]-'0';
x=d+x*a;
}
char e[40];
for(k=0;x!=0;k++)
{
e[k]=x%b;
x=x/b;
}
e[k]='\0';
char f[40];
for(i=0;i<k;i++)
{
if (e[i]<10)
f[k-1-i]=e[i]+'0';
else
f[k-1-i]=e[i]+'A'-10;
}
f[k]='\0';
printf("%s",f);
}
}
| 55 |
27,475 | 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 |
27,476 | int main()
{
unsigned long shuz1,shuz2,total=0;
int i=0,j=0,k=0,length;
char n[33],result[33];
cin>>shuz1>>n>>shuz2;
for(i=0;i<33;i++)
{
if(n[i]=='\0')
{
length=i;
break;
}
}
for(i=0;i<length;i++)
{
if(n[i]>60&&n[i]<93)
total+=(n[i]-55)*pow((double)shuz1,length-i-1);
else if(n[i]>93)
total+=(n[i]-87)*pow((double)shuz1,length-i-1);
else
total+=(n[i]-48)*pow((double)shuz1,length-i-1);
}
if (total == 0) {
cout << 0 << endl;
return 0;
}
for(j=0;total>0;j++)
{
result[j]=total%shuz2;
total=(total-result[j])/shuz2;
}
for(k=0;k<33;k++)
{
if(result[k]<10)
result[k]=result[k]+48;
else
result[k]=result[k]+55;
}
for(k=j-1;k>=0;k--)
cout<<result[k];
cout << endl;
return 0;
}
| 55 |
27,477 | void main()
{
long int n=0,m;
int a,b,i,j,k,l,t=0;
char s[20],d[20];
scanf("%d %s %d",&a,s,&b);
l=strlen(s);
for(i=0;i<l;i++)
{
if(s[i]>='0'&&s[i]<='9')
k=s[i]-'0';
if(s[i]>='a'&&s[i]<='z')
k=s[i]-'a'+10;
if(s[i]>='A'&&s[i]<='Z')
k=s[i]-'A'+10;
m=k;
for(j=1;j<l-i;j++)
m=m*a;
n=n+m;
}
if(n==0)
printf("0");
for(i=0;n>0;i++)
{
if(n%b<10)
d[i]=n%b+'0';
else
d[i]=n%b+'A'-10;
n=n/b;
}
for(j=i-1;j>=0;j--)
printf("%c",d[j]);
} | 55 |
27,478 | //*******************
//*???????*
//*??????*
//*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 |
27,479 | void transform(int,char[],int);
int main()
{
int from,to;
char num[50]={0};
cin>>from;
cin.get();
cin.getline(num,50,' ');
cin>>to;
transform(from,num,to);
cout<<num;
return 0;
}
void transform(int from,char num[],int to)
{
int i,n,num_1[50];
long number=0;
char rebmun[50]={0};
for(i=0;num[i]!=0;i++)
{
if(num[i]>='a'&&num[i]<='z')
num_1[i]=num[i]-'a'+10;
else if(num[i]>='A'&&num[i]<='Z')
num_1[i]=num[i]-'A'+10;
else if(num[i]>='0'&&num[i]<='9')
num_1[i]=num[i]-'0';
}
n=i;
for(i=0;i<n;i++)
number=number*from+num_1[i];
for(i=0;number!=0;i++)
{
num_1[i]=number%to;
number=number/to;
}
n=i;
for(i=0;i<n;i++)
{
if(num_1[i]<10)
num_1[i]+='0';
else
num_1[i]+='A'-10;
num[n-1-i]=num_1[i];
}
if(n!=0)
num[n]=0;
else
{
num[0]='0';
num[1]=0;
}
} | 55 |
27,480 | int main()
{
int i,a,b,n,e[100],f[100],value=0;//?????????????
char c[100],d[100];//????????????
cin>>a>>c>>b;
n=strlen(c);
for(i=0;i<n;i++)
if(c[i]>91)c[i]=c[i]-32;//???????????????
for(i=0;i<n;i++)
{
if(c[i]>60)c[i]=c[i]-55;//?????A~Z?????10~35
else
c[i]=c[i]-48;//???0~9?????0~9/* cout<<f[i];*/
}
for(i=0;i<n;i++)
e[i]=(int)(c[i]);//?????c[i]??????????e[i]
for(i=0;i<n;i++)
value=value+e[i]*pow((double)a,(double)(n-i-1));//?????????
if(value==0)cout<<value;
for(i=0;i<100;i++)
if(pow((double)b,(double)i)<value)
{
f[i]=(value%((int)pow((double)b,(double)(i+1))))/
(int)pow((double)b,(double)i);//?f[i]?????????
d[i]=(char)(f[i]);
if(d[i]>9)d[i]=d[i]+55;//???10~35???????A~Z
else
d[i]=d[i]+48;//?0~9???????0~9
}
for(i=99;i>=0;i--)
if(pow((double)b,(double)i)<value)
{
cout<<d[i];
}
return 0;
} | 55 |
27,481 |
int main(int argc, const char *argv[]) {
int a, b, i, s2[100] = {
0
}
, s1[100] = {
0
}
, Sum = 0;
char str1[100], str2[100];
cin >> a >> str1 >> b;
int len1 = strlen(str1);
for (i = 0; i < len1; i++) {
//a????????
if (str1[i] <= 57) {
//?????????
s1[i] = str1[i] - '0';
}
if (str1[i] >= 65 && str1[i] <= 90) {
s1[i] = str1[i] - 'A' + 10;
}
if (str1[i] > 90) {
s1[i] = str1[i] - 'a' + 10;
}
s2[i] = s1[i] *pow((double)a, len1 - i - 1);
Sum += s2[i];
}
if(Sum == 0) {
cout << '0';
return 0;
}
for (i = 0; Sum > 0; i++) {
//??????b??
if (Sum % b < 10) {
str2[i] = Sum % b + '0';
} else {
str2[i] = Sum % b - 10+'A';
}
Sum -= Sum % b;
Sum /= b;
}
str2[i] = '\0';
int len2 = strlen(str2);
for (i = len2 - 1; i >= 0; i--) {
cout << str2[i];
}
return 0;
} | 55 |
27,482 | 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 |
27,483 |
int main(int argc, char* argv[])
{
unsigned int a,b,n;
char num[100]={0};
cin>>a>>num>>b;
int i;
unsigned int s=0;
n=strlen(num);//?????
for(i=0;i<n;i++)
{
if(num[i]>='a')
num[i]=num[i]-87;
else if(num[i]>='A')
num[i]=num[i]-55;
else
{
num[i]=num[i]-48;
}
s=(int)(s+num[i]*pow((double)a,(double)(n-i-1)));//??
}
//cout<<s<<endl;
char m[100];
int j=0;
for(j=0;s>0;j++)
{
m[j]=s%b;
s=s/b;
if(m[j]>9)
m[j]=m[j]+55;
else
m[j]=m[j]+48;
}
if(j == 0 )
cout<<0;
else
for(j=j-1;j>=0;j--)
cout<<m[j];
return 0;
} | 55 |
27,484 | 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] <= '9')
num1 = num1 + (str[i] - '0') * y;
if((str[i] >= 'A')&&(str[i] < 'a'))
num1 = num1 + (str[i] - 'A' + 10) * y;
if(str[i] >= 'a')
num1 = num1 + (str[i] - 'a' + 10) * y;
}
x = num1;
do
{
num1 = num1 / b;
j++;
}while(num1 > 0);
for(k = 0 ; k < j; k++)
{
if(x % b < 10)
num[j - 1 - k] = x % b + 48;
if(x % b >= 10)
num[j - 1 - k] = x % b + 55;
x = x / b;
}
for(h = 0; h < j ; h++)
cout << num[h];
return 0;
} | 55 |
27,485 |
int main()
{
int a,b;
char n[N];
int i,j,t,l;
int sum=0;
scanf("%d %s %d",&a,n,&b);
l=strlen(n);
for(i=0;i<=l/2-1;i++)
{
t=n[i];
n[i]=n[l-i-1];
n[l-i-1]=t;
}
//puts(n);
for(i=0;i<l;i++)
{
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 if(n[i]>='a'&&n[i]<='z')
t=n[i]-'a'+10;
for(j=1;j<=i;j++)
{
t=t*a;
}
sum=sum+t;
}
for(i=0;i<N;i++)
n[i]='\0';
for(i=0;sum>=b;i++)
{
n[i]=sum%b;
sum=(sum-sum%b)/b;
if(n[i]<10)
{
n[i]=n[i]+'0';
}
else if(n[i]>=10)
{
n[i]=n[i]-10+'A';
}
}
if(sum<10)
{
n[i]=sum+'0';
}
else if(sum>=10)
{
n[i]=sum-10+'A';
}
l=strlen(n);
for(i=l-1;i>=0;i--)
printf("%c",n[i]);
return 0;
} | 55 |
27,486 | 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 |
27,487 | int main()
{
char N1[32];
int N2[32];
int N3[32];
int a,b,n=0;
cin>>a;
cin>>N1;
cin>>b;
int len1=strlen(N1);
for(int i=0;i<len1;i++)
{
if(N1[i]>='a'&&N1[i]<='z')
N1[i]-=('a'-'A');
if(N1[i]>='A'&&N1[i]<='Z')
N3[i]=N1[i]-'A'+10;
else
N3[i]=N1[i]-'0';
}
for(int i=0;i<len1;i++)
n=n * a+N3[i];
if(n==0)
{
cout<<0<<endl;return 0;}
int j;
for(j=0;n!=0;j++)
{
N2[j]=n%b;
n=n/b;
}
for(j --;j>=0;j--)
if (N2[j] < 10)
cout<<N2[j];
else
cout << (char)(N2[j] - 10 + 'A');
return 0;
}
| 55 |
27,488 | const long maxL=300;
long a,b;
char str[maxL+10];
long from[maxL+10],to[maxL+10];
long ans[maxL+10];
main(){
long i,j,k,L,x;
scanf("%ld%s%ld",&a,str,&b);
L=strlen(str);
for(i='0';i<='9';i++){
from[i]=i-'0';
to[i-'0']=i;
}
for(i='a';i<='z';i++)from[i]=i-'a'+10;
for(i='A';i<='Z';i++){
from[i]=i-'A'+10;
to[i-'A'+10]=i;
}
x=0;
for(i=0;i<L;i++){
x*=a;
x+=from[str[i]];
}
L=0;
while(x){
ans[++L]=x%b;
x/=b;
}
if(L==0)ans[++L]=0;
for(i=L;i>=1;i--){
printf("%c",to[ans[i]]);
}
printf("\n");
return 0;
}
| 55 |
27,489 | long int shijinzhi(int a,char n[100])
{
int i;
long int z=0;
for(i=0;i<strlen(n);i++)
{
if(n[i]>='0'&&n[i]<='9')
{
z+=pow(a,strlen(n)-1-i)*(n[i]-'0');
}
else if(n[i]>='a'&&n[i]<='z')
{
z+=pow(a,strlen(n)-1-i)*(n[i]-'a'+10);
}
else if(n[i]>='A'&&n[i]<='Z')
{
z+=pow(a,strlen(n)-1-i)*(n[i]-'A'+10);
}
}
return z;
}
void zhuanhuan(long int x,char a[1000],int b)
{
int yushu,l,j;
int i=0;
char n[1000]={0};
if(b<=10)
{
do
{
yushu=x%b;
x=x/b;
n[i]=yushu+'0';
i++;
}while(x>=b);
n[i]=x+'0';
}
else if(b>10)
{
do
{
yushu=x%b;
x=x/b;
if(yushu<=9)
n[i]=yushu+'0';
else if(yushu>9)
n[i]=yushu-10+'A';
i++;
}while(x>=b);
if(x<=9)
n[i]=x+'0';
else if(x>9)
n[i]=x-10+'A';
}
for(l=i,j=0;l>=0;l--,j++)
{
a[j]=n[l];
}
}
void main()
{
int a,b,i,p;
long int x;
char n[1000]={0};
scanf("%d %s %d",&a,&n,&b);
x=shijinzhi(a,n);
p=strlen(n);
for(i=0;i<=p;i++)
{n[i]=0;}
zhuanhuan(x,n,b);
if(n[0]!='0') printf("%s",n);
else printf("0");
} | 55 |
27,490 |
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 |
27,491 | int main()
{
int i,j,a,n,b;
char s[100];
char str[]="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int c[100];
scanf("%d%s%d",&a,s,&b);
n=strlen(s);
for(i=0;i<n;i++){
if(s[i]>='a'&&s[i]<='z')
c[i]=s[i]-'a'+10;
if(s[i]>='A'&&s[i]<='Z')
c[i]=s[i]-'A'+10;
if(s[i]>='0'&&s[i]<='9')
c[i]=s[i]-'0';
}
int k=0;
for(i=0;i<n;i++){
k=k*a;
k+=c[i];
}
j=0;
if(k==0)
printf("0");
else{
while(k!=0){
s[j]=str[k%b];
k=k/b;
j++;
}
}
for(i=j-1;i>=0;i--){
printf("%c",s[i]);
}
} | 55 |
27,492 | int main()
{
int a,b;
long ans = 0;
char x[20] = {0};
scanf("%d %s %d",&a,x,&b);
if(a == b) printf("%s\n",x);
//printf("%d %s %d\n",a,x,b);
else{
long flag = 1;
for(int i = strlen(x) - 1;i >= 0;i --){
long temp;
if(x[i] >= '0' && x[i] <= '9') temp = x[i] - '0';
if(x[i] >= 'A' && x[i] <= 'Z') temp = x[i] - 'A' + 10;
if(x[i] >= 'a' && x[i] <= 'z') temp = x[i] - 'a' + 10;
ans += temp * flag;
// printf("%lld\n",ans);
flag *= a;
}
if(ans == 0) printf("0\n");
else{
// printf("%lld\n",ans);
long final[100] = {0};
flag = 0;
while(ans > 0){
flag ++;
final[flag] = ans % b;
ans /= b;
}
for(int i = flag;i >= 1;i --){
if(final[i] >= 10){
printf("%c",final[i] - 10 + 'A');
}
else printf("%ld",final[i]);
}
printf("\n");
}
}
return 0;
} | 55 |
27,493 | int main()
{
int a,b,temp,i;
long s=0,l=1;
char n[20000],m[20000];
scanf("%d%s%d",&a,n,&b);
int len = strlen(n);
for (i=len-1; i>=0; l*=a,i--)
{
if (n[i]<='9' && n[i]>='0')
s+=(n[i]-'0')*l;
else if(n[i]>='a' && n[i]<='z')
s+=(n[i]-'a'+10)*l;
else
s+=(n[i]-'A'+10)*l;
}
for (i=0;s>0;i++)
{
temp=s%b;
s=s/b;
if (temp>9)
m[i]=(char)'A'+temp-10;
else
m[i]=(char)'0'+temp;
}
for (i--;i>=0;i--)
{
printf("%c",m[i]);
}
printf("\n");
return 0;
} | 55 |
27,494 |
int main(int argc, char* argv[])
{
int a,b;
int i,j;
int c=0;//c????n???
char n[20];
int num=0;//10????????
scanf("%d%s%d",&a,n,&b);
int k;//k??????(??a????????)
//????n???
for(i=0;n[i]!='\0';i++)
{c++;}
//???n???10???
for(i=0;n[i]!='\0';i++)
{
k=1;
for(j=c-i-1;j>0;j--)
{
k*=a;
}
switch (n[i])
{
case 'a': num+=10*k;break;
case 'A': num+=10*k;break;
case 'b': num+=11*k;break;
case 'B': num+=11*k;break;
case 'c': num+=k*12;break;
case 'C': num+=k*12;break;
case 'd': num+=k*13;break;
case 'D': num+=k*13;break;
case 'e': num+=k*14;break;
case 'E': num+=k*14;break;
case 'f': num+=k*15;break;
case 'F': num+=k*15;break;
case 'g': num+=k*16;break;
case 'G': num+=k*16;break;
case 'h': num+=k*17;break;
case 'H': num+=k* 17;break;
case 'i': num+=k* 18;break;
case 'I': num+=k* 18;break;
case 'j': num+=k* 19;break;
case 'J': num+=k* 19;break;
case 'k': num+=k* 20;break;
case 'K': num+=k* 20;break;
case 'l': num+=k* 21;break;
case 'L': num+=k* 21;break;
case 'm': num+=k* 22;break;
case 'M': num+=k* 22;break;
case 'n': num+=k* 23;break;
case 'N':num+=k* 23;break;
case 'o':num+=k* 24;break;
case 'O':num+=k* 24;break;
case 'p':num+=k* 25;break;
case 'P':num+=k* 25;break;
case 'q':num+=k* 26;break;
case 'Q':num+=k* 26;break;
case 'r':num+=k* 27;break;
case 'R':num+=k* 27;break;
case 's':num+=k* 28;break;
case 'S':num+=k* 28;break;
case 't':num+=k* 29;break;
case 'T':num+=k* 29;break;
case 'u':num+=k* 30;break;
case 'U':num+=k* 30;break;
case 'v':num+=k* 31;break;
case 'V':num+=k* 31;break;
case 'w':num+=k* 32;break;
case 'W':num+=k* 32;break;
case 'x':num+=k* 33;break;
case 'X':num+=k* 33;break;
case 'y':num+=k* 34;break;
case 'Y':num+=k* 34;break;
case 'z':num+=k* 35;break;
case 'Z':num+=k* 35;break;
case '0':num+=k* 0;break;
case '1':num+=k* 1;break;
case '2':num+=k* 2;break;
case '3':num+=k* 3;break;
case '4':num+=k* 4;break;
case '5':num+=k* 5;break;
case '6':num+=k* 6;break;
case '7':num+=k* 7;break;
case '8':num+=k* 8;break;
case '9':num+=k* 9;break;
}
}
int p[20];
int q,count=0;
for(i=0;(num/b)>0;i++)
{
q=num%b;
p[i]=q;
count++;
num=num/b;
}
switch (num)
{
case 10:printf("A");break;
case 11:printf("B");break;
case 12:printf("C");break;
case 13:printf("D");break;
case 14:printf("E");break;
case 15:printf("F");break;
case 16:printf("G");break;
case 17:printf("H");break;
case 18:printf("I");break;
case 19:printf("J");break;
case 20:printf("K");break;
case 21:printf("L");break;
case 22:printf("M");break;
case 23:printf("N");break;
case 24:printf("O");break;
case 25:printf("P");break;
case 26:printf("Q");break;
case 27:printf("R");break;
case 28:printf("S");break;
case 29:printf("T");break;
case 30:printf("U");break;
case 31:printf("V");break;
case 32:printf("W");break;
case 33:printf("X");break;
case 34:printf("Y");break;
case 35:printf("Z");break;
default:printf("%d",num);break;
}
for(i=count-1;i>=0;i--)
{
switch (p[i])
{
case 10:printf("A");break;
case 11:printf("B");break;
case 12:printf("C");break;
case 13:printf("D");break;
case 14:printf("E");break;
case 15:printf("F");break;
case 16:printf("G");break;
case 17:printf("H");break;
case 18:printf("I");break;
case 19:printf("J");break;
case 20:printf("K");break;
case 21:printf("L");break;
case 22:printf("M");break;
case 23:printf("N");break;
case 24:printf("O");break;
case 25:printf("P");break;
case 26:printf("Q");break;
case 27:printf("R");break;
case 28:printf("S");break;
case 29:printf("T");break;
case 30:printf("U");break;
case 31:printf("V");break;
case 32:printf("W");break;
case 33:printf("X");break;
case 34:printf("Y");break;
case 35:printf("Z");break;
default:printf("%d",p[i]);break;
}
}
return 0;
}
| 55 |
27,495 | int main()
{
long k=0,a,b,i,h=0,c;
unsigned int e[100];
char n[100];
scanf("%d %s %d",&a,n,&b);
c = strlen(n);
for(i=0;i<=c-1;i++)
{
if(n[i]>='0'&& n[i]<='9')
n[i]=n[i]-('0'-0);
if(n[i]<='Z' && n[i]>='A')
n[i]=n[i]-('A'-10);
if(n[i]>='a' && n[i]<='z')
n[i]=n[i]-'a'+10;
h=a*h+n[i];
}
if(h==0)
printf("0");
for(i=0;h>0;i++)
{
e[i]=h%b;
h=h-e[i];
h=h/b;
k=k+1;
}
for(i=0;i<=k-1;i++)
{
n[i]=e[k-1-i];
if (n[i]>9)
n[i]=n[i]+'A'-10;
else
n[i]=n[i]+'0';
}
n[k]='\0';
printf("%s\n",n);
getchar();
getchar();
getchar();
getchar();
return 0;
} | 55 |
27,496 | int main()
{
char n[100]=" ";
double a=0.0;
int b=0,N=0,i=0,j=0,p=0,sum=0;
cin>>a>>n>>b;
N=strlen(n);
for(i=0;i<N;i++)
{
if('A'<=n[i]&&n[i]<='Z')
n[i]=n[i]-55;
else if('a'<=n[i]&&n[i]<='z')
n[i]=n[i]-87;
else if('0'<=n[i]&&n[i]<='9')
n[i]=n[i]-48;
}
for(i=0;i<N;i++)
sum=sum+n[i]*pow(a,N-i-1);
if(sum>0)
{
for(i=0;sum>0;i++)
{
n[i]=sum%b;
sum=(sum-n[i])/b;
}
for(j=0;j<=i/2;j++)
{
p=n[j];
n[j]=n[i-j];
n[i-j]=p;
}
for(j=0;j<=i;j++)
{
if(0<=n[j]&&n[j]<=9)
n[j]=n[j]+48;
else if(n[j]>9)
n[j]=n[j]+55;
}
for(j=1;j<=i;j++)
cout<<n[j];
}
else if(sum==0)
cout<<"0"<<endl;
return 0;
}
| 55 |
27,497 | 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 |
27,498 | 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 |
27,499 | int main()
{
long long int n=0,a,a0,b;
int i=0,j;
char change1(char),change2(char);
char str[1000],put[1000];
scanf("%lld ",&a0);
do
{
scanf("%c",&str[i]);
if(str[i]>96) str[i]=str[i]-32;
i=i+1;
}
while(str[i-1]!=' ');
i=i-1;
scanf("%lld",&b);
a=1;
for(j=i-1;j>=0;j--)
{
n=n+a*change1(str[j]);
a=a*a0;
}
j=0;
while(n!=0)
{
put[j]=change2((char)(n%b));
n=n/b;
j=j+1;
}
if(j>0)
{
for(i=j-1;i>=0;i--)
printf("%c",put[i]);
}
if(j==0)
printf("0");
return 0;
}
char change1(char m)
{
if(m<='9'&&m>='0') m=m-'0';
if(m>'9') m=m-'A'+10;
return(m);
}
char change2(char m)
{
if(m>=10) m=m-10+'A';
if(m<10) m=m+'0';
return(m);
} | 55 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.