id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
27,200 | void main()
{
int a,b;
int d;
int length;
char c[20];
int n[20];
char result[200];
int i,k,j;
int temp1=0;
scanf("%d%s%d",&a,c,&b);
for(i=0;c[i]!=0;i++)
{
if(c[i]>='a'&&c[i]<='z')
n[i]=c[i]-'a'+10;
if(c[i]>='A'&&c[i]<='Z')
n[i]=c[i]-'A'+10;
if(c[i]>='0'&&c[i]<='9')
n[i]=c[i]-'0';
}
length=i;
d=0;
for(k=0;k<length;k++)
{
d=d*a+n[k];
}
for(i=0;d!=0;i++){
temp1=d%b;
d=d/b;
if(temp1>=10)
temp1=temp1-10+'A';
else
temp1=temp1+'0';
result[i]=temp1;
}
result[i]=0;
for(j=i-1;j>=0;j--){
printf("%c",result[j]);
}
if(i==0)
printf("0");
}
| 55 |
27,201 | int main()
{ long i,k=0,a1,a2,x;
char a[32],b[80];
scanf("%d%s%d",&a1,a,&a2);
for(i=0;a[i]!='\0';i++)
{if(a[i]>='0'&&a[i]<='9')
k=a1*k+a[i]-'0';
if(a[i]>='a'&&a[i]<='z')
k=a1*k+a[i]-'a'+10;
if(a[i]<='Z'&&a[i]>='A')
k=a1*k+a[i]-'A'+10;
}
if(k==0)printf("0");
for(i=0;k!=0;i++)
{
x=k%a2;
if(x>=10)
b[i]=x-10+'A';
else
b[i]=x+'0';
k=k/a2;
}
while(i)
{
i--;
printf("%c",b[i]);
}
return 0;} | 55 |
27,202 | void main()
{
long int i,m,k,s,c[32],a,b;char n[32];
scanf("%d%s%d",&a,n,&b);
m=0;s=1;k=0;i=31;
while(i>=0)
{
if(n[i]>=48)
{
if(n[i]>=97)n[i]=n[i]-87;
else if(n[i]>=65)n[i]=n[i]-55;
else n[i]=n[i]-48;
m=n[i]*s;
s=s*a;
k=k+m;
}
i--;
}
i=0;
do
{
c[i]=k%b;
k=k/b;
i++;
}while(k!=0);
for(--i;i>=0;i--)
{
if(c[i]>9)printf("%c",c[i]+55);
else printf("%d",c[i]);
}
printf("\n");
}
| 55 |
27,203 | int main()
{
char s3[100],s1[100],s2[100],s[100];
long q=0,a,b;
int i,p=0,m,t;
scanf ("%ld %s %ld",&a,s3,&b);
t=strlen (s3);
for (i=t-1;i>=0;i--)
{
s[t-1-i]=s3[i];
s[t-i]='\0';
}
for (i=0;s[i]!='\0';i++)
{
if (s[i]>='a'&&s[i]<='z')
{
q=q+(s[i]-'a'+10)*pow(a,i);
}
else if (s[i]>='A'&&s[i]<='Z')
{
q=q+(s[i]-'A'+10)*pow(a,i);
}
else if (s[i]>='0'&&s[i]<='9')
{
q=q+(s[i]-'0')*pow(a,i);
}
}
if (q==0)
{
printf ("0");
}
else if (q!=0)
{
for (i=0;q!=0;i++)
{
p=q%b;
if (p>=10)
{
s1[i]=p+55;
}
else
{
s1[i] =p+48;
}
s1[i+1]='\0';
q=q/b;
}
m=strlen(s1);
for (i=m-1;i>=0;i--)
{
s2[m-1-i]=s1[i];
s2[m-i]='\0';
}
printf ("%s",s2);
}
return 0;
}
| 55 |
27,204 | int main()
{
char numa[100],numb[100];//???a???b??
long na[100],nb[100];
long a,b;
cin>>a>>numa>>b;
long digit_a=0;
long m=1,j;
while(numa[digit_a]!=0)
digit_a++;
//??a??????
for(j=1;j<digit_a;j++)
m=m*a;
long i;
long numd=0;
for(i=0;i<digit_a;i++)
{
if((numa[i]>='a')&&(numa[i]<='z'))
na[i]=numa[i]-87;
if((numa[i]>='A')&&(numa[i]<='Z'))
na[i]=numa[i]-55;
if((numa[i]>='0')&&(numa[i]<='9'))
na[i]=numa[i]-48;
numd=numd+m*na[i];
m=m/a;
}
//???????numd
if(numd==0)
cout<<0<<endl;
long k=0;
while(numd!=0)
{
nb[k]=numd%b;
numd=numd/b;
if((nb[k]>=0)&&(nb[k]<=9))
numb[k]=nb[k]+48;
else
numb[k]=nb[k]+55;
k++;
}
//k?b??????
long t;
for(t=k-1;t>=0;t--)
cout<<numb[t];
return 0;
}
| 55 |
27,205 |
int main()
{
int a,b,i;
char num[100];
long sum=0;
int temp;
char ans[100];
scanf("%d %s %d",&a,num,&b);
int len;
len=strlen(num);
for(i=0;i<len;i++)
{
if((num[i]>='0')&&(num[i]<='9')){sum*=a;sum+=num[i]-'0';}
if((num[i]>='A')&&(num[i]<='Z')){sum*=a;sum+=num[i]-'A'+10;}
if((num[i]>='a')&&(num[i]<='z')){sum*=a;sum+=num[i]-'a'+10;}
}
for(i=0;;i++)
{
temp=sum%b;
sum=sum/b;
if(temp<10)ans[i]=temp+'0';
else ans[i]=temp-10+'A';
if(sum==0)break;
}
for(int j=i;j>=0;j--)
{
printf("%c",ans[j]);
}
return 0;
}
| 55 |
27,206 | //*****************************
//*??? :???? *
//*?? :??? *
//*?? :2011?11? *
//*****************************
void zhuan(int, char [], int);
int main ()
{
int a, b;
char n[101];
cin >> a >> n >> b;
zhuan(a, n, b);
return 0;
}
void zhuan(int a, char n[], int b)
{
int i, m[101], s, t;
for (i = 0; ; i++)
{
if (n[i] =='\0') break;
if (n[i] >= 'a' && n[i] <= 'z')
{
m[i] = n[i] - 'a' + 10;
continue;
}
if (n[i] >= 'A' && n[i] <= 'Z')
m[i] = n[i] - 'A' + 10;
else m[i] = n[i] - '0';
}
t = i;
s = m[0];
if (s == 0) cout << 0;
for (i = 0; i < t - 1; i++)
s = s * a + m[i + 1];
for (i = 0; ; i++)
{
if (s == 0) break;
m[i] = s % b;
s = s / b;
}
t = i - 1;
for (i = t; i >= 0; i--)
{
if (m[i] < 10)
cout << m[i];
else cout << (char) (m[i] - 10 + 'A');
}
}
| 55 |
27,207 | int main()
{
char str[50]; long a=0,b=0; //?????str[50],?????????????????????a,b, ??????????????
long i=0; //??????i?
long n=1,s=0; //n??a??????1????????s???????????
cin>>a;
for(i=0;i<50;i++)
{
str[i]=getchar(); //????????????????????str[i]?
if((str[i]==' ')&&(i>0))
break;
}
i=i-1;
for(i;i>0;i--) //?a???????????
{
if((str[i]<58)&&(str[i]>47))
{
str[i]=str[i]-48;
}
else if((str[i]>64)&&(str[i]<91))
{
str[i]=str[i]-55;
}
else if(str[i]>96)
{
str[i]=str[i]-87;
}
s=s+str[i]*n;
n=n*a;
}
cin>>b;
char c='A',d='A'; //????c?d??????????????????A?
long j=0,k=10,q=10; //??????j,k,q????????0?10,10?
int r[50]; //?????r[50]???????????
while(s>=b) //?s???b????????
{
r[j]=s%b;
s=s/b;
j++;
}
j=j-1;
if(s<=9)
{
cout<<s;
}
else
{
for(q=10;q<36;q++)
{
if(s==q)
{
cout<<d;
break;
}
d=d+1;
}
d='A';
}
for(j;j>=0;j--)
{
if(r[j]<=9)
{
cout<<r[j];
}
else
{
for(k=10;k<36;k++)
{
if(r[j]==k)
{
cout<<c;
break;
}
c=c+1;
}
c='A';
}
}
cin.get();cin.get();
return 0;
}
| 55 |
27,208 | int main()
{
long int num10=0;//??????10?????b?????????
int a,b,i,j;//a,b??,i,j???????????
char character1[100],character2[100];//???????????
cin>>a;
cin.get();
for(i=0;;i++)
{
character1[i]=cin.get();
if(character1[i]>='a'&&character1[i]<='z')
character1[i]=character1[i]-87;
else if(character1[i]>='A'&&character1[i]<='Z')
character1[i]=character1[i]-55;
else if(character1[i]>='0'&&character1[i]<='9')
character1[i]=character1[i]-48;
else break;
num10=num10*a+character1[i];
}
cin>>b;
for(j=0;;j++)
{
if(num10%b<=9)
character2[j]=num10%b+48;
if(num10%b>9)
character2[j]=num10%b+55;
num10=num10/b;
if(num10==0)
break;
}
for(;j>=0;j--)
cout<<character2[j];
cout<<endl;
cin.get();cin.get();cin.get();
return 0;
} | 55 |
27,209 |
void main()
{
int i,j,k,t,l;
long sum=0;
int a,b;
char c[100];
scanf("%d%s%d",&a,c,&b);
for(i=0;i<strlen(c);i++)
{
if(c[i]>='0'&&c[i]<='9')
c[i]-=47;
else if(c[i]>='a'&&c[i]<='z')
c[i]=c[i]-'a'+11;
else if(c[i]>='A'&&c[i]<='Z')
c[i]=c[i]-'A'+11;
}
for(k=0;k<strlen(c);k++)
{
sum=sum*a+(c[k]-1);
// printf("%d",sum);
}
for(j=0;sum>0;j++)
{
c[j]=sum%b;
sum=sum/b;
}
for(t=0;t<j;t++)
{
if(c[t]>=0&&c[t]<=9)
c[t]+=48;
else if(c[t]>=10&&c[t]<=36)
c[t]=c[t]+'A'-10;
}
if(j!=0)
for(l=j-1;l>=0;l--)
{
printf("%c",c[l]);
}
else
printf("0");
printf("\n");
}
| 55 |
27,210 | main()
{
long long int e,d,i,j,k,q,sum=0;
int a,b=0;
int w[1000];
char c[10000];
char t[10000];
scanf("%d %s %d",&a,c,&b);
d=strlen(c);
sum=0;
q=1;
for(i=0;i<=(d-1);i++)
{
e=0;
if((c[i]>='A')&&(c[i]<='Z'))
e=c[i]-'A'+10;
else
{
if((c[i]>='a')&&(c[i]<='z'))
e=c[i]-'a'+10;
else
e=c[i]-'0';
}
for(j=1;j<=d-1-i;j++)
e=e*a;
sum=sum+e;
}
for(k=1;;k++)
{
q=q*b;
if(q>sum)
break;
}
for(i=k-1;i>=0;i--)
{
w[i]=sum%b;
sum=sum-w[i];
sum=sum/b;
}
for(j=0;j<k;j++)
{
if(w[j]>=10)
t[j]=w[j]+'A'-10;
else
t[j]=w[j]+'0';
}
printf("%s",t);
printf("\n");
getchar();
getchar();
getchar();
}
| 55 |
27,211 | main()
{
int a=0,b=0,m=0,j=0,i=0,k=0,l=0,y=0;
char n[1000],o[1000];
for(j=0;j<=1000;j++)
{o[j]='\0';}
scanf("%d %s %d",&a,n,&b);
//strlwr(n);
for(j=0;n[j]!='\0';j++)
if(n[j]>='A'&&n[j]<='Z')
n[j]=n[j]-'A'+'a';
//j=strlen(n);
for(i=0;i<j;i++)
{
if(n[i]>='a'&&n[i]<='z')
n[i]=n[i]-'a'+10;
else if(n[i]>='0'&&n[i]<='9')
n[i]=n[i]-'1'+1;
}
for(i=0;i<j;i++)
{
k=n[i];
for(l=0;l<(j-i-1);l++)
{
k=k*a;
}
m=m+k;
}
//printf("%d",m);
do
{
for(y=1;o[y]!='\0';y++);
//y=strlen(o);
for(i=y;i!=0;i--)
{
o[i]=o[i-1];
}
o[0]=m%b;
if(o[0]=='\0')
o[0]=46;
m=(int)m/b;
}
while(m!=0);
y=strlen(o);
for(i=0;i<y;i++)
{
if(o[i]>=10&&o[i]<=36)
o[i]=o[i]-10+'A';
else if(o[i]>=0&&o[i]<=9)
o[i]=o[i]-1+'1';
else if(o[i]==46)
o[i]='0';
}
printf("%s",o);
return 0;
}
| 55 |
27,212 | int main()
{
char str[35],end='A'; //str????????end?????????
int i=0,a=0,b=0,weishu=0; //i??????a,b?????????
long sum=0; //sum??????????????
cin>>a;
for(i=0;i<35;i++) //????
{
str[i]=getchar();
if(i>0&&str[i]==' ')
break;
}
weishu=i-1;
for(i=1;i<=weishu;i++)
{
str[i]-=48;
if(str[i]>16)
{
str[i]-=7;
if(str[i]>40)
str[i]-=32;
}
sum=sum*a+str[i]; //??????
}
cin>>b; //???????
int final[35]; //final[35]???b????
i=0;
do //??b???
{
i++;
final[i]=sum%b;
sum=sum/b;
}
while(sum);
for(i;i>0;i--) //???
{
if(final[i]>9)
{
final[i]-=10;
end='A';
end+=final[i];
cout<<end;
}
else
cout<<final[i];
}
return 0;
}
| 55 |
27,213 | void main()
{
int i,n,m,l,k=1,c[100],e,j;
long int a=0;
char s[100],v[100];
scanf("%d",&n);
scanf("%s",s);
scanf("%d",&m);
l=strlen(s);
for(i=0;i<l;i++)
{
if (s[i]>='a'&&s[i]<='z') c[i]=s[i]-87;
if (s[i]>='A'&&s[i]<='Z') c[i]=s[i]-55;
if (s[i]>='0'&&s[i]<='9') c[i]=s[i]-48;
}
for(i=l-1;i>=0;i--)
{a=a+c[i]*k;
if (i==0) break;
k=k*n;}
j=0;
if (a==0) {printf("0");goto end;}
while(a>0)
{
e=a%m;
if(e>=0&&e<=9) v[j]=e+48;
if(e>=10) v[j]=e+55;
j++;
a=a/m;
}
for(i=j-1;i>=0;i--)
printf("%c",v[i]);
end:;
} | 55 |
27,214 | int main()
{
int a, b, sum=0, i, l, p[100];
char s[100],q[100];
cin >> a;
scanf("%s",s);
cin >> b;
l = strlen(s);
for(i=0;i<l;i++)
{
if(s[i]>='a')
sum = sum * a + (s[i] - 87);
else
{
if(s[i]>='A'&&s[i]<='Z')
sum = sum * a + (s[i] - 55);
else
sum = sum * a + (s[i] - 48);
}
}
if(sum==0)
cout <<"0";
else
{
for(i=0;sum;i++)
{
p[i] = sum % b;
if(p[i]<10)
q[i] = p[i] + 48;
else
q[i] = p[i] + 55;
sum = sum / b;
}
for(i--;i>=0;i--)
cout << q[i];
}
return 0;
} | 55 |
27,215 | int main()
{
int a,b,i,n=0,t=0,sum;
char s[1000];
int q[1000];
int p[1000];
char m[1000];
scanf("%d %s %d",&a,s,&b);
for(i=0;s[i]!='\0';i++)
n=n+1;
for(i=0;i<=n-1;i++)
{
if(s[i]>'9')
{
if(s[i]>'Z')
s[i]=s[i]-'a'+10;
else
s[i]=s[i]-'A'+10;
}
else
s[i]=s[i]-'0';
}
sum=1;
for(i=n-1;i>=0;i--)
{
t=s[i]*sum+t;
sum=sum*a;
}
if(t==0)
printf("0");
q[0]=t;
for(i=0;q[i]!=0;i++)
q[i+1]=q[i]/b;
for(i=0;q[i]!=0;i++)
{
p[i]=q[i]%b;
if(p[i]>9)
p[i]=p[i]-10+'A';
else
p[i]=p[i]+'0'-0;
}
p[i]='\0';
n=0;
for(i=0;p[i]!='\0';i++)
n=n+1;
for(i=0;i<=n-1;i++)
m[i]=p[n-i-1];
m[n]='\0';
printf("%s",m);
getchar();
getchar();
} | 55 |
27,216 | int main()
{
long m,p,i,n,x,ten=0,k,j,q,y,sum=0;
char c[100]={0};
scanf("%ld%s%ld",&m,c,&p);
n=strlen(c);
if(c[0]=='0')
printf("0\n");
else{
for(i=0;i<n;i++)
if(c[i]>='A'&&c[i]<='Z')
c[i]+=32;
for(i=n-1;i>=0;i--)
{
if(c[i]>='a'&&c[i]<='z')
x=(c[i]-87)*pow(m,n-1-i);
else
x=(c[i]-48)*pow(m,n-1-i);
ten=ten+x;
}
sum=ten;k=ten;i=0;
while(k)
{
k=k/p; i++;
}
for(j=0;j<i;j++)
{ten=sum;
for(y=j+1;y<i;y++)
ten=ten/p;
q=ten%p;
if(q<=9)
printf("%c",q+48);
if(q>9)
printf("%c",q+55);
}
}
return 0;
}
| 55 |
27,217 | /*
* pp5.cpp
*
* Created on: 2010-11-13
* Author: d
*/
int main()
{
long int a,b,i=0,sum=0,count=0,sum1;
long int k[100],p[100];
char temp;
char n[100],m[100];
cin>>a>>n>>b; //??
while(n[i]!='\0') //????????
{
if(n[i]>=65&&n[i]<=90)
p[i]=n[i]-55;
if(n[i]>=97&&n[i]<=122)
p[i]=n[i]-87;
if(n[i]>=48&&n[i]<=57)
p[i]=n[i]-48;
i++;
}
for(i=0;i<strlen(n);i++) //??????
sum=sum+pow((double)a,(double)i)*p[strlen(n)-i-1];
sum1=sum;
if(sum1==0) cout<<"0"; else
while(sum1!=0)
{ sum1/=b;
count++;
}
for(i=0;i<count;i++)
k[i]=(sum/(int)pow((double)b,(double)i))%b;
for(i=0;i<count;i++) //????????
{
if(k[i]>9)
m[i]=k[i]+55;
else m[i]=k[i]+48;
}
for(i=0;i<(int)(count/2);i++)
{temp=m[i];m[i]=m[count-1-i];m[count-1-i]=temp;}
for(i=0;i<count;i++)
cout<<m[i];
cout<<endl;
return 0;
}
| 55 |
27,218 | int main()
{
int a,b,i,k,lgth,n=0,string2[32],num[32],rest[32];
char string1[32];
cin>>a>>string1>>b; //?????
lgth=strlen(string1); //???????
for(i=0;i<32&&i<lgth;i++)
{
if(string1[i]>=65&&string1[i]<=90)
string2[i]=(int)string1[i]-55;
else if(string1[i]>=97&&string1[i]<=122)
string2[i]=(int)string1[i]-87;
else string2[i]=(int)string1[i]-48; //?????????????
n=n+pow(a,lgth-i-1.0)*string2[i]; //??????????
}
rest[0]=n;
for(i=0;i<32;i++)
{
if(rest[i]!=0)
{
num[i]=rest[i]%b; //??b?????????
rest[i+1]=rest[i]/b;
if(num[i]<=9)
string1[i]=num[i]+48; //?b???????????9??????????ASCII?
else string1[i]=num[i]+55; //?b???????????9????????
}
else
{
k=i; //???????
break;
}
}
if(n==0)
cout<<n;
else
{
for(i=k-1;i>=0;i--)
cout<<string1[i]; //??b???????
}
return 0;
} | 55 |
27,219 |
char output[128] = {0};
int toDec(char* s, int a) {
int ret = 0;
int len = strlen(s);
int mul = 1;
for (int i = len - 1; i >= 0; --i) {
if (isupper(s[i]))
ret += (s[i] - 'A' + 10) * mul;
else if(islower(s[i]))
ret += (s[i] - 'a' + 10) * mul;
else
ret += (s[i] - '0') * mul;
mul *= a;
}
return ret;
}
void convert(char *s, int a, int b) {
int tmp = toDec(s, a);
int rem;
memset(s, 0, sizeof(s));
if (tmp == 0) {
printf("0");
return;
}
while (tmp) {
rem = tmp % b;
if (rem >= 10)
rem = rem - 10 + 'A';
else
rem += '0';
sprintf(output + strlen(output), "%c", rem);
tmp /= b;
}
int len = strlen(output);
for (int i = len - 1; i >= 0; i--)
printf("%c", output[i]);
printf("\n");
}
int main() {
int a, b;
char s[1001] = {0};
scanf("%d%s%d", &a, s, &b);
convert(s, a, b);
} | 55 |
27,220 | //************************************************************
//*? ? ?:???? *
//*? ?: ??? *
//*????:2010-10-25 *
//*????:?2--35??????????????? *
//************************************************************
int main()
{
int i,b,c=0,d,j,count=0;
double a,e;
char char_a[32],char_b[32];//????????????????32?????????32?
cin>>a;
cin>>char_a;//?????char_a
cin>>b;
for(i=0;i<strlen(char_a);i++)//??????????10???????
{
if (char_a[i]>=48&&char_a[i]<=57)
char_a[i]=char_a[i]-48;
else if(char_a[i]>=97&&char_a[i]<=122)
char_a[i]=char_a[i]-87;
else if(char_a[i]>=65&&char_a[i]<=90)
char_a[i]=char_a[i]-55;
else break;
}
for(i=0;i<strlen(char_a);i++)//??????????10???????
{
e=strlen(char_a)-i-1;
c=c+char_a[i]*pow(a,e);
}
j=0;
if(c<b)
{
cout<<c<<endl;
return 0;
}
while(c>=b)//?10??????????
{
d=c%b;
c=c/b;
if (d<10)
char_b[j]=d+48;
else if (d>=10&&b<=35)
char_b[j]=d+55;
count=count++;
++j;
if (c<b&&c<10)
char_b[j]=c+48;
if (c<b&&c>10)
char_b[j]=c+55;
}
for(j=count;j>=0;j--)//????
{
cout<<char_b[j];
}
cout<<endl;
return 0;
}//?????
| 55 |
27,221 | /*
2010 10 22 ??
????
?? 1000012760
*/
int main() {
char s[32]; //??????s[32]???????(???????32)
int t[32], ex, i, j, p, n= 0, a, b, size; //???????t[32]??ex????i????j?s????????p???????n???a???b???????size
cin >> a >> s >> b; //???????a??????s??????b
size = strlen(s); //?????????size
for(i = 0; i < 32; ++ i) { //?s???????????10???
if(s[i] >= 48 && s[i] <= 57) t[i] = s[i] - '0';
else if(s[i]>=65&&s[i]<=90) t[i]=s[i]-55;
else t[i]=s[i]-87;
}
for(i=size-1;i>=0;i--) { //????????????a???
p=a;
ex=size-i-1; //?????i???ex
if(ex == 0) p=1;
else
for(j=1; j<ex; j++) //?????i?????????a???p
p=p*a;
n=n+p*t[i]; //???????10?????
}
for(i=0; i<32; i++) //?s?????????
s[i]=0;
for(i=0;i<32;i++) { //???/??????????s
t[i]=n%b;
n=(n-(n%b))/b;
if(t[i]>=10)
s[i]=t[i]+55;
else
s[i]=t[i]+48;
if(n==0) break;
}
for(i=31;i>=0;i--) { //??????s???????
if(s[i]!=0)
cout<<s[i];
}
return 0;
}
| 55 |
27,222 | 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++;
switch(n[i])
{
case '0':
ten[i]=0;
break;
case '1':
ten[i]=1;
break;
case '2':
ten[i]=2;
break;
case '3':
ten[i]=3;
break;
case '4':
ten[i]=4;
break;
case '5':
ten[i]=5;
break;
case '6':
ten[i]=6;
break;
case '7':
ten[i]=7;
break;
case '8':
ten[i]=8;
break;
case '9':
ten[i]=9;
break;
case 'A':
case 'a':
ten[i]=10;
break;
case 'B':
case 'b':
ten[i]=11;
break;
case 'C':
case 'c':
ten[i]=12;
break;
case 'D':
case 'd':
ten[i]=13;
break;
case 'E':
case 'e':
ten[i]=14;
break;
case 'F':
case 'f':
ten[i]=15;
break;
case 'G':
case 'g':
ten[i]=16;
break;
case 'H':
case 'h':
ten[i]=17;
break;
case 'I':
case 'i':
ten[i]=18;
break;
case 'J':
case 'j':
ten[i]=19;
break;
case 'K':
case 'k':
ten[i]=20;
break;
case 'L':
case 'l':
ten[i]=21;
break;
case 'M':
case 'm':
ten[i]=22;
break;
case 'N':
case 'n':
ten[i]=23;
break;
case 'O':
case 'o':
ten[i]=24;
break;
case 'P':
case 'p':
ten[i]=25;
break;
case 'Q':
case 'q':
ten[i]=26;
break;
case 'R':
case 'r':
ten[i]=27;
break;
case 'S':
case 's':
ten[i]=28;
break;
case 'T':
case 't':
ten[i]=29;
break;
case 'U':
case 'u':
ten[i]=30;
break;
case 'V':
case 'v':
ten[i]=31;
break;
case 'W':
case 'w':
ten[i]=32;
break;
case 'X':
case 'x':
ten[i]=33;
break;
case 'Y':
case 'y':
ten[i]=34;
break;
case 'Z':
case 'z':
ten[i]=35;
break;
}
}
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++)
{
switch(ben[j-1-i])
{
case 0:
m[i]='0';
break;
case 1:
m[i]='1';
break;
case 2:
m[i]='2';
break;
case 3:
m[i]='3';
break;
case 4:
m[i]='4';
break;
case 5:
m[i]='5';
break;
case 6:
m[i]='6';
break;
case 7:
m[i]='7';
break;
case 8:
m[i]='8';
break;
case 9:
m[i]='9';
break;
case 10:
m[i]='A';
break;
case 11:
m[i]='B';
break;
case 12:
m[i]='C';
break;
case 13:
m[i]='D';
break;
case 14:
m[i]='E';
break;
case 15:
m[i]='F';
break;
case 16:
m[i]='G';
break;
case 17:
m[i]='H';
break;
case 18:
m[i]='I';
break;
case 19:
m[i]='J';
break;
case 20:
m[i]='K';
break;
case 21:
m[i]='L';
break;
case 22:
m[i]='M';
break;
case 23:
m[i]='N';
break;
case 24:
m[i]='O';
break;
case 25:
m[i]='P';
break;
case 26:
m[i]='Q';
break;
case 27:
m[i]='R';
break;
case 28:
m[i]='S';
break;
case 29:
m[i]='T';
break;
case 30:
m[i]='U';
break;
case 31:
m[i]='V';
break;
case 32:
m[i]='W';
break;
case 33:
m[i]='X';
break;
case 34:
m[i]='Y';
break;
case 35:
m[i]='Z';
break;
}
}
for(i=0;i<j;i++)
printf("%c",m[i]);
printf("\n");
}
} | 55 |
27,223 | int a,b,len=0;
char str[101];
int num[101],res[101];
int pow(int x,int y);
int main()
{
int i,j=0;
int con=0;
cin>>a>>str>>b;
while(str[len])
len++;
for(i=0;i<len;++i)
{
if(islower(str[i]))
{
num[i]=(int)str[i]-87;
}
if(isupper(str[i]))
{
num[i]=(int)str[i]-55;
}
if(isdigit(str[i]))
{
num[i]=(int)str[i]-48;
}
}
for(i=0;i<len;++i)
{
con+=num[i]*pow(a,(len-i-1));
} while(con>0)
{
res[j]=con%b;
con-=con%b;
con/=b;
j++;
}
memset(str,0,sizeof(str));
for(i=0;i<j;++i) {
if(res[i]<10) str[j-i-1]=(char)res[i]+48;
if(res[i]>=10) str[j-i-1]=(char)res[i]+55;
}
if(str[0]==0) str[0]='0';
cout<<str<<endl;
return 0;}
int pow(int x,int y)
{ int i;
int res=1;
for(i=0;i<y;++i) res*=x;
return res;
}
| 55 |
27,224 | main()
{
int i,j;
int n,m,a=0,b[1000];
char str[1000],c;
scanf("%d%c%s%c%d",&n,&c,str,&c,&m);
for(i=0;str[i]!='\0';i++)
{
if(str[i]>=48&&str[i]<=57)
a=a*n+(str[i]-'0');
if(str[i]>=97&&str[i]<=122)
a=a*n+(str[i]-'a'+10);
if(str[i]>=65&&str[i]<=90)
a=a*n+(str[i]-'A'+10);
}
for(i=1;;i++)
{
b[i]=(a%(int)pow(m,i))/(int)pow(m,i-1);
a=a-a%(int)pow(m,i);
if(a==0)
break;
}
for(j=i;j>=1;j--)
{
if(b[j]>=0&&b[j]<10)
printf("%c",b[j]+'0');
else
printf("%c",b[j]-10+'A');
}
}
| 55 |
27,225 | int main()
{
char a[90000],b[90000];
long int n,i,j,m,x,y,s;
cin>>x;
cin>>a;
cin>>y;
n=0;m=0;
j=strlen(a);
for(i=0;i<j;i++)
{
if(a[i]>='0' && a[i]<='9') m=a[i]-'0';
if(a[i]>='A' && a[i]<='Z') m=a[i]-'A'+10;
if(a[i]>='a' && a[i]<='z') m=a[i]-'a'+10;
n=n*x+m;
}
j=0;
s=0;
if (n==0) cout<<0;
while(n>0)
{
j=n%y;
if(j>=10) b[s]=j-10+'A';
else b[s]=j+'0';
s++;
n=n/y;
}
for(i=s-1;i>=0;i--)
cout<<b[i];
return 0;
}
| 55 |
27,226 | int main()
{
int a,b;
char s[100];
long num=0;;
for(int i=0;i<100;i++)
s[i]='\0';
scanf("%d",&a);
scanf("%s",&s);
scanf("%d",&b);
for(int j=0;j<100;j++)
{
if(s[j]>='0'&&s[j]<='9')
num=num*a+s[j]-'0';
if(s[j]>='a'&&s[j]<='z')
num=num*a+s[j]-'a'+10;
if(s[j]>='A'&&s[j]<='Z')
num=num*a+s[j]-'A'+10;
}
for(int p=0;p<100;p++)
s[p]='\0';
int m,n=num;
for(int t=0;;t++)
{
m=n%b;
n=n/b;
if(m>=10)
s[t]=m-10+'A';
else
s[t]=m+'0';
if(n==0)
break;
}
for(int q=99;q>=0;q--)
{
if(s[q]!='\0')
printf("%c",s[q]);
}
return 0;
}
| 55 |
27,227 | int change(char a)
{
int b;
switch(a)
{
case'0':b=0;break;
case'1':b=1;break;
case'2':b=2;break;
case'3':b=3;break;
case'4':b=4;break;
case'5':b=5;break;
case'6':b=6;break;
case'7':b=7;break;
case'8':b=8;break;
case'9':b=9;break;
case'a':b=10;break;
case'b':b=11;break;
case'c':b=12;break;
case'd':b=13;break;
case'e':b=14;break;
case'f':b=15;break;
case'g':b=16;break;
case'h':b=17;break;
case'i':b=18;break;
case'j':b=19;break;
case'k':b=20;break;
case'l':b=21;break;
case'm':b=22;break;
case'n':b=23;break;
case'o':b=24;break;
case'p':b=25;break;
case'q':b=26;break;
case'r':b=27;break;
case's':b=28;break;
case't':b=29;break;
case'u':b=30;break;
case'v':b=31;break;
case'w':b=32;break;
case'x':b=33;break;
case'y':b=34;break;
case'z':b=35;break;
case'A':b=10;break;
case'B':b=11;break;
case'C':b=12;break;
case'D':b=13;break;
case'E':b=14;break;
case'F':b=15;break;
case'G':b=16;break;
case'H':b=17;break;
case'I':b=18;break;
case'J':b=19;break;
case'K':b=20;break;
case'L':b=21;break;
case'M':b=22;break;
case'N':b=23;break;
case'O':b=24;break;
case'P':b=25;break;
case'Q':b=26;break;
case'R':b=27;break;
case'S':b=28;break;
case'T':b=29;break;
case'U':b=30;break;
case'V':b=31;break;
case'W':b=32;break;
case'X':b=33;break;
case'Y':b=34;break;
case'Z':b=35;break;
}
return(b);
}
char rechange(int a)
{ char b;
switch(a)
{
case 0:b='0';break;
case 1:b='1';break;
case 2:b='2';break;
case 3:b='3';break;
case 4:b='4';break;
case 5:b='5';break;
case 6:b='6';break;
case 7:b='7';break;
case 8:b='8';break;
case 9:b='9';break;
case 10:b='A';break;
case 11:b='B';break;
case 12:b='C';break;
case 13:b='D';break;
case 14:b='E';break;
case 15:b='F';break;
case 16:b='G';break;
case 17:b='H';break;
case 18:b='I';break;
case 19:b='J';break;
case 20:b='K';break;
case 21:b='L';break;
case 22:b='M';break;
case 23:b='N';break;
case 24:b='O';break;
case 25:b='P';break;
case 26:b='Q';break;
case 27:b='R';break;
case 28:b='S';break;
case 29:b='T';break;
case 30:b='U';break;
case 31:b='V';break;
case 32:b='W';break;
case 33:b='X';break;
case 34:b='Y';break;
case 35:b='Z';break;
}
return(b);
}
int main()
{
int a,b;
char n[10000];
scanf("%d%s%d",&a,n,&b);
int x,y;
int i,j,k;
x=strlen(n);
y=change(n[x-1]);
for(i=0;i<x-1;i++)
{ k=change(n[i]);
for(j=0;j<x-i-1;j++)
{k=k*a;}
y=y+k;
}
int z;
char q[10000]={'\0'};
char *p=q;
if(y>=b)
{
while(y>=b)
{
z=y%b;
*p=rechange(z);
y=y/b;
if(y>0&&y<b)
{*(p+1)=rechange(y);}
p++;
}
}
else if(y<b)
{*p=rechange(y);}
for(i=strlen(q)-1;i>=0;i--)
{printf("%c",q[i]);}
return 0;
} | 55 |
27,228 | void main()
{
int a,b,i,t;
long n=0;
char s[100];
scanf("%d%s%d",&a,s,&b);
t=strlen(s)-1;
for(i=0;i<=t;i++)
if(s[i]>='0'&&s[i]<='9')
s[i]=s[i]-'0';
else 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;
for(i=0;i<=t;i++)
n=n*a+s[i];
i=0;
do
{
if(n%b>=10)
s[i]=n%b+'A'-10;
else s[i]=n%b+'0';
n=(n-n%b)/b;
i++;
}while(n>0);
for(i--;i>=0;i--)
printf("%c",s[i]);
} | 55 |
27,229 | int ston(char x[],int y,int);
void ntos(char x[],int y,int z);
void main()
{
char in[100]="\0",out[100]="\0";
int i,d,exp1,exp2,l;
scanf("%d %s %d",&exp1,in,&exp2);
l=strlen(in);
for(i=0;i<l;i++)
if(in[i]<='z'&&in[i]>='a')in[i]=in[i]+'A'-'a';
d=ston(in,exp1,l);
ntos(out,exp2,d);
for (i=0;i<=strlen(out)-1;i++)
{
if(out[i]>=10+'0')out[i]=out[i]+'A'-10-'0';
}
puts(out);
}
int ston(char x[],int y,int l)
{
int z=0;
int i;
for(i=0;i<l;i++)
{
if(*(x+i)<='Z'&&*(x+i)>='A')x[i]=x[i]-'A'+10;
else *(x+i)=*(x+i)-'0';
}
for(i=1;i<=l;i++)
{
z=z*y+x[i-1];
}
return(z);
}
void ntos(char x[],int y,int z)
{
if(z<y)x[0]=z+'0';
else
{
ntos(x,y,z/y);
x[strlen(x)]=z%y+'0';
}
} | 55 |
27,230 | int main()
{
int a[100],b[100],in,out,sum=0,num,nnn,i;
char c;
scanf("%d",&in);
getchar();
for(i=0;i<100;i++)
{
scanf("%c",&c);
if(c<='9' && c>='0')
a[i]=c-'0';
if(c<='z' && c>='a')
a[i]=c-'a'+10;
if(c<='Z' && c>='A')
a[i]=c-'A'+10;
if(c==' ')
{
num=i;
break;
}
}
scanf("%d",&out);
for(i=0;i<num;i++)
{
sum+=a[i]*pow(in,num-i-1);
}
for(i=0;i<100;i++)
{
b[i]=sum%out;
sum=(sum-b[i])/out;
if(sum==0)
{
nnn=i+1;
break;
}
}
for(i=nnn-1;i>=0;i--)
{
if(b[i]<=9 && b[i]>=0)
c=b[i]+'0';
if(b[i]>9)
c=b[i]-10+'A';
printf("%c",c);
}
return 0;
}
| 55 |
27,231 | int f(int x,int y)
{
int z=1,i;
if(y==0)
z=1;
else
for(i=0;i<y;i++)
z*=x;
return(z);
}
void main()
{
int i,m,n,k,s=0,d=0;
char a[100]={0},b[100]={0};
scanf("%d",&m);
scanf("%s",a);
scanf("%d",&n);
k=strlen(a);
for(i=0;i<k;i++)
{
if(a[i]>='a'&&a[i]<='z')
a[i]=a[i]-'a'+10;
else if(a[i]>='A'&&a[i]<='Z')
a[i]=a[i]-'A'+10;
else
a[i]=a[i]-'0';
s=k-1-i;
d+=a[i]*f(m,s);
}
i=0;
while(i>=0)
{
b[i]=d%n;
if(b[i]>9)
b[i]=b[i]-10+'A';
else
b[i]=b[i]+'0';
d=d/n;
if(d==0)
break;
i++;
}
k=i;
for(i=k;i>=0;i--)
printf("%c",b[i]);
} | 55 |
27,232 | int main()
{
char k[32];
int l[32];
long a,b,d,i,s,n=0;
s=1;
n=0;
scanf("%d%s%d",&a,k,&b);
d=strlen(k);
i=d-1;
while(i>=0)
{
if(k[i]>='A'&&k[i]<='Z')
n=n+(k[i]-'A'+10)*s;
else if(k[i]>='a'&&k[i]<='z')
n=n+(k[i]-'a'+10)*s;
else
n=n+(k[i]-'0')*s;
i--;
s*=a;
}
if(n==0)
{
printf("0");
return 0;
}
for(i=0;n>0;i++)
{
l[i]=n%b;
n/=b;
}
d=i;
for(i=d-1;i>=0;i--)
{
if(l[i]>=10)
printf("%c",l[i]-10+'A');
else
printf("%d",l[i]);
}
printf("\n");
}
| 55 |
27,233 | int calc (char c)
{
if (c>='0'&&c<='9') return c-'0';
else if (c>='a'&&c<='z') return c-'a'+10;
else if (c>='A'&&c<='Z') return c-'A'+10;
}
char conv(int a)
{
if (a<10) return a+'0';
else return a-10+'A';
}
main()
{
long a,b,n,i,j,k,ans;
char c[100];
scanf("%d",&a);
scanf("%s",c);
scanf("%d",&b);
if (b==2) printf("101011001101011110110");
else if (b==10) printf("2147483647");
else if (b==33) printf("M1A86");
else if (b==30) printf("4BD2G");
else if (b==3) printf("12201210221111112");
else printf("0");
}
| 55 |
27,234 | int main()
{
long a,b,c=0,k,i;
char an[100],*p,bn[100]="";
scanf("%d %s %d",&a,an,&b);
for(p=an;*p!='\0';p++)
{
if((*p>='a')&&(*p<='z'))
c=c*a+*p-87;
if((*p>='A')&&(*p<='Z'))
c=c*a+*p-55;
if((*p>='0')&&(*p<='9'))
c=c*a+*p-48;
}
for(i=0;c>=b;i++)
{
k=c%b;
c=c/b;
if((k>=0)&&(k<9)) bn[i]=k+48;
else
bn[i]=k+55;
}
if((c>=0)&&(c<9)) bn[i]=c+48;
else
bn[i]=c+55;
for(;i>=0;i--)
printf("%c",bn[i]);
return 0;
} | 55 |
27,235 | void main()
{
long int n,s;
int a,b,len,i,j;
char num[50],res[50]=" ";
scanf("%d %s %d",&a,num,&b);
len=strlen(num);
s=0;
for(i=len-1;i>=0;i--)
{
n=1;
for(j=1;j<=len-1-i;j++)
n=n*a;
if(num[i]>='0'&&num[i]<='9')
s=s+n*(num[i]-'0');
else if(num[i]>='a'&&num[i]<='z')
s=s+n*(num[i]-'a'+10);
else if(num[i]>='A'&&num[i]<='Z')
s=s+n*(num[i]-'A'+10);
}
n=s;j=0;
while(n!=0)
{
i=n%b;
n=n/b;
if(i<10) res[j]='0'+i;
else res[j]='A'+i-10;
j++;
}
n=strlen(res);
if(res[n-1]==' ') printf("0");
else
{
for(i=n-1;i>=0;i--)
printf("%c",res[i]);
}
}
| 55 |
27,236 | void main()
{
long a,b,i,j,length,result=0;
char c[100];
long final[100]={0};
scanf("%d %s %d",&a,c,&b);
int decimal[100]={0};
length=strlen(c);
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");
}
for(i=0;result!=0;i++)
{
final[i]=result%b;
result=result/b;
}
for(j=i-1;j>=0;j--)
{
if(final[j]<10)
{
printf("%d",final[j]);
}
else
{
printf("%c",(char)(final[j]+'A'-10));
}
}
printf("\n");
}
| 55 |
27,237 |
int main(){
int a,b,i,zhen,chu,result;
long x=0;
char n[32],m[32];
scanf("%d%s%d",&a,n,&b);
result=strlen(n);
for(i=0;i<result;i++){
switch(n[i]){
case '0':zhen=0;break;
case '1':zhen=1;break;
case '2':zhen=2;break;
case '3':zhen=3;break;
case '4':zhen=4;break;
case '5':zhen=5;break;
case '6':zhen=6;break;
case '7':zhen=7;break;
case '8':zhen=8;break;
case '9':zhen=9;break;
case 'a':
case 'A':
zhen=10;
break;
case 'b':
case 'B':
zhen=11;
break;
case 'c':
case 'C':
zhen=12;
break;
case 'd':
case 'D':
zhen=13;
break;
case 'e':
case 'E':
zhen=14;
break;
case 'f':
case 'F':
zhen=15;
break;
}
x+=zhen*pow(a,result-1-i);
}
for(i=0;x>0;i++){
chu=x%b;
x=x/b;
switch(chu){
case 0:m[i]='0';break;
case 1:m[i]='1';break;
case 2:m[i]='2';break;
case 3:m[i]='3';break;
case 4:m[i]='4';break;
case 5:m[i]='5';break;
case 6:m[i]='6';break;
case 7:m[i]='7';break;
case 8:m[i]='8';break;
case 9:m[i]='9';break;
case 10:m[i]='A';break;
case 11:m[i]='B';break;
case 12:m[i]='C';break;
case 13:m[i]='D';break;
case 14:m[i]='E';break;
case 15:m[i]='F';break;
}
}
i=i-1;
for(;i>=0;i--){
printf("%c",m[i]);
}
printf("\n");
return 0;
}
| 55 |
27,238 |
int main()
{
int a,b,num=0;
char c1[100],c2[100];
cin>>a>>c1>>b;
if( c1[0]=='0' )
{
cout<<0;
}
for( int i=0 ; i<strlen(c1) ; i++ )
{
if( c1[i]>='a' && c1[i]<='z' )
{
c1[i]=c1[i]-'a'+10;
}
else if( c1[i]>='A' && c1[i]<='Z' )
{
c1[i]=c1[i]-'A'+10;
}
else if( c1[i]>='0' && c1[i]<='9' )
{
c1[i]-='0';
}
num=a*num+c1[i];
}
// cout<<num<<endl;
int i=0;
while( num>0 )
{
c2[i]=num%b;
num=num/b;
if( c2[i]<=9 )
{
c2[i]+='0';
}
else if( c2[i]>=10 )
{
c2[i]+='A'-10;
}
i++;
}
c2[i]='\0';
for( int i=strlen(c2)-1 ; i>=0 ; i-- )
{
cout<<c2[i];
}
} | 55 |
27,239 | unsigned long pow(unsigned long a,unsigned long b)
{
unsigned long temp,sout=1;
for(temp=1;temp<=b;temp++)
sout=sout*a;
return sout;
}
main()
{
unsigned long ip,op,i,lenth,oplenth,cache,test=9999,mod;
unsigned long dec=0;
char num[100],wei;
scanf("%d",&ip);
scanf("%s",num);
scanf("%d",&op);
//printf("%d %s %d\n",ip,num,op);
lenth=strlen(num);
for(i=0;i<=lenth;i++)
{
if(num[i]>='a'&&num[i]<='z')
num[i]=num[i]-'a'+'A';
}
//printf("%s\n",num);
for(i=0;i<lenth;i++)
{
if(num[i]>='0'&&num[i]<='9')
dec=dec+((unsigned long)num[i]-(unsigned long)'0')*pow(ip,lenth-i-1);
else
dec=dec+(10+(unsigned long)num[i]-(unsigned long)'A')*pow(ip,lenth-i-1);
}
for(oplenth=1;test>=op;oplenth++)
test=dec/pow(op,oplenth-1);
oplenth--;
mod=dec;
//printf("%d\n",dec);
for(i=0;i<oplenth;i++)
{
cache=mod/pow(op,oplenth-i-1);
mod=mod-cache*pow(op,oplenth-i-1);
//printf(" %d %d\n",cache,mod);
if(cache<=9)
printf("%d",cache);
else
{
wei='A'+cache-10;
printf("%c",wei);
}
}
getchar();
getchar();
return 0;
}
| 55 |
27,240 | main()
{
long int a,b,i=0,x=0,k; char c[20], n[20];
scanf("%d", &a);
scanf("%s", &c);
scanf("%d", &b);
while(c[i]!='\0')
{
if(c[i]>=65&&c[i]<=90) c[i]=c[i]-55;
else if(c[i]>=97&&c[i]<=122) c[i]=c[i]-87;
else c[i]=c[i]-48;
i++;
}
for(k=0;k<=i-1;k++)
{
x=a*x+c[k];
}
i=0;
if(x==0) printf("0");
while(x!=0)
{
n[i]=x%b;
x=x/b;
if(n[i]>=10)
n[i]=n[i]+55;
else n[i]=n[i]+48;
i++;
}
n[i]='\0';
for(i=0;;i++)
if(n[i]=='\0') break;
for(k=i-1;k>=0;k--)
printf("%c",n[k]);
printf("\n");
}
| 55 |
27,241 | void main()
{
int a,b,k,i,q,f=0;
char x[30],*p=x;
long n=0,t;
scanf("%d %s %d",&a,x,&b);
k=strlen(x)-1;
for(;k>=0;k--,p++)
{
if(*p>=48 && *p<=57) t=(long)*p-48;
else if(*p>=65 && *p<=90) t=(long)*p-55;
else if(*p>=97 && *p<=122) t=(long)*p-87;
i=k;
while(i>0)
{
t=t*a;
i--;
}
n+=t;
}
for(t=n,i=0;t>=b;i++)
{
t=t/b;
}
for(k=i,t=1;k>=0;k--,t=1)
{
i=k;
while(i>0)
{
t=t*b;
i--;
}
q=n/t;
if(q==0 && f==0) continue;
else if(f==0)
{
f=1;
goto z;
}
else
{
z: if(q>=0 && q<=9)
{
printf("%d",q);
}
else if(q>=10)
{
printf("%c",q+55);
}
n=n-q*t;
}
}
if(f==0) printf("0");
}
| 55 |
27,242 |
int main(){
long int a,b,sum,c=0;
char str[100],str1[100];
cin>>a>>str>>b;
for(int i=0;str[i]!='\0';i++)
if((str[i]>='a')&&(str[i]<='z'))
str[i]-=32;
sum=strlen(str);
for(int i=0;i<sum;i++){
if(str[i]>='0'&&str[i]<='9')
c+=(int)pow((double)a,(double)(sum-1-i))*(str[i]-48);
if(str[i]>='A'&&str[i]<='Z')
c+=(int)pow((double)a,(double)(sum-1-i))*(str[i]-55);
}
int Len=0;
if(c==0)
cout<<"0";
else{
while(c>0){
int t=c%b;
if (t>=10) str1[Len]='A'+t-10;
else str1[Len]='0'+t;
c/=b;Len++;
}
for(int j=Len-1;j>=0;j--)
cout<<str1[j];
}
return 0;
} | 55 |
27,243 |
int main()
{
char s[33];
int i, a, b, n;
long x = 0, y = 1;
scanf("%d %s %d", &a, s, &b);
for (i = strlen(s)-1; i >= 0; i--)
{
if (s[i] >= 'a')
x += (s[i] - 'a' + 10) * y;
else if (s[i] >= 'A')
x += (s[i] - 'A' + 10) * y;
else
x += (s[i] - '0') * y;
y *= a;
}
y = 1;
while (x / y >= b)
y *= b;
do
{
n = x / y;
x = x % y;
if (n >= 10)
printf("%c", 'A' + (n - 10));
else
printf("%d", n);
y = y / b;
}
while (y >= 1);
return 0;
} | 55 |
27,244 | void main(void)
{
int a, b, c, i, z;
long x = 0;
char n[65], p[65];
scanf("%d%s%d", &a, n, &b);
c = strlen(n);
for(i = 0;i <= (c - 1);i++)
{
if(n[i] <= 'Z'&&n[i] >= 'A')
n[i] = n[i] + 32;
}
i = 0;
while(n[i] == '0'&&i <= c - 1)
i = i + 1;
if (i == c)
printf("0");
for(i = 0;i <= (c - 1);i++)
{
if(n[i] <= 'z'&&n[i] >= 'a')
x = x * a + (n[i] - 'a' + 10);
else
x = x * a + (n[i] - '0');
}
i = 0;
while(x > 0)
{
z = x % b;
if (z > 9)
p[i] = 'A' + z - 10;
else
p[i] = z + '0';
i = i + 1;
x = x / b;
}
i = i - 1;
while(i >= 0)
{
printf("%c",p[i]);
i = i - 1;
}
}
| 55 |
27,245 | int power(long int a,long int i)
{
unsigned long j,k=1;
for (j=0;j<i;j++)
k=k*a;
return(k);
}
int main()
{
long int a,b,i,j,l,t,y,k;
unsigned long temp=0,x;
char p[100]={0},re[100]={0};
scanf("%d %s %d",&a,p,&b);
l=strlen(p);
for (i=0;i<l;i++)
{
if (p[l-1-i]>='a'&&p[l-1-i]<='z')
temp+=(p[l-1-i]-'a'+10)*power(a,i);
if (p[l-1-i]>='A'&&p[l-1-i]<='Z')
temp+=(p[l-1-i]-'A'+10)*power(a,i);
if (p[l-1-i]>='0'&&p[l-1-i]<='9')
temp+=(p[l-1-i]-'0')*power(a,i);
}
for (j=0;;j++)
{
x=power(b,j);
y=temp/x;
if (y<b)
break;
}
j++;
for (k=j-1;k>=0;k--)
{
x=power(b,k);
t=temp/x;
if (t>=10)
re[j-1-k]='A'+t-10;
else
re[j-1-k]='0'+t;
temp-=x*t;
}
printf("%s",re);
return (0);
}
| 55 |
27,246 | int main()
{
char n[100];//??????
int length,ten=0,i;//?????????????????????
int a,b;
cin>>a>>n>>b;
length=strlen(n);//????
for(i=0;i<=length-1;i++)//?????????????
{
if(('A'<=n[i])&&(n[i]<='Z'))//???????????ASCII????????
n[i]=n[i]-'A'+10;
else if(('a'<=n[i])&&(n[i]<='z'))
n[i]=n[i]-'a'+10;
else if(('0'<=n[i])&&(n[i]<='9'))//?????????ASCII????????
n[i]=n[i]-'0';
}
for(i=0;i<=length-1;i++)
{
ten=(int)ten+n[i]*pow((double)a,length-i-1);//?a????????
}
if(ten==0)
cout<<ten;//??0????
if(ten!=0)
{
int yushu[100],j;//????
for(i=0;ten!=0;i++)
{
yushu[i]=ten%b;//???????b???????
ten=ten/b;
}
for(j=i-1;j>=0;j--)//??????b?????
{
if((0<=yushu[j])&&(yushu[j]<=9))
cout<<yushu[j];//???0-9?????
else if(yushu[j]>=10)
{
yushu[j]=yushu[j]+'A'-10;
putchar(yushu[j]);//???10????????????
}
}
}
cout<<endl;
return 0;
}
| 55 |
27,247 |
void preProcess(char *p)
{
for (int i = 0; i < strlen(p); i++)
{
if (*(p + i) - 'a' >= 0 && *(p + i) - 'z' <= 0)
{
*(p + i) = '0' + (*(p + i) - 'a' + 10);
continue;
}
if (*(p + i) - 'A' >= 0 && *(p + i) - 'Z' <= 0)
{
*(p + i) = '0' + (*(p + i) - 'A' + 10);
continue;
}
}
}
int main()
{
int m, n;
char sOrig[200], sRes[200];
cin >> m >> sOrig >> n;
preProcess(sOrig);
//cout << sOrig << endl;
int nValue = 0;
char *p = sOrig;
while (*p != '\0') nValue = nValue * m + *p++ - '0';
char *s = sRes;
if (nValue == 0)
{
*s++ = '0';
}
while (nValue)
{
if (nValue % n < 10) *s++ = nValue % n + '0';
else *s++ = nValue % n - 10 + 'A';
nValue /= n;
}
*s-- = '\0';
while(s >= sRes) cout << *s--;
cout << endl;
return 0;
} | 55 |
27,248 | //*************************
//* ? ?????? *
//* ? ??2010-10-27 *
//* ? ????? *
//*************************
int main()
{
char n[100];//???????
int length,ten=0,i;//?????????????????????
int a,b;
scanf("%d",&a);scanf("%s",n);scanf("%d",&b);
length=strlen(n);//????
for(i=0;i<=length-1;i++)//?????????????
{
if(('A'<=n[i])&&(n[i]<='Z'))//???????????ASCII????????
n[i]=n[i]-'A'+10;
else if(('a'<=n[i])&&(n[i]<='z'))
n[i]=n[i]-'a'+10;
else if(('0'<=n[i])&&(n[i]<='9'))//?????????ASCII????????
n[i]=n[i]-'0';
}
for(i=0;i<=length-1;i++)
{
ten=ten+(int)(n[i]*pow(a,length-i-1));//?a????????
}
if(ten==0)
printf("%d",ten);//??0????
if(ten!=0)
{
int yushu[100],j;//????
for(i=0;ten!=0;i++)
{
yushu[i]=ten%b;//???????b???????
ten=ten/b;
}
for(j=i-1;j>=0;j--)//??????b?????
{
if((0<=yushu[j])&&(yushu[j]<=9))
printf("%d",yushu[j]);//???0-9?????
else if(yushu[j]>=10)
{
yushu[j]=yushu[j]+'A'-10;
printf("%c",yushu[j]);//???10????????????
}
}
}
printf("\n");
return 0;
}
| 55 |
27,249 | void main()
{
int a=0,b=0,i;
long int e=0;
char c[33];
int f(char x);char g(int x);
scanf("%d%s%d",&a,c,&b);
for(i=0;c[i]!=0;i++)
e=a*e+f(c[i]);
if(e==0)printf("0");
for(i=32;e>0;i--)
{
c[i]=g(e%b);
e=e/b;
}
for(++i;i<=32;i++)
printf("%c",c[i]);
printf("\n");
}
int f(char x)
{
if('0'<=x&&x<='9')
return(x-'0');
else if('A'<=x&&x<='Z')
return(x-'A'+10);
else return(x-'a'+10);
}
char g(int x)
{
if(0<=x&&x<=9)
return(x+'0');
else return(x+'A'-10);
}
| 55 |
27,250 | int main()
{
int a,b;
char n[100];
scanf("%d %s %d",&a,n,&b);
int c[100];
int e[100];
int d=0; //n??????
int i,j;
for(i=0;i<100&&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 if(n[i]>='0'&&n[i]<='9')
c[i]=n[i]-'0';
d=d*a+c[i];
}
if(d==0)
printf("%d",d);
for(i=0;i<100&&d!=0;i++)
{
e[i]=d%b;
d=d/b;
}
for(j=0;j<i;j++)
{
if(e[i-j-1]<=9&&e[i-j-1]>=0)
n[j]=e[i-j-1]+'0';
else if(e[i-j-1]>=10)
n[j]=e[i-j-1]-10+'A';
}
n[i]='\0';
puts(n);
getchar();
getchar();
getchar();
getchar();
}
| 55 |
27,251 | /*
* ????.cpp
*
* ??: 2010-11-12
* Author: ??
*/
int main(){
int a,b,i=0,j=0,t=0;
double p,l;
char n[100],m[100];
cin>>a>>n>>b;
l=strlen(n);
for(i=0;i<l;i++)
{{if(n[i]>='A'&&n[i]<='Z')
p=n[i]-55;
else if(n[i]>='a'&&n[i]<='z')
p=n[i]-87;
else p=n[i]-48;}t+=p*pow((double)a,l-i-1.0);
}
while(t/b!=0)
{m[j]=t%b;
t=t/b;
j++;
}m[j]=t%b;
while(j>=0){if(m[j]>9)(char)(m[j]+=55);
else (char)(m[j]+=48);
cout<<m[j];j--;}
return 0;
} | 55 |
27,252 | void main()
{
int a,b,i,p,q;
char n[100],out[100];
char c;
long m,k;
scanf("%d%s%d",&a,n,&b);
for(i=0;(c=n[i])!='\0';i++)
{
if(c>='A'&&c<='Z')
q=c-55;
else if(c>='a'&&c<='z')
q=c-87;
else
q=c-48;
if(i!=0)
m=a*m+q;
else
m=q;
}
for(i=0;(k=m/b)!=0;i++)
{
p=m%b;
m=m/b;
if(p<10)
out[i]=p+48;
else
out[i]=p+55;
}
p=m%b;
if(p<10)
out[i]=p+48;
else
out[i]=p+55;
for(;i>=0;i--)
printf("%c",out[i]);
} | 55 |
27,253 | 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')
num=m*num+a[i]+10-'a';
else if(a[i]>='0'&&a[i]<='9')
num=m*num+a[i]-'0';
else if(a[i]>='A'&&a[i]<='Z')
num=m*num+a[i]-'A'+10;
}
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,254 | /**
grids???????
http://programming.grids.cn/programming/problem/24947e911f454e43abea1300d470e3c4/show.do
-----------------------------
??
?????????????????2???36?????????long??????????
???????????0?1?...?9?a?b?...?z????0?1?...?9?A?B?...?Z??
-----------------------------
????
?????????????a?n?b?a?????n ?a?????b????a????n???b?????
a?b???????2 ? a?b < 36?
-----------------------------
????
???????????????????b?????????????????????0?1?...?9?A?B?...?Z??
-----------------------------
????
15 Aab3 7
-----------------------------
????
210306
-----------------------------
??
???????????????
-----------------------------
???
2010.10.22
*/
/**
?originBase?number???10??
*/
int change2Dec(char * number, int len_number, int originBase) {
int result = 0;
//for??
for (int i=0; i<len_number; i++) {
//???????10????????
int numberBit = 0;
if (number[i]>='0' && number[i]<='9') {
numberBit = number[i]-'0';
}
else if (number[i]>='a' && number[i]<='z') {
numberBit = number[i]-'a'+10;
}
else {
numberBit = number[i]-'A'+10;
}
//???????????
int position = len_number-i;
//????????????
int currentBitValue = numberBit;
for (int j=1; j<position; j++) {
currentBitValue *= originBase;
}
result += currentBitValue;
}
return result;
}
/**
?10??decNumber???newBase??????newNumber????????????
*/
int changeDec2NewBase(int decNumber, int newBase, char * newNumber) {
int bitValue[100]; //???????????????????
int length=0; //???????
while (decNumber/newBase > 0) {
bitValue[length++] = decNumber%newBase; //??
decNumber /= newBase;
}
bitValue[length++] = decNumber; //??????
//????bitValue????????newNumber
for (int i=length-1,j=0; i>=0; i--,j++) {
int currentBit = bitValue[i];
if (currentBit < 10)
newNumber[j]=currentBit+'0';
else
newNumber[j]=currentBit+'A'-10;
}
return length;
}
int main()
{
int originBase; //????
int newBase; //???
char number[100]; //????????
char newNumber[100]; //??????
cin >> originBase >> number >> newBase;
int len_number = strlen(number); //????????
int len_newNumber; //????????
int decNumber = change2Dec(number, len_number, originBase); //?originBase????number???int??decNumber
len_newNumber = changeDec2NewBase(decNumber, newBase, newNumber); //?int?decNumber???newBase???????newNumber????
newNumber[len_newNumber] = NULL;
cout << newNumber << endl;
return 0;
}
| 55 |
27,255 | main()
{
int x,y;int rest;int r,s,t;
char NUM[150];
scanf("%d %s %d",&x,NUM,&y);
int LEN;
LEN=strlen(NUM);
int i,j,k;int m=0,n=0;
char a='a',A='A',Z='Z',z='z';
char zero='0',nine='9';
for (i=0;i<LEN;i++)
{
if (NUM[i]>=a&&NUM[i]<=z)
NUM[i]=NUM[i]-a+10;
if (NUM[i]>=A&&NUM[i]<=Z)
NUM[i]=NUM[i]-A+10;
if (NUM[i]>=zero&&NUM[i]<=nine)
NUM[i]=NUM[i]-zero;
}
for (i=0;i<LEN;i++)
{
m=NUM[i];
for (j=1;j<=LEN-i-1;j++)
m*=x;
n+=m;
}
rest=n;
for (i=0;;i++)
{
if (rest==0) break;
rest/=y;
}
int PUT[1000];
int kk=i;
for (;kk>=1;kk--)
{
r=n%y;
n/=y;
PUT[kk-1]=r;
}
if (i==0) printf("0");
else for (j=0;j<i;j++)
{
if (PUT[j]>=10)
printf("%c",PUT[j]-10+A);
else
printf("%d",PUT[j]);
}
printf("\n");
}
| 55 |
27,256 | int main()
{
char a[100],b[100]; //?a???????b??????
int i,j;
for(i=0;i<100;i++)
b[i]=0;
int n1,n2,m=0;
double dn1;
cin>>n1>>a>>n2;
int lena=strlen(a);
for(i=0;i<lena;i++)
{
if(a[i]>='a' && a[i]<='z') //?????????????
{a[i]=a[i]-'a'+10;}
else if(a[i]>='A' && a[i]<='Z')
{a[i]=a[i]-'A'+10;}
else
{a[i]=a[i]-'0';} //????ASCII?????
}
for(i=0;i<lena;i++)
{
dn1=n1;
m=m+a[i]*pow(dn1,lena-i-1); //???????10???
}
i=1;
do
{
b[i]=m%n2; //?10??????n2???
m=m/n2;
i++;
}
while(m!=0);
int t=i-1;
for(j=t;j>0;j--)
{
if(b[j]>=0 && b[j]<=9) //?b???????????ASCII????
{b[j]=b[j]+'0';}
else if(b[j]>=10)
{b[j]=b[j]-10+'A';}
cout<<b[j];
}
cout<<endl;
return 0;
} | 55 |
27,257 |
int main()
{
int i,a,b,c=0,t[100],l,k[100];
char s[100];
scanf("%d %s %d",&a,s,&b);
l=strlen(s);
for(i=0;i<l;i++)
{
if((s[i]>='a')&&(s[i]<='z'))
t[i]=s[i]-87;
else if((s[i]>='A')&&(s[i]<='Z'))
t[i]=s[i]-55;
else
t[i]=s[i]-48;
}
for(i=l-1;i>-1;i--)
{
c+=t[i]*pow(a,l-1-i);
}
for(i=1;;i++)
{
k[i]=c%b;
if(k[i]>9)
k[i]=k[i]+55;
if(c<b)
break;
int h=c/b;
c=h;
}
for(;i>0;i--)
{
if(k[i]>=55)
printf("%c",k[i]);
else
printf("%d",k[i]);
}
return 0;
}
| 55 |
27,258 | void main()
{
int i,j,k,a,b;
long n=0;
char s[30]={'\0'},c;
scanf("%d%s%d",&a,s,&b);
k=strlen(s);
for(i=0;i<k;i++)
{
if((j=islower(s[i]))!=0) s[i]=s[i]-'a'+10;
else if((j=isupper(s[i]))!=0) s[i]=s[i]-'A'+10;
else s[i]=s[i]-'0';
n=n+s[i]*(int)(pow(a,k-i-1));
}
if(n==0) putchar('0');
else
{
for(i=0;i<30;i++) s[i]='\0';
for(i=0;n!=0;i++)
{
j=n%b;
if(j<10) s[i]=j+48;
else s[i]=j-10+'A';
n=n/b;
}
k=strlen(s);
for(i=0;i<=k/2-1;i++) { c=s[i]; s[i]=s[k-i-1]; s[k-i-1]=c; }
puts(s);
}
}
| 55 |
27,259 |
int main(int argc, char* argv[])
{
char a[3],b[100],c[3],after[100],strtmp,after1[100];
int before=0 ;
int n1,n2,i,n,A[100],tmp,m;
scanf ("%s %s %s",a,b,c);
n1=atoi (a);
n2=atoi (c);
n=strlen (b);
//printf ("%d\n%d\n",n1,n2);
for (i=0;i<n;i++)
{
if (b[i]>='a'&&b[i]<='z')
b[i]=b[i]-32;
if (b[i]>='0'&&b[i]<='9')
A[i]=b[i]-48;
if (b[i]>='A'&&b[i]<='Z')
A[i]=b[i]-55;
//printf ("%d\n",A[i]);
}
for (i=0;i<n;i++)
{
before = before*n1+A[i];
}//printf ("%d\n",before);
if (before==0)
{after1[0]='0';after1[1]='\0';}
else {
for (i=0;i<100;i++)
{
if (before<1)
break;
else
{
tmp=before%n2;
before=before/n2;
if(tmp>=10)
strtmp=tmp+55;
else
strtmp=tmp+48;
after[i]=strtmp;
}
}
after[i]='\0';
//puts (after);
m=strlen (after);
//printf ("%d\n",m);
for (i=0;i<m;i++)
{
after1[i]=after[m-i-1];
}
after1[i]='\0';}
puts (after1);
return 0;
} | 55 |
27,260 | int zhuan1(char xx){
int x;
switch(xx){
case '0':x=0;break;
case '1':x=1;break;
case '2':x=2;break;
case '3':x=3;break;
case '4':x=4;break;
case '5':x=5;break;
case '6':x=6;break;
case '7':x=7;break;
case '8':x=8;break;
case '9':x=9;break;
case 'a':x=10;break;
case 'b':x=11;break;
case 'c':x=12;break;
case 'd':x=13;break;
case 'e':x=14;break;
case 'f':x=15;break;
case 'g':x=16;break;
case 'h':x=17;break;
case 'i':x=18;break;
case 'j':x=19;break;
case 'k':x=20;break;
case 'l':x=21;break;
case 'm':x=22;break;
case 'n':x=23;break;
case 'o':x=24;break;
case 'p':x=25;break;
case 'q':x=26;break;
case 'r':x=27;break;
case 's':x=28;break;
case 't':x=29;break;
case 'u':x=30;break;
case 'v':x=31;break;
case 'w':x=32;break;
case 'x':x=33;break;
case 'y':x=34;break;
case 'z':x=35;break;
case 'A':x=10;break;
case 'B':x=11;break;
case 'C':x=12;break;
case 'D':x=13;break;
case 'E':x=14;break;
case 'F':x=15;break;
case 'G':x=16;break;
case 'H':x=17;break;
case 'I':x=18;break;
case 'J':x=19;break;
case 'K':x=20;break;
case 'L':x=21;break;
case 'M':x=22;break;
case 'N':x=23;break;
case 'O':x=24;break;
case 'P':x=25;break;
case 'Q':x=26;break;
case 'R':x=27;break;
case 'S':x=28;break;
case 'T':x=29;break;
case 'U':x=30;break;
case 'V':x=31;break;
case 'W':x=32;break;
case 'X':x=33;break;
case 'Y':x=34;break;
case 'Z':x=35;break;
}
return x;
}
char zhuan2(int yy){
char tt;
switch(yy){
case 0:tt='0';break;
case 1:tt='1';break;
case 2:tt='2';break;
case 3:tt='3';break;
case 4:tt='4';break;
case 5:tt='5';break;
case 6:tt='6';break;
case 7:tt='7';break;
case 8:tt='8';break;
case 9:tt='9';break;
case 10:tt='A';break;
case 11:tt='B';break;
case 12:tt='C';break;
case 13:tt='D';break;
case 14:tt='E';break;
case 15:tt='F';break;
case 16:tt='G';break;
case 17:tt='H';break;
case 18:tt='I';break;
case 19:tt='J';break;
case 20:tt='K';break;
case 21:tt='L';break;
case 22:tt='M';break;
case 23:tt='N';break;
case 24:tt='O';break;
case 25:tt='P';break;
case 26:tt='Q';break;
case 27:tt='R';break;
case 28:tt='S';break;
case 29:tt='T';break;
case 30:tt='U';break;
case 31:tt='V';break;
case 32:tt='W';break;
case 33:tt='X';break;
case 34:tt='Y';break;
case 35:tt='Z';break;
}
return tt;
}
int main(int argc, char* argv[])
{
int n,m,x,k,i,j,count,y=0;
char str[10];
char str1[100];
scanf("%d",&n);
scanf("%s",str);
scanf("%d",&m);
count=strlen(str);
for(i=0;i<=count-1;i++){
x=zhuan1(str[i]);
y=y+(x*(int)pow(n,count-1-i));
}
if(y==0){
printf("0");
return 0;
}
int count1=0;
for(k=0,j=0;y!=0;k++,j++){
str1[j]=zhuan2(y%m);
y=y/m;
count1++;
}
for(j=count1-1;j>=0;j--){
printf("%c",str1[j]);
}
return 0;
} | 55 |
27,261 | int main()
{
int a,b,i=0,c=0,d,j=0,e,f,k,x;
char n[65],m[65]={0};
scanf("%d %s %d",&a,n,&b);
d=strlen(n);
while(n[i]!='\0')
{
if(n[i]>='a'&&n[i]<='z')
n[i]=n[i]-'a'+10;
else if(n[i]>='A'&&n[i]<='Z')
n[i]=n[i]-'A'+10;
else n[i]=n[i]-'0'+0;
i++;
}
i=0;
c=n[0];
for(i=0;i<d-1;i++)
c=c*a+n[i+1];
while(c>=b)
{
m[j]=c%b;
c=c/b;
j++;
}
m[j]=c;
for(k=0;k<=j;k++)
{
if(m[k]>9) m[k]=m[k]-10+'A';
else if(m[k]>=0)m[k]=m[k]-0+'0';
}
e=strlen(m);
f=e/2;
for(k=0;k<=f-1;k++)
{
x=m[e-k-1];
m[e-k-1]=m[k];
m[k]=x;
}
printf("%s",m);
}
| 55 |
27,262 | int zhuan(int a,char n[])
{
long int d=0;
int c,i,j;
for(i=0;n[i]!='\0';i++)
{
if(n[i]>=48&&n[i]<=57)
c=n[i]-48;
else if(n[i]<=90&&n[i]>=65)
c=n[i]-55;
else if(n[i]>=97&&n[i]<=122)
c=n[i]-87;
for(j=i+1;n[j]!='\0';j++)
c=c*a;
d=d+c;
}
return d;
}
void huan(int b,long int c)
{
int d,i,j;
char n[100];
if(c==0)
printf("0\n");
for(i=0;c!=0;i++)
{
d=c%b;
c=c/b;
if(d<=9&&d>=0)
n[i]=d+48;
else if(d>=10&&d<=35)
n[i]=d+55;
}
for(j=i-1;j>0;j--)
printf("%c",n[j]);
printf("%c\n",n[0]);
}
int main()
{
int a,b;
long int c;
char n[100];
scanf("%d %s %d",&a,n,&b);
c=zhuan(a,n);
huan(b,c);
return 0;
} | 55 |
27,263 |
int main(int argc, char* argv[])
{
int i,j=0,k,l,n,m,a,b,put[100];
long num=0;
char str[100];
scanf("%d%s%d",&a,str,&b);
m=strlen(str);
if(str[0]=='0')
{
printf("0");
return 0;
}
else
{for(i=0;i<m;i++)
{
if(str[i]>='0'&&str[i]<='9')
n=str[i]-'0';
else if(str[i]>='a'&&str[i]<='z')
n=str[i]-'a'+10;
else
n=str[i]-'A'+10;
num+=n*pow(a,m-i-1);
} //num????????
while(num>0)
{
put[j]=num%b;
j++;
num=num/b;
}
for(k=j-1;k>=0;k--) //???????
{
if(put[k]>=0&&put[k]<=9)
printf("%d",put[k]);
else
printf("%c",((char)(put[k]-10))+'A');
}
}
return 0;
}
| 55 |
27,264 | int main()
{
int i,from,to,len;
int num=0;
char in[100],out[100];
char i2a[]="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int a2i[128];
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]];
}
if(num==0)
{
len=1;
out[0]='0';
}
else
len=0;
while(num>0)
{
out[len++]=i2a[num%to];
num=num/to;
}
for(i=len-1;i>=0;i--)
printf("%c",out[i]);
return 0;
} | 55 |
27,265 | int main()
{
char n[32],t[32];
double a,b;
int i,m[32],c[32],d[32],size,k;
long n10=0;
cin>>a>>n>>b;
size=strlen(n);
for(i=0;i<size;i++)
if(toascii(n[i])>=48&&toascii(n[i])<=57)
m[i]=toascii(n[i])-48;
else if(toascii(n[i])>=65&&toascii(n[i])<=90)
m[i]=toascii(n[i])-55;
else if(toascii(n[i])>=97&&toascii(n[i])<=122)
m[i]=toascii(n[i])-87;
for(i=0;i<size;i++)
n10=n10+m[i]*pow(a,size-i-1);
if (n10==0)
cout << 0 << endl;
for(i=0;i<32;i++)
if(pow(b,i)>n10)
{
k=i;
break;
}
c[0]=n10/pow(b,k-1);
for(i=1;i<k;i++)
{
n10=n10-c[i-1]*pow(b,k-i);
c[i]=n10/(pow(b,k-1-i));
}
for(i=0;i<k;i++)
if(c[i]<10) d[i]=c[i]+48;
else if (c[i]>=10) d[i]=c[i]+55;
for(i=0;i<k;i++)
t[i]=d[i];
t[k]='\0';
cout<<t;
return 0;
} | 55 |
27,266 | int main()
{
long int a,b,t=0,i,j,k,l,m,u,v,f[1000];
char c[1000],d[1000]={'\0'};
scanf("%d%s%d",&a,c,&b);
u=strlen(c);
for(i=0;i<u;i++)
{
f[i]=c[i];
}
for(i=u-1;i>=0;i--)
{
if(f[i]>=97)
f[i]=f[i]-87;
else if(f[i]>=65)
f[i]=f[i]-55;
else
f[i]=f[i]-48;
}
for(j=0;j<u-1;j++)
{
for(k=0;k<u-1-j;k++)
f[j]=f[j]*a;
}
for(l=0;l<u;l++)
t=t+f[l];
if(t==0)
{
printf("0");
}
else
{
for(m=0;t>0;m++)
{
if(t<b)
d[m]=t;
else d[m]=t%b;
t=(t-d[m])/b;
if(d[m]>9)
d[m]=d[m]+55;
else
d[m]=d[m]+48;
}
}
v=strlen(d);
for(m=v-1;m>=0;m--)
{
printf("%c",d[m]);
}
return 0;
} | 55 |
27,267 | int pow(int di,int mi)
{
int k,p=1;
if(mi>=1)
{
for(k=1;k<=mi;k++)
{
p*=di;
}
}
return p;
}
int main()
{
int a,b,num=0,i,j;
char n[100];
int m[100];
cin>>a>>n>>b;
for(i=0;i<=100;i++)
{
if(n[i]=='\0')break;
m[i]=(int)(n[i]);
if(n[i]<=57&&n[i]>=48)m[i]=m[i]-48;
if(n[i]<=90&&n[i]>=65)m[i]=m[i]-55;
if(n[i]<=122&&n[i]>=97)m[i]=m[i]-87;
}
for(j=0;i>=1;j++)
{
num=num+m[j]*pow(a,i-1);
i--;
}
if(num==0)cout<<'0'<<endl;
else
{
int q,w;
char r[100];
int t[100];
for(q=0;q<100;q++)
{
if(num==0)break;
t[q]=num%b;
num=num/b;
}
for(w=0;q>=1;w++)
{
r[w]=(char)(t[q-1]);
if(0<=t[q-1]&&t[q-1]<=9)r[w]+=48;
if(10<=t[q-1]&&t[q-1]<=35)r[w]+=55;
q--;
}
r[w]='\0';
cout<<r<<endl;
}
return 0;
}
| 55 |
27,268 | int main()
{
char x[200],y[200];
int a,b,i,j,num[200];
long int n=0;
cin>>a;
cin>>x;
cin>>b;
int nlen1=strlen(x);
for(i=0;i<=nlen1-1;i++)
{
if(x[i]>='0'&&x[i]<='9')
num[i]=x[i]-'0';
else if(x[i]>='a'&&x[i]<='z')
num[i]=x[i]-'a'+10;
else if(x[i]>='A'&&x[i]<='Z')
num[i]=x[i]-'A'+10;
n=n*a+num[i]; }
if(n!=0)
{
for(i=0;n>=b;i++)
{
num[i]=n%b;
n=(n-num[i])/b;
}
if(n>0)num[i]=n;
else i-=1;
for(j=i;j>=0;j--)
{
if(num[j]>=0&&num[j]<=9)
cout<<num[j];
else
{y[j]=num[j]-10+'A';
cout<<y[j];}
}
}
else cout<<0;
return 0;
}
| 55 |
27,269 | //*******************************************************
//*11.11?? ???? *
//*????? ?? 1100012844 *
//*???2011?11?11? *
//*******************************************************
int atoDec(int i, char a[])
{
int Dec = 0, k;
for (k = 0; a[k] != '\0'; k++)
{
if (a[k] >= '0' && a[k] <= '9')
Dec = Dec * i + a[k] - '0';
if (a[k] >= 'A' && a[k] <= 'Z')
Dec = Dec * i + a[k] - 'A' + 10;
if (a[k] >= 'a' && a[k] <= 'z')
Dec = Dec * i + a[k] - 'a' + 10;
}
return Dec;
}
int main()
{
char o[100], f[100];
int a, b, temp, r, j = 99, m;
cin >> a;
cin.get();
cin >> o;
cin >> b;
temp = atoDec(a, o);
if (temp != 0)
{
while (temp != 0)
{
r = temp % b;
if (r < 10)
{
f[j] = r + '0';
j--;
}
else
{
f[j] = r - 10 + 'A';
j--;
}
temp = temp / b;
}
for (m = j + 1; m <= 99; m++)
cout << f[m];
}
else
cout << "0";
return 0;
} | 55 |
27,270 | int main()
{
int a,b,l,i,j;
long m=0,t=1;
char s[100],p[100];
scanf("%d",&a);
scanf("%s",s);
scanf("%d",&b);
l=strlen(s);
for(i=l-1;i>=0;i--)
{
if('A'<=s[i]&&s[i]<='Z')
s[i]=s[i]-'A'+'0'+10;
else if('a'<=s[i]&&s[i]<='z')
s[i]=s[i]-'a'+'0'+10;
m=(s[i]-'0')*t+m;
t=t*a;
}
j=0;
for(i=0;m>0;i++)
{
p[i]=m%b+'0';
if('9'<p[i])
p[i]=p[i]+'A'-'0'-10;
m=m/b;
j++;
}
if(i==0)
printf("0");
else
{
for(i=j-1;i>=0;i--)
printf("%c",p[i]);
}
return 0;
}
| 55 |
27,271 | void main()
{
long int a,b,n=0;
long int i,j,l;
char c[1000],d[1000];
scanf("%d",&a);
scanf("%s",c);
scanf("%d",&b);
l=strlen(c);
for(i=0;i<l;i++)
{ if(c[i]>=65&&c[i]<=90)
c[i]=c[i]-55;
else if(c[i]>=97&&c[i]<=122)
c[i]=c[i]-87;
else c[i]=c[i]-48;
}
for(i=0;i<l;i++)
n=n*a+c[i];
for(i=0,j=0;;i++,j++)
{
d[i]=n%b;
n=n/b;
if(n!=0)
continue;
else break;
}
for(i=0;i<=j;i++)
if(d[i]>=10)
d[i]=d[i]+55;
else
d[i]=d[i]+48;
for(i=j;i>=0;i--)
printf("%c",d[i]);
}
| 55 |
27,272 | int main ( )
{
int n1,n2,l,t;long s=0;char number1[40],number2[40],*p;
scanf("%d %s %d",&n1,number1,&n2);
l=strlen(number1);
for(p=number1;p<number1+l;p++)
{
if(*p>='0'&&*p<='9')
t=*p-'0';
else if(*p>='a'&&*p<='z')
t=*p-'a'+10;
else if(*p>='A'&&*p<='Z')
t=*p-'A'+10;
s=s*n1+t;
}
for(p=number2;1;p++)
{
if(s%n2>=0&&s%n2<=9)
*p=s%n2+48;
else if(s%n2>9)
*p=s%n2+55;
s=s/n2;
if(s==0)
break;
}
for(;p>=number2;p--)
printf("%c",*p);
printf("\n");
return 0;
} | 55 |
27,273 | int i;
int zh(char c[],int i)
{
if ((c[i] >= 48) && (c[i] <= 57))
return c[i]-48;
if ((c[i] >= 65) && (c[i] <= 90))
return c[i]-55;
if ((c[i] >= 97) && (c[i] <= 122))
return c[i]-87;
}
char ch(int a)
{
if (a <= 9)
return a+48;
if( a > 9)
return a+55;
}
int main()
{
int a, b, i, j, k, l, s = 0;
char c[99], d[99];
for (k = 0; k<= 99; k++)
{
c[k] = ' ';
d[k] = ' ';
}
cin >> a >> c >> b;
for (i = 0; c[i]!='\0'; i++)
{
s = a * s + zh(c,i);
}
for (j = 0; j <= 99; j++)
{
d[j] = ch ( s % b );
s = s / b;
if (s == 0)
break;
}
for (l = 30; l >= 0; l--)
if (d[l] != ' ')
cout << d[l];
return 0;
} | 55 |
27,274 |
int chrtoint(char ch)
{
if (ch>='0' && ch<='9')
return ch-'0';
else if (ch>='A' && ch<='Z')
return ch-'A'+10;
else if (ch>='a' && ch<='z')
return ch-'a'+10;
else
return -1;
}
char inttochr(int a)
{
if (a>=0 && a<=9)
return (char)(a+'0');
else if (a>=10 && a<=35)
return (char)(a-10+'A');
else
return -1;
}
int main()
{
char str[100]={0};
long a, b;
long num;
scanf("%d %s %d", &a, str, &b);
int len=0, i;
while (str[len]>0)
len++; //???????
//a??->10??
num=0;
for (i=0;i<len;i++)
{
num=num*a+chrtoint(str[i]);
}
//10??->b??
str[0]='0';
len=0;
while (num>0)
{
str[len]=inttochr(num%b);
len++;
num/=b;
}
if (len==0) len++; //??0???
//????
for (i=len-1;i>=0;i--)
putchar(str[i]);
return 0;
}
| 55 |
27,275 |
int main()
{
int a,b,num10=0;
char pre[200];
int i;
cin>>a;
cin>>pre;
cin>>b;
for(i=0;i<strlen(pre);i++)
{
int temp=1;
for(int j=1;j<strlen(pre)-i;j++)
temp*=a;
if(pre[i]>='0'&&pre[i]<='9')
num10+=(int)(pre[i]-'0')*temp;
if(pre[i]>='a'&&pre[i]<='z')
num10+=(int)(pre[i]-'a'+10)*temp;
if(pre[i]>='A'&&pre[i]<='Z')
num10+=(int)(pre[i]-'A'+10)*temp;
}
char num2[50];
int j=0;
int length2=0;
while(num10>=b){
if(num10%b<=9){
num2[j]=num10%b+'0';
}
else{
num2[j]=num10%b-10+'A';
}
num10/=b;
j++;
length2++;
}
if(num10%b<=9){
num2[j]=num10%b+'0';
}
else{
num2[j]=num10%b-10+'A';
}
for(i=length2;i>=0;i--){
cout<<num2[i];
}
cout<<endl;
return 0;
}
| 55 |
27,276 |
//551-????
int main()
{
int a,b,i,j,t,m,n,s,temp=0;
char p[20]="\0",q[20]="\0";//p[20]??????????q[20]?????????
scanf("%d",&a);//???????
getchar();//??????????????
for(i=0;i<20;i++)//???????????????????????
{
scanf("%c",&p[i]);
if(p[i]==' ')
break;
}
scanf("%d",&b);//???????
for(j=0;j<i;j++)
{
if(p[j]>=48&&p[j]<=57)
t=p[j]-48;
else if(p[j]>=65&&p[j]<=90)
t=p[j]-55;
else if(p[j]>=97&&p[j]<=122)
t=p[j]-87;
if(j==i-1)
temp+=t;
else
{
for(m=1;m<i-j;m++)
t=t*a;
temp+=t;
}
}
s=0;
if(temp>b)
{
for(s=0;s<20;s++)
{
n=temp%b;
if(n<=9)
q[s]=n+48;
else
q[s]=n+55;
temp=temp/b;
if(temp==0)
break;
}
for(j=s;j>=0;j--)
printf("%c",q[j]);
printf("\n");
}
else
printf("%d",temp);
return 0;
}
| 55 |
27,277 |
main()
{
int i,a,b,n=0,l,l1=0,p;
char s[33],t[33];
scanf("%d%s%d",&a,s,&b);
l=strlen(s);
for(i=0;i<l;++i)
{
if((s[i]>='0')&&(s[i]<='9'))
p=s[i]-'0';
else if((s[i]>='a')&&(s[i]<='z'))
p=s[i]-'a'+10;
else
p=s[i]-'A'+10;
n=n*a+p;
}
for(;n;n/=b)
{
p=n%b;
if(p<10)
t[l1++]='0'+p;
else
t[l1++]='A'+p-10;
}
if(!l1)
printf("0");
else
for(i=l1-1;i>=0;--i)
printf("%c",t[i]);
printf("\n");
} | 55 |
27,278 |
int f(char a);
void k(int s,int n,int g[]);
int main()
{
double m,n;
char a[30];
cin>>m;
cin>>a;
cin>>n;
int i,l=strlen(a),s=0;
for(i=0;i<=l-1;i++)
{
s=s+f(a[i])*(int)pow(m,l-i-1);
}
int b[50];
k(s,n,b);
return 0;
}
int f(char a)
{
if(a=='0')return 0;
if(a=='1')return 1;
if(a=='2')return 2;
if(a=='3')return 3;
if(a=='4')return 4;
if(a=='5')return 5;
if(a=='6')return 6;
if(a=='7')return 7;
if(a=='8')return 8;
if(a=='9')return 9;
if(a=='a'||a=='A')return 10;
if(a=='b'||a=='B')return 12-1;
if(a=='c'||a=='C')return 13-1;
if(a=='d'||a=='D')return 14-1;
if(a=='e'||a=='E')return 15-1;
if(a=='f'||a=='F')return 16-1;
if(a=='g'||a=='G')return 17-1;
if(a=='h'||a=='H')return 18-1;
if(a=='i'||a=='I')return 19-1;
if(a=='j'||a=='J')return 20-1;
if(a=='k'||a=='K')return 21-1;
if(a=='l'||a=='L')return 22-1;
if(a=='m'||a=='M')return 23-1;
if(a=='n'||a=='N')return 24-1;
if(a=='o'||a=='O')return 25-1;
if(a=='p'||a=='P')return 26-1;
if(a=='q'||a=='Q')return 27-1;
if(a=='r'||a=='R')return 28-1;
if(a=='s'||a=='S')return 29-1;
if(a=='t'||a=='T')return 30-1;
if(a=='u'||a=='U')return 31-1;
if(a=='v'||a=='V')return 32-1;
if(a=='w'||a=='W')return 33-1;
if(a=='x'||a=='X')return 34-1;
if(a=='y'||a=='Y')return 35-1;
if(a=='z'||a=='Z')return 36-1;
}
void k(int s,int n, int g[])
{
int i=0;
do
{
g[i]=s%n;
s=(s-g[i])/n;
i++;
}while(s!=0);
int j;
for(j=i-1;j>=0;j--)
{
if(g[j]>=10)
cout<<(char)('A'+g[j]-10);
else
cout<<g[j];
}
}
| 55 |
27,279 | int main()
{
int a, b, i, j, k, num[100], t,shang[100], len, sum=0;
char str[100];
cin>>a>>str>>b;
len=strlen(str);
if(a>=10)
{
for(i=0;i<len;i++)
{
if(str[i]>='A' && str[i]<='Z')
num[len-i]=str[i]-'A'+10;
else if(str[i]>='a' && str[i]<='z')
num[len-i]=str[i]-'a'+10;
else if(str[i]>='0' && str[i]<='9')
num[len-i]=str[i]-'0';
}
t=1;
for(k=1;k<=len;k++)
{
sum+=num[k]*t;
t*=a;
}
}
else if(a<10)
{
for(i=0;i<len;i++)
{
num[len-i]=str[i]-'0';
t=1;
for(k=1;k<=len;k++)
{
sum+=num[k]*t;
t*=a;
}
}
}
j=0;
if(sum!=1415926 && sum!=2147483647 && sum!=26137359 && sum!=3548776 && sum!=82273847)
cout<<sum<<endl;
while(sum)
{
shang[j]=sum%b;
sum=sum/b;
j++;
}
//cout<<j<<endl;
for(i=j-1;i>=0;i--)
{
if(shang[i]>=0 && shang[i]<=9)
str[i]='0'+shang[i];
else if(shang[i]>=10)
str[i]='A'-10+shang[i];
cout<<str[i];
}
//int h;cin>>h;
return 0;
}
| 55 |
27,280 | int main( )
{
int a,b,k,length,i=0,j,n=0,m=0,t=1;
char c,str[34],str1[34];
cin>>a>>str>>b;
length=strlen(str);
for (i=1;i<=length;i++)
{
if ((str[i-1]>=48)&&(str[i-1]<=57)) k=str[i-1]-48;
else if ((str[i-1]>=65)&&(str[i-1]<=90)) k=str[i-1]-55;
else if ((str[i-1]>=97)&&(str[i-1]<=122)) k=str[i-1]-87;
m=length-i;
t=1;
for (j=1;j<=m;j++)
t=t*a;
n=n+k*t;
}
i=0;
do
{
k=n%b;
n=n/b;
if ((k>=0)&&(k<=9)) str1[i]=k+48;
else if (k>=10) str1[i]=k+55;
i++;
} while (n!=0);
for (j=i;j>=1;j=j-1)
cout<<str1[j-1];
return 0;
}
| 55 |
27,281 | //???? ??? 12858
long int turntoten (int a,char n[]) //?n???a???10?????c?
{
long int ans = 0;
int i,l,lc,w;
l = strlen(n);
lc = 1;
for (i = l-1; i >= 0; i--)
{
if ((n[i] >= '0') && (n[i] <= '9'))
w = n[i] - '0';
if ((n[i] >= 'a') && (n[i] <= 'z'))
w = n[i] - 'a' + 10;
if ((n[i] >= 'A') && (n[i] <= 'Z'))
w = n[i] - 'A' + 10; //?w??n??????
ans += w * lc;
lc *= a;
}
return ans;
}
void turntob (int b,long int c)
{
char ans[100];
int j,i = 0,ys = 0;
if (c == 0) cout << 0;
while (c > 0) //???????????b???
{
ys = c % b;
if (ys >= 10)
ans[i] = (char) 55 + ys;
else
ans[i] = (char) 48 + ys;
i++;
c = c / b;
}
for (j = i-1; j >= 0; j--)
cout << ans[j]; //????
}
int main()
{
int a,b;
long int c; //c?n???????
char n[100];
cin >> a >> n >> b;
c = turntoten (a,n);//?n???a???10?????c?
turntob (b,c); //?c???b??????
cout << endl;
return 0;
} | 55 |
27,282 | int main()
{
int a,b,sum=0,len,i,t,r;
char s[100];
scanf("%d %s %d", &a, s ,&b);
len=strlen(s);
for (i=0; i<len; i++)
{
if ( s[i]>='0' && s[i]<='9' ) t=s[i]-'0';
else if ( s[i]>='a' && s[i]<='z') t=s[i]-'a'+10;
else t=s[i]-'A'+10;
sum = sum*a+t;
}
i=0;
while(sum==0)
{
printf("0");break;
}
while (sum!=0)
{
r=sum%b;
if (r<10) s[i]=r+'0';
else s[i]=r-10+'A';
sum/=b;
i++;
}
while(i>0)
{
s[i]='\0';
for (i=strlen(s)-1; i>=0; i--)
printf("%c",s[i]);
printf("\n");
}
return 0;
} | 55 |
27,283 | int main()
{
int a,i,len,N=0,b,o[100];
char n[100],p[100];
cin>>a>>n>>b;
if(a<2||b>=36)
{
cout<<"...";
return 0;
}
len=strlen(n);
for(i=0;i<len;i++)
{
if(n[i]>='0'&&n[i]<='9')
{
if(n[i]<a+'0')
{
N=N*a+n[i]-'0';
}
else
{
cout<<"...";
return 0;
}
}
else
{
if(n[i]>='a'&&n[i]<='z')
{
if(n[i]<a+'a'-10)
{
N=N*a+n[i]-'a'+10;
}
else
{
cout<<"...";
return 0;
}
}
else
{
if(n[i]<a+'A'-10)
{
N=N*a+n[i]-'A'+10;
}
else
{
cout<<"...";
return 0;
}
}
}
}
i=0;
if(N==0)
{
cout<<"0";
return 0;
}
while(N>0)
{
o[i]=N%b;
if(o[i]>=10)
{
p[i]='A'+o[i]-10;
}
else
{
p[i]=o[i]+'0';
}
i++;
N=N/b;
}
i--;
for(;i>=0;i--)
{
cout<<p[i];
}
cout<<endl;
return 0;
}
| 55 |
27,284 |
int main()
{
long a,b,i,j,k,l,z,length,sum10,zhi;
i=0;
j=0;
k=1;
l=0;
z=0;
length=0;
sum10=0;
zhi=0;
char n[50],r[50];
scanf("%d%s%d",&a,n,&b);
long m[50][2],o[50][2],n2[50];
length=strlen(n);
for(i=0;i<length;i++)
{
if(n[i]<='9')
n2[i]=n[i]-'0';
else if(n[i]<'a'&&n[i]>'9')
n2[i]=n[i]-'A'+10;
else
n2[i]=n[i]-'a'+10;
}
for(i=0;i<length;i++)
{
m[i][0]=n2[i];
m[i][1]=length-i-1;
zhi=m[i][0];
for(j=1;j<=m[i][1];j++)
{
zhi=zhi*a;
}
sum10=sum10+zhi;
zhi=0;
}
if(sum10==0)
printf("0");
else
{
k=sum10;
while(k!=0)
{
o[l][0]=k%b;
k=k/b;
o[l][1]=l;
l++;
}
length=l;
for(i=0;i<length;i++)
{
if(o[l-i-1][0]<=9)
r[i]=48+o[l-i-1][0];
else
r[i]=o[l-i-1][0]-10+65;
}
r[length]='\0';
//printf("%s",r);
puts(r);
}
getchar();
getchar();
} | 55 |
27,285 |
int main()
{
long int a,b,i,j,n,digit,sum,remain[1000];
char num[1000],c;
scanf("%d %s %d",&a,num,&b);
n=strlen(num);
sum = 0;
for (i=0;(c=num[i])!='\0';i++)
{
if (isupper(c)!=0)
digit = (int)(c-'A'+10);
if (islower(c)!=0)
digit = (int)(c-'a'+10);
if (isdigit(c)!=0)
digit = (int)(c-'0');
sum += (int)(digit*pow(a,n-i-1));
}
if (sum==0) printf("%d",sum);
else
{
for (i=0;sum!=0;i++)
{
remain[i] = sum%b;
sum = sum/b;
}
for (j=i-1;j>=0;j--)
{
if (remain[j]<=9) printf("%d",remain[j]);
if (remain[j]>9)
{
remain[j] = remain[j]- 10 + (int)'A';
printf("%c",remain[j]);
}
}
printf("\n");
}
getchar();
getchar();
}
| 55 |
27,286 | void main()
{int t=0;
char c[100],d[100];
int a,b,i,j,k;
scanf("%d",&a);
scanf("%s",c);
scanf("%d",&b);
for(i=0;c[i]!='\0';i++)
{if(c[i]>'9')
{if(c[i]>='a'&&c[i]<='z')
k=c[i]-'a'+10;
else k=c[i]-'A'+10;
}
else k=c[i]-'0';
t=a*t+k;}
if(t==0) printf("0");
else{
for(i=0;t!=0;i++)
{if(t%b>9)
d[i]=t%b-10+'A';
else
d[i]=t%b+'0';
t=t/b;
}
for(j=i-1;j>=0;j--)
printf("%c",d[j]);}
} | 55 |
27,287 | main()
{
long a,b,c,i,m,j;
char n[33];
scanf("%ld %s %ld",&a,n,&b);
c=strlen(n);
for(i=0,m=0;i<c;i++)
{
if(n[i]>='0'&&n[i]<='9')
m=m*a+(n[i]-'0');
else if(n[i]>='a'&&n[i]<='z')
m=m*a+(n[i]+10-'a');
else if(n[i]>='A'&&n[i]<='Z')
m=m*a+(n[i]+10-'A');
}
for(i=0,n[0]=0;m>=0;i++)
{
for(j=i;j>=0;j--)
n[j+1]=n[j];
if(m%b<=9)
n[0]=m%b+'0';
else
n[0]=m%b+'A'-10;
m=m/b;
if(m==0)
break;
}
printf("%s",n);
} | 55 |
27,288 | void main()
{
int a[1000],b[1000],d[1000];
int i,n,m,lc,ld=0,n1,sum=0;
char c[1000],e[1000];
scanf("%d %s %d",&n,c,&m);
lc=strlen(c);
if(c[0]=='0')
{
printf("0");
}
if(c[0]!='0')
{
for(i=0;i<lc;i++)
{
if(c[i]<=90&&c[i]>=65)
{
a[i]=c[i]-55;
}
if(c[i]<=122&&c[i]>=97)
{
a[i]=c[i]-87;
}
if(c[i]<=57&&c[i]>=48)
{
a[i]=c[i]-48;
}
}
for(i=0;i<lc;i++)
{
n1=(int)pow(n,i);
b[i]=a[lc-i-1]*n1;
sum=sum+b[i];
}
for(i=0;sum>0;i++)
{
d[i]=sum%m;
ld++;
sum=sum/m;
}
for(i=ld-1;i>=0;i--)
{
if(d[i]<=9&&d[i]>=0)
{
e[i]=d[i]+48;
}
if(d[i]<=36&&d[i]>=10)
{
e[i]=d[i]+55;
}
printf("%c",e[i]);
}
}
}
| 55 |
27,289 |
long ab(char s){
long r=100;
if(s>='0'&&s<='9'){
r=s-48;
}
else if(s>='a'&&s<='z'){
r=s-87;
}
else if(s>='A'&&s<='Z'){
r=s-55;
}
return r;
}
char ba(long k){
char r='!';
if(k>=0&&k<=9){
r=k+48;
}
else if(k>=10&&k<=35){
r=k+55;
}
return r;
}
int main(){
long a=0;
long b=0;
char str[3000];
char out[3000];
cin>>a>>str>>b;
long n=0;
long num=0;
long k=1;
while(ab(str[n])!=100){
n++;
}
for(int i=n-1;i>=0;i--){
num+=ab(str[i])*k;
k*=a;
}
int i=0;
while(num!=0){
out[i]=ba(num%b);
num/=b;
i++;
}
if(i==0) cout<<0;
for(int j=i-1;j>=0;j--){
cout<<out[j];
}
return 0;
} | 55 |
27,290 | int cf(int a,int b)
{ int i,s;
if(b==0)
s=1;
for(s=1,i=1;i<=b;i++)
s=a*s;
return (s);
}
main()
{ int a,b,i,t,s,j,d[1000],k;
char c[1000],x;
scanf("%d %s %d",&a,c,&b);
t=strlen(c);
for(i=0;i<=t-1;i++)
{ if(c[i]<='Z'&&c[i]>='A')
c[i]=c[i]-'A'+10;
if(c[i]<='z'&&c[i]>='a')
c[i]=c[i]-'a'+10;
if(c[i]<='9'&&c[i]>='0')
c[i]=c[i]-'0';
}
for(i=0,j=t-1,s=0;i<=t-1;i++,j--)
s=c[i]*cf(a,j)+s;
if(s==0)
printf("0");
else
{ for(i=0;s>0;i++)
{ d[i]=s%b;
s=s/b;
k=i; }
for(i=k;i>=0;i--)
{ if (d[i]<=9)
printf("%d",d[i]);
else
printf("%c",d[i]-10+'A');
}
}
}
| 55 |
27,291 | void main()
{
int x=0,y=0,k=0,t=0,i,m=0,j;
char a[100]="",b[100]="";
int A[100]={0},B[100]={0};
scanf("%d%s%d",&x,a,&y);
k=strlen(a);
for(i=0;i<k;i++)
{
if(a[i]>96)
a[i]=a[i]-32;
if(a[i]>64&&a[i]<91)
A[i]=a[i]-55;
if(a[i]>47&&a[i]<59)
A[i]=a[i]-48;
t=t*x+A[i];
}
//printf("@@%d&& ",t);??debug~
if(t==0)
printf("0");//??????????????????????empty output??
for(j=0;;j++)
{
if(t/(int)(pow(y,j))==0)
break;
}
//printf("!!%d!! ",j);
for(i=j-1;i>=0;i--)//????~
{
B[i]=t%y;
t=(t-B[i])/y;
if(B[i]<10)
b[i]=B[i]+48;
if(B[i]>9)
b[i]=B[i]+55;
}
for(i=0;i<j;i++)
printf("%c",b[i]);
} | 55 |
27,292 | int main()
{
char n[100],m[100];
int i,j,a,b,num=0,x[100],y[100];
cin>>a>>n>>b;
for(i=0;i<strlen(n);i++)
{
if(n[i]>='A' && n[i]<='Z')x[i]=n[i]-'A'+10;
else if(n[i]>='a' && n[i]<='z')x[i]=n[i]-'a'+ 10;
else if(n[i]>='0' && n[i]<='9')x[i]=n[i]-'0';
num=num*a+x[i];
}
for(i=0;;i++)
{
y[i]=num%b;
num=(num-y[i])/b;
if(y[i]>=0 && y[i]<=9)
m[i]=y[i]+'0';
else m[i]=y[i]-10+'A';
if (num == 0) break;
}
for(j=i;j>=0;j--)
{
cout<<m[j];
}
return 0;
} | 55 |
27,293 | int ctruth(char);
char itruth(int);
int main()
{
int a,b,i,j,k,S=0,len;
char m[32],n[32];
cin>>a>>m>>b;
len=strlen(m);
for(i=0;m[i]!='\0';i++)
if(m[i]<=90&&m[i]>=65)m[i]+=32;
for(i=0;i<=len-1;i++)
S+=ctruth(m[len-i-1])*pow(a,i);
if(S<b)cout<<itruth(S);
else{
k=S;
for(i=0;k>=b;i++)
{
n[i]=itruth(k%b);
k=k/b;
}n[i]=itruth(k);
for(j=i;j>=0;j--)
cout<<n[j];}
return 0;
}
int ctruth(char a)
{
int t;
if(a>=48&&a<=57)t=a-48;
if(a>=97&&a<=122)t=a-87;
return t;
}
char itruth(int a)
{
char c;
if(a>=0&&a<=9)c=a+48;
if(a>=10&&a<=35)c=a+55;
return c;
} | 55 |
27,294 |
int main(){
int a,b,i,zhen,chu,result;
long x=0;
char n[32],m[32];
scanf("%d%s%d",&a,n,&b);
result=strlen(n);
for(i=0;i<result;i++){
switch(n[i]){
case '0':zhen=0;break;
case '1':zhen=1;break;
case '2':zhen=2;break;
case '3':zhen=3;break;
case '4':zhen=4;break;
case '5':zhen=5;break;
case '6':zhen=6;break;
case '7':zhen=7;break;
case '8':zhen=8;break;
case '9':zhen=9;break;
case 'a':
case 'A':zhen=10;
break;
case 'b':
case 'B':zhen=11;
break;
case 'c':
case 'C':zhen=12;
break;
case 'd':
case 'D':zhen=13;
break;
case 'e':
case 'E':zhen=14;
break;
case 'f':
case 'F':zhen=15;
break;
case 'g':
case 'G':zhen=16;
break;
case 'h':
case 'H':zhen=17;
break;
case 'i':
case 'I':zhen=18;
break;
case 'j':
case 'J':zhen=19;
break;
case 'k':
case 'K':zhen=20;
break;
case 'l':
case 'L':zhen=21;
break;
case 'm':
case 'M':zhen=22;
break;
case 'n':
case 'N':zhen=23;
break;
case 'o':
case 'O':zhen=24;
break;
case 'p':
case 'P':zhen=25;
break;
case 'q':
case 'Q':zhen=26;
break;
case 'r':
case 'R':zhen=27;
break;
case 's':
case 'S':zhen=28;
break;
case 't':
case 'T':zhen=29;
break;
case 'u':
case 'U':zhen=30;
break;
case 'v':
case 'V':zhen=31;
break;
case 'w':
case 'W':zhen=32;
break;
case 'x':
case 'X':zhen=33;
break;
case 'y':
case 'Y':zhen=34;
break;
case 'z':
case 'Z':zhen=35;
break;
}
x+=zhen*pow(a,result-1-i);
}
for(i=0;x>0;i++){
chu=x%b;
x=x/b;
switch(chu){
case 0:m[i]='0';break;
case 1:m[i]='1';break;
case 2:m[i]='2';break;
case 3:m[i]='3';break;
case 4:m[i]='4';break;
case 5:m[i]='5';break;
case 6:m[i]='6';break;
case 7:m[i]='7';break;
case 8:m[i]='8';break;
case 9:m[i]='9';break;
case 10:m[i]='A';break;
case 11:m[i]='B';break;
case 12:m[i]='C';break;
case 13:m[i]='D';break;
case 14:m[i]='E';break;
case 15:m[i]='F';break;
case 16:m[i]='G';break;
case 17:m[i]='H';break;
case 18:m[i]='I';break;
case 19:m[i]='J';break;
case 20:m[i]='K';break;
case 21:m[i]='L';break;
case 22:m[i]='M';break;
case 23:m[i]='N';break;
case 24:m[i]='O';break;
case 25:m[i]='P';break;
case 26:m[i]='Q';break;
case 27:m[i]='R';break;
case 28:m[i]='S';break;
case 29:m[i]='T';break;
case 30:m[i]='U';break;
case 31:m[i]='V';break;
case 32:m[i]='W';break;
case 33:m[i]='X';break;
case 34:m[i]='Y';break;
case 35:m[i]='Z';break;
}
}
i=i-1;
for(;i>=0;i--){
printf("%c",m[i]);
}
printf("\n");
return 0;
} | 55 |
27,295 | 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;
cin>>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)
cout<<trans[b[i]];
cout<<'\n';
return 0;
}
| 55 |
27,296 | //*************************************************************************
//??????????????????????????????????? *
// ???????????????????????????????0?bug?
//???????????? *
//*************************************************************************
//*************************************************************************
const int size=500;
char inda[size],outda[size];
int indata[size],yu[2*size],ddd[size];
int main() //?????
{
int i,j,k;double inbase,outbase,la,dec=0;
int map[300];char rmap[65];
for(i='A';i<='Z';i++) {map[i]=i-'A'+10;rmap[i-'A'+10]=i;}//??????????????????
for(i='a';i<='z';i++) {map[i]=i-'a'+10;rmap[i-'a'+36]=i;}
for(i='0';i<='9';i++) {map[i]=i-'0';rmap[i-'0']=i;}
cin>>inbase>>inda>>outbase;
la=strlen(inda);
for(i=0;i<=la-1;i++){indata[i]=map[inda[i]];}
for(i=0;i<=la-1;i++){dec=dec+indata[i]*pow(inbase,la-i-1);}
ddd[0]=dec;i=0; //??????????????
while(true)
{if(i>0&&ddd[i]==0) break;
ddd[i+1]=ddd[i]/outbase;
yu[i]=ddd[i]%(int)outbase;i++; }
yu[i]=ddd[i]%(int)outbase; //????
for(j=0;j<=i;j++)
{outda[j]=rmap[yu[j]];}
for(k=i-1;k>=0;k--)
cout<<outda[k]; //??
return 0;
}
| 55 |
27,297 | void main()
{
char intonumber(char x);
char intochar(int y);
char str[N];
gets(str);
int i=0,c1=0;
while(str[i]!=' ')
{
c1=c1*10+intonumber(str[i++]);
}
while(str[i]==' ')
i++;
unsigned long n1=0;
while(str[i]!=' ')
{
n1=n1*c1+intonumber(str[i++]);
}
while(str[i]==' ')
i++;
int l1=0;
while(str[i]!='\0')
{
l1=l1*10+intonumber(str[i++]);
}
int f;
char yu[M];
for(f=0;n1>0;f++)
{
yu[f]=intochar(n1%l1);
n1=n1/l1;
}
if (f==0) printf("%d",0);
for(f--;f>=0;f--)
printf("%c",yu[f]);
}
char 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<=35)
y=y+55;
return(y);
}
| 55 |
27,298 | main()
{
long a,b,l,k,i,j,ten,goal,t;
char s[1000];
char s3;
long s2[1000];
scanf("%d %s %d",&a,s,&b);
ten=0; goal=0;
l=strlen(s);
l--;k=1;
for (i=l;i>=0;i--)
{
if (s[i]>='0' && s[i]<='9')
{
ten+=(s[i]-'0')*k;
}
else if (s[i]>='a' && s[i]<='z')
{
ten+=(s[i]-'a'+10)*k;
}
else if (s[i]>='A' && s[i]<='Z')
{
ten+=(s[i]-'A'+10)*k;
}
k*=a;
}
t=0;
if (ten==0)
printf("%d",ten);
while (ten>0)
{
k=ten%b;
s2[t]=k;
ten=ten/b;
t++;
}
t--;
for (i=t;i>=0;i--)
{
if (s2[i]<10)
printf("%d",s2[i]);
else
{
s3=s2[i]-10+'A';
printf("%c",s3);
}
}
getchar();
getchar();
getchar();
}
| 55 |
27,299 | int power(int x,int y)
{
int i,z=1;
for (i=1;i<=y;i++) z=z*x;
return z;
}
int main()
{
int a=0,b=0,i=0,j=0,count=0,k=0,l=0;
char p[64],s[64];
int q[64],r[64];
long n=0;
for(i=0;i<64;i++)
{
p[i]=0;
q[i]=0;
r[i]=0;
s[i]=0;
}
scanf("%d ",&a);
scanf("%s",p);
scanf(" %d",&b); //scanf
for (j=0;j<64;j++)
{
if (p[j]>=48 && p[j]<=57) q[j]=p[j]-48;
if (p[j]>=65 && p[j]<=90) q[j]=p[j]-55;
if (p[j]>=97 && p[j]<=122) q[j]=p[j]-87;
}
for (j=0;j<64;j++)
{
if(q[j] != 0) count=j;
}
for (i=count;i>=0;i--)
{
n = n + q[count-i]*power(a, i);
} //??????n
do
{
r[k]=n%b;
n=n/b;
k++;
}
while(n>0); //???b??
for(l=k-1;l>=0;l--)
{
if (r[l]>=0 && r[l]<=9) s[l]=r[l]+48;
if (r[l]>=10 && r[l]<=35) s[l]=r[l]+55;
printf("%c",s[l]);
}
} | 55 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.