id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
27,100 |
int main(int argc, char* argv[])
{
int i,j=0,k,b,a,x[20],y[20],M;
long int N=0;
char s[20];
scanf ("%d %s %d",&a,&s,&b);
k=strlen(s);
for (i=0;i<k;i++)
{
if (s[i]>47&&s[i]<58)
x[i]=s[i]-48;
else if (s[i]>64&&s[i]<90)
x[i]=s[i]-55;
else if (s[i]>96&&s[i]<123)
x[i]=s[i]-87;
}
for (i=0;i<k;i++)
{
N=N+x[i]*pow(a,k-i-1);
}
M=N;
if (N==0)
printf ("0\n");
else
{
do {
N=N/b;
j++;
} while (N>=b);
for (i=0;i<=j;i++)
{
y[i]=M%b;
M=M/b;
if (y[i]<10)
y[i]=y[i]+48;
else if (y[i]>=10)
y[i]=y[i]+55;
}
for (i=j;i>=0;i--)
{
printf ("%c",y[i]);
}
}
return 0;
} | 55 |
27,101 | void main()
{
long int s=0;
int a,b,n,m,i=0,x[100],y[100];
char d[100],c[100];
scanf("%d %s %d",&a,d,&b);
n=strlen(d);
for(i=0;i<n;i++)
{
if(d[i]>='A'&&d[i]<='Z')
x[i]=d[i]-55;
else if(d[i]>='a'&&d[i]<='z')
x[i]=d[i]-87;
else if(d[i]>='0'&&d[i]<='9')
x[i]=d[i]-48;
}
for(i=0;i<n;i++)
s=s*a+x[i];
m=0;
while(s>=b)
{
y[m]=s%b;
s=s/b;
m++;
}
y[m]=s;
for(i=m;i>=0;i--)
{
if(y[i]<9)
c[i]=y[i]+48;
else
c[i]=y[i]+55;
printf("%c",c[i]);
}
} | 55 |
27,102 | int main()
{
int a=0,b=0,length=0;
long long dec = 0;
char origin[100],final[100]; //???char origin?a???~int temp?a???~dec?????~int answer?b???~char final?b???
int temp[100]={0},answer[100]={0};
cin>>a>>origin>>b;
length=strlen(origin);
for(int i=length-1;i>=0;i--) //char origin?a???~int temp?a???
{
if(origin[i]>='a'&&origin[i]<='z')
temp[i]=origin[i]-87;
else if(origin[i]>='A'&&origin[i]<='Z')
temp[i]=origin[i]-55;
else
temp[i]=origin[i]-48;
}
for(int i=length-1;i>=0;i--) //int temp?a???~dec?????
{
dec=dec+temp[i]*pow((double)a,(length-i-1));
}
//cout<<dec;
int j=0;
while((dec/b)!=0) //dec?????~int answer?b????????
{
answer[j]=dec%b;
dec=dec/b;
j++;
}
answer[j]=dec%b;
for(int k=j;k>=0;k--) //int answer?b???~char final?b??????????
{
if(answer[k]>=10&&answer[k]<=35)
{
final[k]=(char)(answer[k]+55);
cout<<final[k];
}
else
cout<<answer[k];
}
}
| 55 |
27,103 | int main()
{
char n_a[100],n_b[100]={'0'};
int a,b,i;
long n=0;
cin>>a;//???????
getchar();//???
cin.getline(n_a,100,' ');//??????????
cin>>b;//????????
for(i=0;n_a[i]!=0;i++)//?n_a???????
{
n*=a;//?????????????n?????????a?
if(n_a[i]<'A')//n_a[i]???
n+=n_a[i]-'0';
else if(n_a[i]<'a')//n_a[i]?????
n+=n_a[i]-'A'+10;
else//n_a[i]?????
n+=n_a[i]-'a'+10;
}
for(i=0;n!=0;i++)//?????n?????????b???n_b(????)
{
if(n%b>9)//n_b[i]??9?????
n_b[i]=n%b-10+'A';
else//n_b[i]??10?????
n_b[i]=n%b+'0';
n/=b;//n????
}
if(i==0)
cout<<"0";
for(i--;i>=0;i--)
cout<<n_b[i];//????n_b
cout<<endl;
return 0;
}
| 55 |
27,104 | int main()
{
int a,b,i,j,sum10=0,n10[100],nb[100],lenn,q;
char n[100],nc[100];
cin>>a>>n>>b;
lenn=strlen(n);
for(i=0;n[i]!='\0';i++)
{
if((n[i]>='a')&&(n[i]<='z'))
{
n10[i]=n[i]-'a'+10;
}else if((n[i]>='A')&&(n[i]<='Z'))
{
n10[i]=n[i]-'A'+10;
}else {n10[i]=n[i]-'0';}
for(j=1;j<=lenn-i-1;j++)
{
n10[i]=n10[i]*a;
}
sum10=sum10+n10[i];
}
if(sum10==0){cout<<0;}
else
{i=0;
while(sum10!=0)
{
nb[i]=sum10%b;
sum10=sum10/b;
i++;
}
for(j=i-1;j>=0;j--)
{
if(nb[j]>9)
{
nc[j]=nb[j]-10+'A';
}else nc[j]=nb[j]+'0';
cout<<nc[j];
}
}
cin>>q;
return 0;
}
| 55 |
27,105 | int cifang(int u,int g)
{
long int l=1;
for(int i=1;i<=g;i++)
{
l=l*u;
}
return l;
}
int main()
{
int n,m;
long int sum=0;
char a[1000];
cin>>n;
cin>>a;
cin>>m;
char c[26]={'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
int s=strlen(a);
for(int i=0;i<=s-1;i++)
{
if(a[i]>='0' && a[i]<='9')
{
int t=a[i]-'0';
sum=sum+t * cifang(n,s-1-i);
}
else if(a[i]>='A' && a[i]<='Z')
{
int t=a[i]-'A'+10;
sum=sum+t*cifang(n,s-1-i);
}
else if(a[i]>='a' && a[i]<='z')
{
int t=a[i]-'a'+10;
sum=sum+t*cifang(n,s-1-i);
}
}
int b[1000];
int j;
for(int d=0;d<=999;d++)
{
b[d]=sum%m;
sum=(sum-b[d])/m;
if(sum<m)
{
if (sum>0)
{
if(sum>10)
cout<<c[sum-10];
else
cout<<sum;
for(int f=d;f>=0;f--)
{
if(b[f]>=10)
{
cout<<c[b[f]-10];
}
else
{
cout<<b[f];
}
}
break;
}
else
{
for(int f=d;f>=0;f--)
{
if(b[f]>=10)
{
cout<<c[b[f]-10];
}
else
{
cout<<b[f];
}
}
break;
}
}
}
return 0;
} | 55 |
27,106 | main()
{
int f,t,n[10000],m[10000],l,i,s=0,k,g,h;
char c[10000],d[10000];
scanf("%d %s %d",&f,&c,&t);
l=strlen(c);
for (i=l-1;i>=0;i--)
{
if (c[i]>='0' && c[i]<='9')
n[l-1-i]=c[i]-'0';
else
{
if (c[i]>='a' && c[i]<='z')
n[l-1-i]=c[i]-'a'+10;
else
{
if (c[i]>='A' && c[i]<='Z')
n[l-1-i]=c[i]-'A'+10;
}
}
}
for (i=0;i<l;i++)
{
g=1;
for (k=0;k<i;k++)
g*=f;
s+=n[i]*g;
}
if (s==0)
h=1;
else
h=0;
for (k=0;s!=0;k++)
{
m[k]=s%t;
s=s/t;
}
for (i=k-1;i>=0;i--)
{
if (m[i]<=9)
d[k-1-i]=m[i]+'0';
else
d[k-1-i]=m[i]-10+'A';
}
for (i=0;i<k;i++)
{
printf("%c",d[i]);
}
if (h==1)
printf("0");
printf("\n");
}
| 55 |
27,107 | main()
{
long int f(int y,int r);
int a,b,i,j,t=0;
long int q=0,w=0,p=0;
char n[800];
int m[1000];
scanf("%d",&a);
scanf("%s",n);
scanf("%d",&b);
if(n[0]=='0')
printf("%c",'0');
else
{
p=strlen(n);
for(i=0;i<p;i++)
{
if(n[i]>='A'&&n[i]<='Z')
n[i]=n[i]-'A'+10;
else if(n[i]>='a'&&n[i]<='z')
n[i]=n[i]-'a'+10;
else if(n[i]>='0'&&n[i]<='9')
n[i]=n[i]-'0';
}
w=0;
for(i=0;i<p;i++)
{
w=w*a+n[i];
}
for(j=0;;j++)
{
m[j]=w%b;
w=w/b;
if(w<b)
{ m[j+1]=w%b;
t=j+1;
break;
}
}
m[t+1]='\0';
for(i=t;i>=0;i--)
{
if(m[i]>9)
{
m[i]=m[i]+'A'-10;
printf("%c",m[i]);
}
else
printf("%c",m[i]+'0');
}
}
getchar();
getchar();
}
| 55 |
27,108 | long f(int x[80],int p,int l)
{
int i,sum=0;
for(i=0;i<l;i++)
sum=sum*p+x[i];
return(sum);
}
void main()
{
int a,b,y[80],i,len;
long t;
char x[80];
scanf("%d%s%d",&a,x,&b);
for(i=0;i<strlen(x);i++)
{
if(x[i]>='0'&&x[i]<='9')
y[i]=x[i]-'0';
else if(x[i]>='a'&&x[i]<='z')
y[i]=x[i]-'a'+10;
else if(x[i]>='A'&&x[i]<='Z')
y[i]=x[i]-'A'+10;
}
t=f(y,a,strlen(x));
if(t==0)
printf("0");
else
{
for(i=0;t!=0;i++)
{
y[i]=t%b;
t=(t-y[i])/b;
}
len=i;
for(i=0;i<len;i++)
{
if(y[i]>=0&&y[i]<=9)
x[i]='0'+y[i];
else if(y[i]>9)
x[i]=y[i]-10+'A';
}
for(i=len-1;i>=0;i--)
printf("%c",x[i]);
}
} | 55 |
27,109 | main()
{
int a,b,d,i,l,m,n;
long s=0;
char c[32],e[32];
scanf("%d %s %d",&a,c,&b);
if(c[0]=='0')
printf("%d\n",0);
else
{
l=strlen(c);
for(i=0;i<=l-1;i++)
{
if(c[i]<'A')
d=c[i]-'0';
else if(c[i]<'a')
d=c[i]-'A'+10;
else
d=c[i]-'a'+10;
s=s*a+d;
}
for(i=0;s>0;i++)
{
n=s%b;
if(n<10)
e[i]=n+'0';
else
e[i]=n-10+'A';
s=s/b;
}
for(m=i-1;m>0;m--)
printf("%c",e[m]);
printf("%c\n",e[0]);
}
getchar();
getchar();
getchar();
getchar();
getchar();
getchar();
getchar();
getchar();
getchar();
} | 55 |
27,110 | long int cifang(int x, int y)
{
long int z;
int i;
z = 1;
for(i=0; i<y; i++)
{
z = z*x;
}
return(z);
}
void main()
{
int a, b, t, i, mod[50]={0};
char n[10];
long int ten;
scanf("%ld", &a);
scanf("%s", n);
scanf("%ld", &b);
//?a????????
t = 0;
ten = 0;
for(i=0; n[i]!='\0'; i++)
{
t++;
}
for(i=0; i<t; i++)
{
if(n[i]>=48 && n[i]<=57)
{
ten = ten + (n[i]-48) * cifang(a, t-i-1);
}
else if(n[i]>=65 && n[i]<=90)
{
ten = ten + (n[i]-55) * cifang(a, t-i-1);
}
else if(n[i]>=97 && n[i]<=122)
{
ten = ten + (n[i]-87) * cifang(a, t-i-1);
}
}
//???????b??
t = 0;
for(i=0; ; i++)
{
t++;
mod[i] = ten%b;
ten = (ten-mod[i])/b;
if(ten==0)
break;
else
continue;
}
//??
for(i=t-1; i>=0; i--)
{
if(mod[i]<=9)
printf("%d", mod[i]);
else if(mod[i]>9)
printf("%c", mod[i]+55);
}
} | 55 |
27,111 | 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]>='A'&&num1[i]<='Z')
num1[i]+=32;
}
for(int i=0;i<strlen(num1);i++)
{
if(num1[i]>='a'&&num1[i]<='z') c+=((int)num1[i]-87)*pow((double)a,(double)(strlen(num1)-1-i));
else if(num1[i]>='1'&&num1[i]<='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,112 | void main()
{
int a,b,l1,i,j=0,t,m=0,n;
char str1[100],str2[100];
scanf("%d%s%d",&a,str1,&b);
l1=strlen(str1);
if(str1[0]=='0')
printf("0");
for(i=0;i<l1;i++)
{if(str1[i]<='z'&&str1[i]>='a')
t=str1[i]-'a'+10;
else if(str1[i]<='Z'&&str1[i]>='A')
t=str1[i]-'A'+10;
else
t=str1[i]-'0';
m=m*a+t;
}
while(m!=0)
{
n=m%b;
m=m/b;
if(n>=10)
str2[j]=n-10+'A';
else str2[j]=n+'0';
j++;
}
for(i=0;i<j;i++)
str1[i]=str2[j-i-1];
str1[j]='\0';
printf("%s",str1);
}
| 55 |
27,113 | void main()
{
int a,b,i,expa,expb;
long temp=0;
char r[65];
char n[65]={0};
scanf("%d %s %d",&a,n,&b);
expa=strlen(n);
for(i=0;n[i]!='\0';i++)
{
if(n[i]>='a') n[i]+=-87;
else if(n[i]>='A') n[i]+=-55;
else n[i]+=-48;
temp+=n[i]*(int)pow(a,expa-1-i);
}
if(temp==0)
printf("0");
else
{
expb=(int)(log(temp)/log(b))+1;
for(i=0;i<expb;i++)
{
r[i]=(temp%(int)(pow(b,expb-i)))/(int)pow(b,expb-1-i);
if(r[i]>=10) r[i]+=55;
else r[i]+=48;
printf("%c",r[i]);
}
}
printf("\n");
} | 55 |
27,114 | int main(int argc, char *argv[])
{
int a[256],i;
for (i='0';i<='9';i++)
a[i]=i-'0';
for (i='a';i<='z';i++)
a[i]=i-'a'+10;
for (i='A';i<='Z';i++)
a[i]=i-'A'+10;
char s[]="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int n,m;
char b[100],c[100];
scanf ("%d%s%d",&n,b,&m);
int sum=0,q,j;
q=strlen(b);
for (i=0;b[i]!='\0';i++)
{
sum=sum+a[b[i]]*pow(n,q-1-i);
}
if (sum==0)
printf ("0");
else
{
for (i=0;sum>0;i++)
{
c[i]=s[sum%m];
sum=sum/m;
c[i+1]='\0';
}
}
q=strlen (c);
for ( j=q-1;j>=0;j--)
printf ("%c",c[j]);
scanf ("%d",&i);
return 0;
}
| 55 |
27,115 | int main()
{
long a,b,i,n=0,t=0,sum;
char s[1000];
long q[1000];
char p[1000];
char m[1000];
scanf("%d %s %d",&a,s,&b);
for(i=0;s[i]!='\0';i++)
n=n+1;
for(i=0;i<=n-1;i++)
{
if(s[i]>='a'&&s[i]<='z')
s[i]=s[i]-'a'+10;
if(s[i]>='0'&&s[i]<='9')
s[i]=s[i]-'0';
if(s[i]>='A'&&s[i]<='Z')
s[i]=s[i]-'A'+10;
}
sum=1;
for(i=n-1;i>=0;i--)
{
t=s[i]*sum+t;
sum=sum*a;
}
if(t==0)
printf("0");
q[0]=t;
for(i=0;q[i]!=0;i++)
q[i+1]=q[i]/b;
for(i=0;q[i]!=0;i++)
{
p[i]=q[i]%b;
if(p[i]>9)
p[i]=p[i]-10+'A';
else
p[i]=p[i]+'0'-0;
}
p[i]='\0';
n=0;
for(i=0;p[i]!='\0';i++)
n=n+1;
for(i=0;i<=n-1;i++)
m[i]=p[n-i-1];
m[n]='\0';
printf("%s",m);
getchar();
getchar();
} | 55 |
27,116 | void main()
{
int a,b,l,i,j,m,k;
char c[100];
int d[100];
char e[100];
int f[100];
scanf("%d",&a);
scanf("%s",c);
scanf("%d",&b);
l=strlen(c);
for(i=0;i<l;i++)
{
if(c[i]>='A'&&c[i]<='Z')
f[i]=10+c[i]-'A';
if(c[i]>='a'&&c[i]<='z')
f[i]=10+c[i]-'a';
if(c[i]>='0'&&c[i]<='9')
f[i]=c[i]-'0';
}
m=0;
for(i=0;i<l;i++)
{
k=1;
j=1;
while(j<(l-i))
{
k=k*a;
j++;
}
m=m+f[i]*k;
}
i=0;
while(m>0)
{
if(m>=b)
{
d[i]=m%b;
m=m/b;
i++;
}
else
{
d[i]=m;
m=0;
}
}
l=i+1;
for(i=0;i<l;i++)
{
if(d[i]<10)
e[l-1-i]=d[i]+'0';
else
e[l-1-i]=d[i]-10+'A';
}
for(i=0;i<l;i++)
printf("%c",e[i]);
}
| 55 |
27,117 | int main(int argc, char* argv[])
{
char a[100],f[100],p;
int n,m,i,k=-1,sum=1,s=0,b[100],j,msum=0;
scanf("%d %s %d",&n,a,&m);
for(i=0;a[i]!='\0';i++){
k++;
}
for(i=0;i<=k;i++){
if(a[i]>96&&a[i]<123){
a[i]=a[i]-32;
}
}
for(i=0;i<=k;i++){
if(a[i]>47&&a[i]<58){
sum=sum*(a[i]-48);
for(j=i;j<k;j++){
sum=sum*n;
}
}
else if(a[i]>64&&a[i]<91){
sum=sum*(a[i]-55);
for(j=i;j<k;j++){
sum=sum*n;
}
}
msum=msum+sum;
sum=1;
}
for(i=0;msum>=m;i++){
b[i]=msum%m;
if(b[i]>=0&&b[i]<10){
f[i]=b[i]+48;
}
else if(b[i]>=10&&b[i]<=36){
f[i]=b[i]+55;
}
msum=msum/m;
s++;
}
if(msum>=0&&msum<10){
p=msum+48;
}
else if(msum>=10&&msum<36){
p=msum+55;
}
printf("%c",p);
for(i=s-1;i>=0;i--){
printf("%c",f[i]);
}
return 0;
} | 55 |
27,118 | void fun(char[][10],int*,int*,int);
void main()
{
long i,l,a,b,t=0,r;
char n[20],m[20]={'\0'};
scanf("%ld %s %ld",&a,n,&b);
l=strlen(n);
for(i=0;i<l;i++)
{
if(n[i]>='0'&&n[i]<='9')
t+=(n[i]-'0')*pow(a,l-i-1);
else if(n[i]>='a'&&n[i]<='z')
t+=(n[i]-'a'+10)*pow(a,l-i-1);
else
t+=(n[i]-'A'+10)*pow(a,l-i-1);
}
if(t==0)
printf("0");
else
{
for(i=0;t>0;i++)
{
r=t%b;
if(r<10)
m[i]='0'+r;
else
m[i]='A'+(r-10);
t/=b;
}
for(i=i-1;i>=0;i--)
printf("%c",*(m+i));
}
}
| 55 |
27,119 | void main()
{
int x[100]={0}, n, i, p, y;
char c[100]={'\0'} ;
int a, b, m, num=0;
scanf("%d",&a);
scanf("%s",c);
scanf("%d",&b);
n=strlen(c);
for(i=n-1;i>=0;i--)
{
m=pow(a,n-1-i);
if(c[i]<65)
num=num+m*(c[i]-48);
else if(c[i]<96)
num=num+(c[i]-55)*m;
else
num=num+(c[i]-87)*m;
}
y=0;
for(i=0;;i++)
{
y++;
x[i]=num%b;
m=pow(b,i);
p=num/b;
if(p<b)
break;
num=num/b;
}
if(p<=9&&p>0)
printf("%d",p);
else
if(p>9)
printf("%c",p+55);
for(i=y-1;i>=0;i--)
{
if(x[i]<=9)
printf("%d",x[i]);
else
printf("%c",(x[i]+55));
}
printf("\n");
}
| 55 |
27,120 | int main()
{
int a,b;
char n[40];
scanf("%d %s %d",&a,n,&b);
int l=strlen(n);
int m[40];
int x=0;
for(int i=0;i<l;i++)
{
if(n[i]>='A'&&n[i]<='Z')
n[i]=n[i]-'A'+'a';
if(n[i]<='z'&&n[i]>='a')
m[i]=n[i]-'a'+10;
else m[i]=n[i]-'0';
int d=m[i];
x=x*a+d;
}
if (x==0)
printf("0");
else
{
int e[40],k;
for (k=0;x!=0;k++)
{e[k]=x%b;
x=x/b;
}
e[k]='\0';
char f[40];
int j;
for(j=0;j<k;j++)
{
if(e[j]>=0&&e[j]<10)
f[k-j-1]=e[j]+'0';
else
f[k-j-1]=e[j]-10+'A';
}
f[k]='\0';
printf("%s",f);
}
getchar();
getchar();
}
| 55 |
27,121 | int main()
{
int s_n[128];
char n_s[]="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
char in[255],out[255]="0";
int i,from,to,len=0;
long num=0;
for(i='0';i<='9';i++)
{s_n[i]=i-'0';}
for(i='A';i<='Z';i++)
{s_n[i]=i-'A'+10;}
for(i='a';i<'z';i++)
{s_n[i]=i-'a'+10;}
scanf("%d %s %d",&from,in,&to);
for(i=0;in[i]!='\0';i++)
{num=num*from+s_n[in[i]];}
len=(num==0)?1:0;
while(num>0)
{
out[len++]=n_s[num%to];
num=num/to;
}
for(i=len-1;i>=0;i--)
{
printf("%c",out[i]);
}
return 0;
}
| 55 |
27,122 |
struct stack
{
char data[101];
int top;
};
long int change(int a, char *s);
int main()
{
long int a, b, n;
char str[101];
while(scanf("%ld %s %ld", &a, str, &b) != EOF)
{
n = change(a, str);
if(n == 0)
{
printf("0");
}else
{
int temp;
struct stack *s = (struct stack *)malloc(sizeof(struct stack));
s->top = 0;
while(n)
{
temp = n % b;
if(temp >= 0 && temp <= 9)
{
s->data[s->top ++] = temp + '0';
}else
{
s->data[s->top ++] = temp - 10 + 'A';
}
n /= b;
}
while(s->top)
{
printf("%c", s->data[-- s->top]);
}
}
printf("\n");
}
return 0;
}
long int change(int a, char *s)
{
int i, b;
long int n, c;
for(n = 0, c = 1, i = strlen(s) - 1; i >= 0; i --)
{
if(s[i] >= 'A' && s[i] <= 'Z')
b = s[i] - 55;
else if(s[i] >= 'a' && s[i] <= 'z')
b = s[i] - 87;
else
b = s[i] - '0';
n += b * c;
c *= a;
}
return n;
}
| 55 |
27,123 | void main()
{
int a,b,i,m,e,f,d=1,c=0;
char n[1000]={0},k[1000]={0};
scanf("%d",&a);
scanf("%s",n);
scanf("%d",&b);
m=strlen(n);
for(i=0;i<m;++i)
{
if(n[i]>=65&&n[i]<=90)
n[i]=n[i]-55;
if(n[i]>=97&&n[i]<=122)
n[i]=n[i]-87;
if(n[i]>=48&&n[i]<=57)
n[i]=n[i]-48;
c=c*a+n[i];
}
if(c==0) printf("0\n");
for(i=0;c>0;++i)
{
e=c%b;
if(e>=10&&e<=35)
e=e+55;
if(e>=0&&e<=9)
e=e+48;
c=(c-c%b)/b;
k[i]=e;
}
f=strlen(k);
for(i=0;i<f;++i)
{ if(k[i]!='\0')
printf("%c",k[f-1-i]);}
}
| 55 |
27,124 | int main()
{
char a[100000]={0},b[100000]={0};
int i,n=0,ta,tb;
scanf("%d ",&ta);
scanf("%s",a);
scanf("%d",&tb);
for(i=0;i<strlen(a);i++)
if(a[i]>=97&&a[i]<=122)
a[i]-=32;
for(i=0;i<strlen(a);i++)//?????????n?
{
if(a[i]>=65&&a[i]<=90)
n=ta*n+(a[i]-55);
else n=ta*n+(a[i]-48);
}
//printf("%d\n",n);
if(n==0) printf("0");
else for(i=0;n>0;i++) //
{
if(n%tb<10)
b[i]=n%tb+48;
else b[i]=n%tb+55;
n=n/tb;
}
for(i=strlen(b)-1;i>=0;i--)
printf("%c",b[i]);
return 0;
}
| 55 |
27,125 | int main()
{
int m,n,l,i,j,b[65535];
long t=0,k=1;
char a[65535];
scanf("%d %s %d",&m,a,&n);
l=strlen(a);
for(i=0;i<l;i++)
{
if((a[i]<='9')&&(a[i]>='0'))
b[i]=a[i]-'0';
if((a[i]<='z')&&(a[i]>='a'))
b[i]=a[i]-'a'+10;
if((a[i]<='Z')&&(a[i]>='A'))
b[i]=a[i]-'A'+10;
}
for(i=0;i<l;i++)
{
t=t+b[i]*pow(m,l-i-1);
}
if(t==0)
printf("%d",t);
j=0;
while(t!=0)
{
b[j]=t%n;
t=t/n;
j++;
}
for(i=0;i<j;i++)
{
if(b[i]<=9)
a[j-1-i]='0'+b[i];
else
a[j-1-i]='A'+b[i]-10;
}
a[j]='\0';
printf("%s",a);
getchar();
getchar();
}
| 55 |
27,126 | // ??7.13.cpp : ??????????????
//
char antichange(int x)
{
if(x==0){return '0';}
if(x==1){return '1';}
if(x==2){return '2';}
if(x==3){return '3';}
if(x==4){return '4';}
if(x==5){return '5';}
if(x==6){return '6';}
if(x==7){return '7';}
if(x==8){return '8';}
if(x==9){return '9';}
if(x==10){return 'A';}
if(x==11){return 'B';}
if(x==12){return 'C';}
if(x==13){return 'D';}
if(x==14){return 'E';}
if(x==15){return 'F';}
if(x==16){return 'G';}
if(x==17){return 'H';}
if(x==18){return 'I';}
if(x==19){return 'J';}
if(x==20){return 'K';}
if(x==21){return 'L';}
if(x==22){return 'M';}
if(x==23){return 'N';}
if(x==24){return 'O';}
if(x==25){return 'P';}
if(x==26){return 'Q';}
if(x==27){return 'R';}
if(x==28){return 'S';}
if(x==29){return 'T';}
if(x==30){return 'U';}
if(x==31){return 'V';}
if(x==32){return 'W';}
if(x==33){return 'X';}
if(x==34){return 'Y';}
if(x==35){return 'Z';}
}
char change(char x)
{
if(x=='0'){return 0;}
if(x=='1'){return 1;}
if(x=='2'){return 2;}
if(x=='3'){return 3;}
if(x=='4'){return 4;}
if(x=='5'){return 5;}
if(x=='6'){return 6;}
if(x=='7'){return 7;}
if(x=='8'){return 8;}
if(x=='9'){return 9;}
if(x=='a'||x=='A'){return 10;}
if(x=='b'||x=='B'){return 11;}
if(x=='c'||x=='C'){return 12;}
if(x=='d'||x=='D'){return 13;}
if(x=='e'||x=='E'){return 14;}
if(x=='f'||x=='F'){return 15;}
if(x=='g'||x=='G'){return 16;}
if(x=='h'||x=='H'){return 17;}
if(x=='i'||x=='I'){return 18;}
if(x=='j'||x=='J'){return 19;}
if(x=='k'||x=='K'){return 20;}
if(x=='l'||x=='L'){return 21;}
if(x=='m'||x=='M'){return 22;}
if(x=='n'||x=='N'){return 23;}
if(x=='o'||x=='O'){return 24;}
if(x=='p'||x=='P'){return 25;}
if(x=='q'||x=='Q'){return 26;}
if(x=='r'||x=='R'){return 27;}
if(x=='s'||x=='S'){return 28;}
if(x=='t'||x=='T'){return 29;}
if(x=='u'||x=='U'){return 30;}
if(x=='v'||x=='V'){return 31;}
if(x=='w'||x=='W'){return 32;}
if(x=='x'||x=='X'){return 33;}
if(x=='y'||x=='Y'){return 34;}
if(x=='z'||x=='Z'){return 35;}
}
int main()
{
int l1=0,l2=0,l3=0,i=0,part=0,sum=0,j=0,mi=1,r[LEN],s=0;
char a[LEN],b[LEN],c[LEN],result[LEN];
scanf("%s%s%s",a,b,c);
l1=atoi(a),l2=strlen(b),l3=atoi(c);
for(i=0;i<l2;i++)
{
s+=change(b[i]);
}
if(s==0)
{
printf("0");
}
else
{
//printf("a=%d c=%d\n",l1,l3);
sum=change(b[l2-1]);
//printf("sum=%d\n",sum);
mi=l1;
for(i=l2-2;i>=0;i--)
{
part=change(b[i]);
//printf("mi=%d\n",mi);
part=part*mi;
//printf("part=%d\n",part);
sum=sum+part;
//printf("sum=%d\n",sum);
mi=mi*l1;
}
while(sum!=0)
{
r[j]=sum%l3;
result[j]=antichange(r[j]);
//printf("result[j]=%c\n",result[j]);
//printf("r[j]=%d\n",r[j]);
j++;
sum=sum/l3;
}
part=j;
for(j=part-1;j>=0;j--)
{
printf("%c",result[j]);
}
}
return 0;
}
| 55 |
27,127 | int main()
{
int a,b,i,k,s,j,d[40];
char n[40];
scanf("%d %c",&a,&n[0]);
i=0;
while (n[i]!=' ')
{
i=i+1;
scanf("%c",&n[i]);
}
scanf("%d",&b);
k=1;
s=0;
for (j=i-1;j>=0;j--)
{
if (n[j]>='0' && n[j]<='9')
s=s+k*(n[j]-'0');
else if (n[j]>='a' && n[j]<='z')
s=s+k*(n[j]-'a'+10);
else s=s+k*(n[j]-'A'+10);
k=k*a;
}
i=0;
while (s>=b)
{
d[i]=s%b;
i=i+1;
s=s/b;
}
d[i]=s;
for (j=i;j>=0;j--)
{
if (d[j]<=9)
n[i-j]=d[j]+'0';
else n[i-j]=d[j]-10+'A';
}
n[i+1]='\0';
puts(n);
getchar();
getchar();
} | 55 |
27,128 |
int main()
{ char str1[1000];
char str2[1000]="0";
int a1;
long num=0;
int b1;
int num1[1000]={0};
char char1[]="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int i;
for(i='0';i<='9';i++)
{
num1[i]=i-'0';
}
for(i='A';i<='Z';i++)
{
num1[i]=i-'A'+10;
}
for(i='a';i<='z';i++)
{
num1[i]=i-'a'+10;
}
scanf("%d%s%d",&a1,str1,&b1);
for(i=0;str1[i]!='\0';i++)
{
num=num*a1+num1[str1[i]];
}
int l2=0;
l2=(num==0)?1:0;
while(num>0)
{
str2[l2]=char1[num%b1];
num=num/b1;
l2=l2+1;
}
for(i=l2-1;i>=0;i--)
{
cout<<str2[i];
}
return 0;
}
| 55 |
27,129 | int main()
{
int a,b,t,i,p=0,e,j,f=1;
char c[100],d[100];
scanf("%d %s %d",&a,c,&b);
t=strlen(c);
for (i=t-1;i>=0;i--)
{
if(c[i]>=65&&c[i]<=91)
p+=f*(c[i]-55);
else if (c[i]>=97&&c[i]<=123)
p+=f*(c[i]-87);
else if (c[i]>=48&&c[i]<=57)
p+=f*(c[i]-48);
f=f*a;
}
for (j=0;;j++)
{
e=p%b;
p=p/b;
if(e>=0&&e<=9)
d[j]=e+'0';
else if(e>=10&&e<=35)
d[j]=e-10+'A';
if(p==0)
break;}
for(i=j;i>=0;i--)
{
printf("%c",d[i]);
}
printf("\n");
return 0;
} | 55 |
27,130 | int main()
{
int a, b, num = 0 , e[100], f[100] = {0}, i, j, l;
char c[100], d[100];
cin >> a;cin.get();
cin >> c;l = strlen(c);
cin >> b;
for(i = 0; i < l; i++)
{
if(c[i] >= '0' && c[i] <= '9') e[i] = c[i] - '0';
else if(c[i] >= 'a' && c[i] <= 'z') e[i] = c[i] - 'a' + 10;
else e[i] = c[i] - 'A' + 10;
num = num * a + e[i];
}
if(num == 0) cout << "0" << endl;
else
{i = 0;
while(num!= 0)
{
f[i++] = num % b;
num /= b;
}
for(j = i - 1;j >= 0; j--)
{
if(f[j] >= 0 && f[j] <= 9) d[j] = f[j] + '0';
else d[j] = f[j] - 10 + 'A';
cout << d[j] ;
}
cout << endl;
}
//cout << num << endl;
return 0;
}
| 55 |
27,131 | long int form (char* num,int j)
{
int n=0,i,w=0,l;
l=strlen (num);
for(i=l-1;i>=0;i--)
{
if(isdigit(num[i]))
w=num[i]-'0';
else if (isalpha(num[i]))
{
if(islower(num[i]))
num[i]=toupper(num[i]);
w=num[i]-'A'+10;
}
n+=w*(int)pow(j,l-1-i);
}
return n;
}
int reform(long int n,char*num,int b)
{
int y,w,i;
for (i=0;n>=b;i++)
{
y=n%b;
n=n/b;
num[i]=y<10?'0'+y:'A'+y-10;
}
num[i]=n<10?'0'+n:'A'+n-10;
return i;
}
int main()
{
long int n=0;
int a,b,l,i;
char num1[100];
scanf("%d %s %d",&a,num1,&b);
n=form(num1,a);
l=reform(n,num1,b);
for(i=l;i>=0;i--)
{
printf("%c",num1[i]);
}
return 0;
}
| 55 |
27,132 | int main()
{
int a,b,l; //?????????????????
long n=0;
char c[100];
cin>>a>>c>>b; //??
l=strlen(c);
for(int i=0;i<=l-1;i++) //????
if(c[i]<='z'&&c[i]>='a')
c[i]=c[i]-'a'+'A';
for(int i=0;i<l;i++) //??????
{
int m;
if(c[i]<='Z'&&c[i]>='A')
m=10+c[i]-'A';
else m=c[i]-'0';
n+=m*pow((double)a,l-i-1);
}
for(int i=0;;i++) //???????
{
int m;
m=n%b;
n=(n-m)/b;
if(m<10)
c[i]=m+'0';
else c[i]=m-10+'A';
if(n==0)
{
l=i+1;
break;
}
}
for(int i=l-1;i>=0;i--) //??
cout<<c[i];
return 0;
} | 55 |
27,133 | void main()
{
long int a,b,i,j=0,r,t=0,d[10000];
char c[100];
scanf("%ld %s %ld",&a,c,&b);
r=strlen(c);
for(i=0;i<r;i++)
{
if(c[i]>=65 && c[i]<=90 )
c[i]=c[i]-55;
else if( c[i]<=122 && c[i]>=97)
c[i]=c[i]-87;
else
c[i]=c[i]-'0';
if((r-i-1)!=0)
t=t+c[i]*(int)pow(a,r-i-1);
else
t=t+c[i];
}
while(t>=b)
{
d[j]=t%b;
t=t/b;
j=j+1;
}
d[j]=t;
for(i=j;i>=0;i--)
{
if(d[i]>=0 && d[i]<=9)
printf("%d",d[i]);
else
printf("%c",d[i]+55);
}
printf("\n");
} | 55 |
27,134 | int main(int argc, char* argv[])
{
char s[10];
int a, b;
scanf("%d %s %d",&a,s,&b);
int i,sum=0,d;
d=strlen(s);
for(i=0;i<d;i++){
if(s[i]>47&&s[i]<58)
sum=sum*a+(s[i]-48);
if(s[i]>64&&s[i]<91)
sum=sum*a+(s[i]-55);
if(s[i]>96&&s[i]<123)
sum=sum*a+(s[i]-87);
}
char ss[20];
int c,e=0;
for(i=0;;i++){
c=sum%b;
sum=sum/b;
if(c>=0&&c<10)
ss[i]=c+48;
if(c>9&&c<36)
ss[i]=c+55;
e++;
if(sum==0)
break;
}
for(i=e;i>0;i--)
printf("%c",ss[i-1]);
return 0;
} | 55 |
27,135 | 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);
n=strlen(c);
n--;
ans=calc(c[n]);
j=1;
for (i=n-1;i>=0;i--)
{
j*=a;
ans+=calc(c[i])*j;
}
i=0;
while (ans>0)
{
i++;
c[i]=conv(ans%b);
ans/=b;
}
if (i==0) printf("0");
while (i>=1)
{
printf("%c",c[i]);
i--;
}
}
| 55 |
27,136 | int main()
{
char s[100],u[100];
int a,b,l,k=0,i,j,r,l1;
cin>>a>>s>>b;
l=strlen(s);
int sum=1;
for(i=0,j=l-1;j>=0;i++,j--)
{
if(s[j]>=65)
{
if(s[j]>=97)
k=k+(s[j]-87)*sum;
else
k=k+(s[j]-55)*sum;
}
else
k=k+(s[j]-48)*sum;
sum=sum*a;
}
if(k==0)
cout<<"0"<<endl;
else
{
for(j=0;k!=0;j++)
{
r=k%b;
if(r>=10)
u[j]=r-10+'A';
else
u[j]=r+'0';
k=k/b;
}
u[j]='\0';
l1=strlen(u);
for(j=l1-1;j>=0;j--)
cout<<u[j];
cout<<endl;
}
return 0;
}
| 55 |
27,137 |
int main(){
int a,b,i=0,j=0,t=0;
double k,x;
char n[100],m[100];
cin>>a>>n>>b;
x=strlen(n);
for(i=0;i<x;i++)
{{if(n[i]>='A'&&n[i]<='Z')
k=n[i]-55;
else if(n[i]>='a'&&n[i]<='z')
k=n[i]-87;
else k=n[i]-48;}t=t+k*pow((double)a,x-i-1.0);
}
while(t/b!=0)
{m[j]=t%b;
t=t/b;
j++;
}m[j]=t%b;
while(j>=0){if(m[j]>9)(char)(m[j]+=55);
else (char)(m[j]+=48);
cout<<m[j];j--;}
return 0;
}
| 55 |
27,138 | /**
* file homwork.cpp
* author ???
* data 2011-11-14
* description ????
*/
int length , i ;
char n[1000]; //??????
unsigned turn(int n1 , char a[]);
void f(int n2 , unsigned s , int j);
int main()
{
int a , b ;
unsigned number;
char str[1000] ;
while(cin >> a)
{
cin >> str >> b ;
length = strlen (str) ;
number = turn( a , str ) ;
f(b , number , 0) ;
memset(str , 0 ,sizeof(str)); //???0?
}
return 0;
}
unsigned turn(int n1 , char a[]) //???????10???
{
int sum = 0;
for( i = 0 ; i <= length - 1 ; i++)
{
if(a[i] >= '0' && a[i] <= '9')
sum = sum * n1 + (a[i] - '0');
else if(a[i] >= 'A' && a[i] <= 'Z')
sum = sum * n1 + (a[i] - 'A' + 10);
else if(a[i] >= 'a' && a[i] <= 'z')
sum = sum * n1 + (a[i] - 'a' + 10);
}
return sum;
}
void f(int n2 , unsigned s , int j) //?????????????
{
int k;
if(s == 0)
{
if(j == 0)
cout << 0;
for(i = j - 1 ; i >= 0 ; i --)
printf("%c",n[i]);
}
else
{
k = s % n2 ;
s = s / n2 ;
if(k <= 9 && k >= 0)
n[j] = k + '0' ;
else
n[j] = (k - 10) + 'A';
f(n2 , s , j + 1); //?????
}
return;
}
| 55 |
27,139 | long change1(char a[],int n1)
{
int s=0,temp;
int len,i;
len=strlen(a);
for(i=0;i<len;i++)
{
if(a[i]>='0'&&a[i]<='9')
temp=a[i]-'0';
if(a[i]>='a'&&a[i]<='z')
temp=a[i]-'a'+10;
if(a[i]>='A'&&a[i]<='Z')
temp=a[i]-'A'+10;
s=s*n1+temp;
}
return s;
}
void change2(long s,int n2,char b[])
{
int i=0,j;
int temp,add;
while(s>0)
{
add=s%n2;
if(add>=10)
{
b[i]=add-10+'A';
}
else
b[i]=add+'0';
i++;
s=s/n2;
}
for(j=0;j<=i/2-1;j++)
{
temp=b[j];
b[j]=b[i-1-j];
b[i-1-j]=temp;
}
}
void main()
{
char a[50]={0},b[50]={0};
int n1,n2,len,i;
long s;
scanf("%d%s%d",&n1,a,&n2);
s=change1(a,n1);
change2(s,n2,b);
len=strlen(b);
if(len>0)
{
for(i=0;i<len;i++)
printf("%c",b[i]);
printf("\n");
}
if(len==0)
printf("0\n");
}
| 55 |
27,140 | void main()
{
int a,b,i,t=1,w;
char n[32],k[32]={0};
long m=0;
scanf("%d",&a);
scanf("%s",n);
scanf("%d",&b);
for(i=strlen(n);i>=0;i--)
{
if((n[i]>='0')&&(n[i]<='9'))
{
m=m+(n[i]-'0')*t;
t=t*a;
}
else if((n[i]>='a')&&(n[i]<='z'))
{
m=m+(n[i]-'a'+10)*t;
t=t*a;
}
else if((n[i]>='A')&&(n[i]<='Z'))
{
m=m+(n[i]-'A'+10)*t;
t=t*a;
}
}
if(m==0)
printf("0\n");
else
{
if(b==10)
printf("%ld",m);
else
{
for(i=0;m!=0;i++)
{
w=m%b;
if(w>=0&&w<=9)
k[i]=w+'0';
else if(w>9&&w<36)
k[i]=w-10+'A';
m=(m-w)/b;
}
k[i]='\0';
for(i=strlen(k)-1;i>=0;i--)
printf("%c",k[i]);
printf("\n");
}
}
} | 55 |
27,141 |
void Reverse( char y[] )
{
int len = strlen(y);
int i;
for (i=0;i<len/2;i++)
{
char tmp = y[i];
y[i] = y[len-i-1];
y[len-i-1] = tmp;
}
}
int main()
{
int a,b,n,s=0,a1=1,l,r,i,j;
char x[100],y[1000],m;
scanf("%d %s %d",&a,x,&b);
n=strlen(x);
for(i=0;i<n;i++)
{
if(x[n-1-i]<58)
r=x[n-1-i]-48;
else
{
if((x[n-1-i]>='a')&&(x[n-i-1]<='z'))
r=x[n-1-i]-87;
else
r=x[n-1-i]-55;
}
s=s+r*a1;
a1=a1*a;
}
memset(y,0,sizeof(y));
for(i=0,l=s;;i++)
{
r=l%b;
l=(l)/b;
if(r<10)
y[i]=r+48;
else
y[i]=r+55;
if(l==0)break;
}
Reverse(y);
printf("%s\n",y);
//for(j=i;j>=0;j--)
//{
// printf("%c",y[j]);
//}
//printf("\n");
return 0;
} | 55 |
27,142 |
int main()
{
char a[200], t[200];
int k, b;
long n = 0;
scanf("%d%s%d", &k, a, &b);
int i, j;
for(i = 0; i < (int)strlen(a); i++)
{
if(a[i] >= '0' && a[i] <= '9')
{
n = n * k + (a[i] - '0');
}
if(a[i] >= 'a' && a[i] <= 'z')
{
n = n * k + (a[i] - 'a' + 10);
}
if(a[i] >= 'A' && a[i] <= 'Z')
{
n = n * k + (a[i] - 'A' + 10);
}
}
i = 0;
do
{
t[i] = n % b + '0';
if(t[i] > '9')
t[i] = t[i] - '0' + 'A' - 10;
n = n / b;
i++;
}
while(n > 0);
for(j = i - 1; j >= 0; j--)
{
printf("%c", t[j]);
}
printf("\n");
return 0;
}
| 55 |
27,143 | int main()
{
int a2i[128]={0};
char i2a[]="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
char in[MAX],out[MAX]="0";
int i,from,to,len=0;
long num=0;
for(i='0';i<='9';i++)
{
a2i[i]=i-'0';
}
for(i='A';i<'Z';i++)
{
a2i[i]=i-'A'+10;
}
for(i='a';i<'z';i++)
{
a2i[i]=i-'a'+10;
}
scanf("%d%s%d",&from,in,&to);
for(i=0;in[i]!='\0';i++)
{
num=num*from+a2i[in[i]];
}
len=(num==0)?1:0;
while(num>0)
{
out[len++]=i2a[num%to];
num/=to;
}
for(i=len-1;i>=0;i--)
{
printf("%c",out[i]);
}
printf("\n");
return 0;
}
| 55 |
27,144 |
int huan(char k);
char huan2(int k);
int main()
{
int a,b;
char *ps,*result;
int *tmp;
ps = (char*) malloc (sizeof(long)*8);
tmp = (int*) malloc (sizeof(long)*8);
result = (char*) malloc (sizeof(long)*8);
scanf("%d",&a);
scanf("%s",ps);
scanf("%d",&b);
int k = strlen(ps);
int i;
long tmp2 = 0;
for(i = 0;ps[i] != '\0';i++)
{
tmp[i] = huan(ps[i]);
tmp2 += (long) (tmp[i] * pow(a,k-1-i));
//printf("t%ld\n",(long) (tmp[i] * pow(a,k-1-i)));
}
//printf("t%ld\n",tmp2);
int l = i - 1;
int *tmp3 = (int*) malloc (sizeof(long)*8);
for(l = 0 ; tmp2 != 0; l++)
{
tmp3[l] = tmp2 % b;
//printf("t3 %d l%d\n",tmp3[l],l);
tmp2 = tmp2 / b;
//printf("l%d\n",l);
}
//printf("l%d\n",l);
int m;
l--;
for (m = 0;l >= 0;l--,m++)
{
result[m] = huan2(tmp3[l]);
//printf("r%c l%d\n",result[m],l);
}
result[m] = '\0';
printf("%s",result);
printf("\n");
free(ps);
free(tmp);
free(result);
return 0;
}
int huan(char k)
{
if ( k <= 57)
{
return k-48;
}
else if ( k >=97 && k <= 122)
{
return k - 87;
}
else if ( k >= 65 && k <= 90)
{
return k - 55;
}
return 0;
}
char huan2(int k)
{
if ( k <= 9 )
{
return k + 48;
}
if ( k >= 10 )
{
return k + 55;
}
return 0;
}
| 55 |
27,145 | int main()
{
long num=0,reminder;
int a,b,i,j;
char figure1[100],figure2[100];
cin>>a;
getchar();
for(i=0;;i++)
{
figure1[i]=getchar();
if(figure1[i]>='a'&&figure1[i]<='z')
figure1[i]=figure1[i]-87;
else if(figure1[i]>='A'&&figure1[i]<='Z')
figure1[i]=figure1[i]-55;
else if(figure1[i]>=42&&figure1[i]<=57)
figure1[i]=figure1[i]-'0';
else
break;
num=num*a+figure1[i];
}
reminder=num;
cin>>b;
for(j=0;;j++)
{
if(reminder%b>=10)
figure2[j]=reminder%b+55;
else
figure2[j]=reminder%b+'0';
reminder=reminder/b;
if(reminder==0)
break;
}
for(;j>=0;j--)
cout<<figure2[j];
cout<<endl;
return 0;
}
| 55 |
27,146 | int main(int argc, char* argv[])
{
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,147 |
struct stack
{
char data[MAX];
int top;
};
long int switchToTen(int a, char *s);
int main()
{
long int a, b, n;
char str[MAX];
while(scanf("%ld %s %ld", &a, str, &b) != EOF)
{
n = switchToTen(a, str);
if(n == 0)
{
printf("0");
}else
{
int temp;
struct stack *s = (struct stack *)malloc(sizeof(struct stack));
s->top = 0;
while(n)
{
temp = n % b;
if(temp >= 0 && temp <= 9)
{
s->data[s->top ++] = temp + '0';
}else
{
s->data[s->top ++] = temp - 10 + 'A';
}
n /= b;
}
while(s->top)
{
printf("%c", s->data[-- s->top]);
}
}
printf("\n");
}
return 0;
}
long int switchToTen(int a, char *s)
{
int i, b;
long int n, c;
for(n = 0, c = 1, i = strlen(s) - 1; i >= 0; i --)
{
if(s[i] >= 'A' && s[i] <= 'Z')
b = s[i] - 55;
else if(s[i] >= 'a' && s[i] <= 'z')
b = s[i] - 87;
else
b = s[i] - '0';
n += b * c;
c *= a;
}
return n;
}
| 55 |
27,148 | 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+1<<endl;
while(sum)
{
shang[j]=sum%b;
sum=sum/b;
j++;
}
//cout<<j<<endl;
if(!j) cout<<"0";
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,149 | int main()
{
int n,m,x=0,sum=0,i;
cin>>n;
char a[110],b[110];
cin>>a;
cin>>m;
for (i=0;i<strlen(a);i++)
{
if (a[i]>='0'&&a[i]<='9')
x=a[i]-'0';
if (a[i]>='A'&&a[i]<='Z')
x=10+a[i]-'A';
if(a[i]>='a'&&a[i]<='z')
x=10+a[i]-'a';
sum=sum*n+x;}
i=0;
do
{
b[i]=sum%m;
if (b[i]>=10)
b[i]=b[i]-10+'A';
else b[i] += '0';
sum=sum/m;
i++;
}while(sum>0);
for (int k=i-1;k>=0;k--)
cout<<b[k];
return 0;
}
| 55 |
27,150 | int main()
{
int j1,j2,i,an[10000],bn[10000],shijinzhi=0,changdu;
char a[10000],b[10000];
scanf("%d%s%d",&j1,a,&j2);
changdu=strlen(a);
for(i=0;i<changdu;i++)
{
if(a[i]<123&&a[i]>96)
{
an[i]=a[i]-87;
}
else if(a[i]<91&&a[i]>64)
{
an[i]=a[i]-55;
}
else
{
an[i]=a[i]-48;
}
}
for(i=0;i<changdu;i++)
{
shijinzhi+=an[i]*pow(j1,changdu-1-i);
}
for(i=0;;i++)
{
bn[i]=shijinzhi%j2;
shijinzhi=shijinzhi/j2;
if(shijinzhi==0)
{
changdu=i+1;
break;
}
}
for(i=changdu-1;i>=0;i--)
{
if(bn[i]>=0&&bn[i]<10)
b[changdu-1-i]=bn[i]+48;
else b[changdu-1-i]=bn[i]+55;
}
for(i=0;i<changdu;i++)
{
printf("%c",b[i]);
}
return 0;
} | 55 |
27,151 | void main()
{
unsigned long n=0,temp;
int f,a,b,l,i,j;
char c[100],r[100];
scanf("%d %s %d",&a,c,&b);
l=strlen(c);
for(i=0;i<l;i++)
{ f=0;
temp=c[i]-'0';
if((temp<=9)&&(temp>=0)) ;
else if(temp>=49) temp=temp-39;
else temp=temp-7;
for(j=0;j<(l-1-i);j++) temp=temp*a;
n=temp+n;
}
i=0;
f=1;
while(f!=0)
{
if(n>=b)
{
if((n%b)>9) {r[i]=(n%b)+55;}
else r[i]=(n%b)+48;
n=n/b;
i++;
}
else
{
if(n>9) {r[i]=n+55;}
else r[i]=n+48;
f=0;
}
}
for(;i>=0;i--) printf("%c",r[i]);
printf("\n");
} | 55 |
27,152 | void main()
{
int f(int m,int n);
int a,b,e,sum=0;
int i,j,k;
char c[100],d[100];
scanf("%d %s %d",&a,c,&b);
for(i=0;c[i]!=0;i++);
for(j=0;j<=i-1;j++)
{
if((c[j]>=48)&&(c[j]<=57))sum=sum+(c[j]-48)*f(a,i-j-1);
else if((c[j]>=65)&&(c[j]<=90))sum=sum+(c[j]-55)*f(a,i-j-1);
else if((c[j]>=97)&&(c[j]<=122))sum=sum+(c[j]-87)*f(a,i-j-1);
}
e=sum;
for(i=0;e>=b;i++)
{
d[i]=e%b;
e=e/b;
if((d[i]>=0)&&(d[i]<=9))d[i]=d[i]+48;
else if((d[i]>=10)&&(d[i]<=35))d[i]=d[i]+55;
}
if((e>=0)&&(e<=9))d[i]=e+48;
else if((e>=10)&&(e<=35))d[i]=e+55;
for(k=i;k>=0;k--)printf("%c",d[k]);
}
int f(int m,int n)
{
int i,z=1;
for(i=1;i<=n;i++)
z=z*m;
return(z);
}
| 55 |
27,153 | int main()
{
char x[100];
int y[100];
int i, n, m, sum = 0, j = 0;
cin >> n >> x >> m;
for (i = strlen(x) - 1; i >= 0; i --)
{
if (x[i] <= '9')
sum = sum + (x[i] - '0') * pow(1.0 * n, 1.0 * strlen(x) - i - 1);
else if (x[i] >= 'A' && x[i] <= 'Z')
sum = sum + (x[i] - 'A' + 10) * pow(1.0 * n, 1.0 * strlen(x) - i - 1);
else
sum = sum + (x[i] - 'a' + 10) * pow(1.0 * n, 1.0 * strlen(x) - i - 1);
}
if (sum == 0)
cout << 0 << endl;
while (sum != 0)
{
y[j ++] = sum % m;
sum = sum / m;
}
for (i = j - 1; i >= 0; i --)
{
if (y[i] <= 9)
cout << y[i];
else
cout << (char) (y[i] - 10 + 'A');
}
cout << endl;
return 0;
}
| 55 |
27,154 | int main()
{
long double a,length;
//ab????n?????????????i?????
char s[256],s1[256];
long int m,i,b,n=0,w,j;
//w?????,j?????????
cin>>a>>s>>b;
length=strlen(s);
for(i=0;i<length;i++)
{
m=s[i];
if(((m<=57)&&(m>=48))==1) m=m-48;
if(((m<=122)&&(m>=97))==1) m=m-87;
if(((m<=90)&&(m>=65))==1) m=m-55;
n=n+m*pow(a,length-i-1);
}
for(i=0;i<=256;i++)
{
w=abs(n/b);
if((n-(w*b))<=9) s1[i]=(n-(w*b))+48;
//????????
else s1[i]=(n-(w*b))+55;
n=w;
if(w==0)
{
j=i;break;
}
//????
}
for(i=j;i>=0;i--)
//????
cout<<s1[i];
return 0;
}
| 55 |
27,155 | main()
{
int a,n,b,c[60],d[60],i=0,j=0,x,y,z,sum1=0,sum2=0;
scanf("%d ",&a);//*??a*//
while((n=getchar())!=' ')//*??n*//
{
i++;
c[i]=n;
}
x=i;
scanf("%d",&b);//*??b*//
for(i=1;i<=x;i++) //* n??????????? *//
{
for(y='A';y<='Z';y++)
if(c[i]==y)
{
c[i]=c[i]-7;
break;
}
for(y='a';y<='z';y++)
if(c[i]==y)
c[i]=c[i]-39;
}
for(i=1;i<=x;i++)
c[i]=c[i]-48;
for(i=1;i<=x;i++) //* a??n???10?? *//
{
sum1=sum1+c[i]*pow(a,x-i);
}
if(sum1==0)
printf("0");
while(sum1!=0) //* 10??n???b??*//
{
j++;
d[j]=sum1%b;
sum1=sum1/b;
}
z=j;
for(j=z;j>=1;j--) //*?????????*//
{
if(d[j]>=10)
printf("%c",d[j]+55);
else
printf("%d",d[j]);
}
printf("\n");
}
| 55 |
27,156 |
int main()
{
int a,b,num10=0;
char pre[200];
cin>>a;
cin>>pre;
cin>>b;
for(int 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 aft[120];
int k=0;
do
{
if(num10%b<=9)
{
aft[k]=num10%b+'0';
}
else aft[k]=num10%b+'A'-10;
num10/=b;
k++;
}
while(num10!=0);
while(k>=1)
{
cout<<(char)aft[k-1];
k--;
}
return 0;
}
| 55 |
27,157 |
long pow(int a,int b)
{
long c;
if(b==0)
c=1;
if(b>0)
c=pow(a,b-1)*a;
return c;
}
int main()
{
int a,b,i,j;
char form[1000],late[1000];
long ten=0;
cin>>a;
cin>>form;
cin>>b;
for(i=0;i<strlen(form);i++)
if(form[i]>=97&&form[i]<=122)
form[i]-=32;
for(i=strlen(form)-1,j=0;i>=0;i--,j++)
{
if(form[i]>=48&&form[i]<=57)
{
form[i]-=48;
ten+=form[i]*pow(a,j);
}
if(form[i]>=65&&form[i]<=90)
{
form[i]-=55;
ten+=form[i]*pow(a,j);
}
}
if(ten==0)
{
cout<<ten<<endl;
return 0;
}
for(i=0;i<=1000;i++)
{
if(ten%b<10)
late[i]=ten%b+48;
if(ten%b>=10)
late[i]=ten%b+55;
if(ten/b==0&&ten%b==0)
late[i]='\0';
ten=ten/b;
}
for(i=strlen(late)-1;i>=0;i--)
{
if(i!=0)
cout<<late[i];
else cout<<late[i]<<endl;
}
return 0;
}
| 55 |
27,158 |
int main()
{
char str[50],dest[50]={'\0'},trans[36];//??????????????
//trans[36]:???0~35???'0'~'9','A'~'Z'????
int a,b,i,d,len;
long num=0; //long??4???????????????31?
for(i=0;i<10;i++)
trans[i]='0'+i;
for(i=10;i<36;i++)
trans[i]='A'+i-10;
cin>>a>>str>>b;
for(i=0;str[i]!='\0';i++){ //?????a???????????
if(str[i]>='0' && str[i]<='9')
d=str[i]-'0';
else if(str[i]>='a' && str[i]<='z')
d=str[i]-'a'+10;
else if(str[i]>='A' && str[i]<='Z')
d=str[i]-'A'+10;
num=num*a+d;
} //????????????num
i=0;
do{ //???b?????????dest???
dest[i++]=trans[num%b]; //???num==0???
num=num/b;
}while(num!=0);
len=strlen(dest); //????????????dest????
for(i=len-1;i>=0;i--) //????
cout<<dest[i];
return 0;
}
| 55 |
27,159 | long fun(int a,int n)
{
long z;
if (n==0)
z=1;
else
z=a*fun(a,n-1);
return z;
}
int main()
{
int a,b,n,i,j;
long sum=0;
char line[100],huan[100];
scanf("%d",&a);
scanf("%s",line);
scanf("%d",&b);
n=strlen(line);
for (i=n-1;i>=0;i--)
{
if (line[i]>='0' && line[i]<='9')
sum+=(line[i]-'0')*fun(a,n-1-i);
if (line[i]>='A' && line[i]<='Z')
sum+=(line[i]-'A'+10)*fun(a,n-1-i);
if (line[i]>='a' && line[i]<='z')
sum+=(line[i]-'a'+10)*fun(a,n-1-i);
}
i=0;
if ((sum%b+'0')>='0' && (sum%b+'0')<='9')
huan[0]=sum%b+'0';
else if ((sum%b+'0'+7)>='A' && (sum%b+'0'+7)<='Z')
huan[0]=sum%b+'0'+7;
while ((sum/b)!=0)
{
i++;
sum=sum/b;
if ((sum%b+'0')>='0' && (sum%b+'0')<='9')
huan[i]=sum%b+'0';
else if ((sum%b+'0'+7)>='A' && (sum%b+'0'+7)<='Z')
huan[i]=sum%b+'0'+7;
}
for (j=i;j>=0;j--)
printf("%c",huan[j]);
return 0;
}
| 55 |
27,160 | int main(){
int n,i,k,a,b,y,w=0;
char s1[100]={'\0'},s2[100]={'\0'},e;
scanf("%d%s%d",&a,s1,&b);
for(i=0;s1[i];i++){
if(s1[i]<='Z'&&s1[i]>='A'){
s1[i]=s1[i]-'A'+'a';
}
}
for(i=0;s1[i];i++){
if(s1[i]<='z'&&s1[i]>='a'){
w=w*a+s1[i]-'a'+10;
}else{
w=w*a+s1[i]-'0';
}
}
// printf("%d\n",w);
for(i=0;1;i++){
y=w%b;
if(y<=9&&y>=0){
s2[i]=y+'0';
}else{
s2[i]=y-10+'A';
}
w=w/b;
if(w==0){
break;
}
}
w=strlen(s2);
for(i=0;i<w-i;i++){
e=s2[i];
s2[i]=s2[w-i-1];
s2[w-i-1]=e;
}
printf("%s",s2);
// scanf("%d",&n);
return 0;
}
| 55 |
27,161 | //*******************************************
//????5.cpp
//????a??????b??
//?????
//*******************************************
int main()
{
int m,i,dec=0; //????
double temp=0,b,a;
char num[32]; //???????
int p[32],q[32]; //????
cin>>a>>num>>b; //????
m=strlen(num); //??num???
for(i=0;i<m;i++)
{
p[i]=num[i]; //??????????????
if(p[i]<58) //??????????
p[i]=p[i]-48;
else if(p[i]<91)
p[i]=p[i]-55;
else if(p[i]<123)
p[i]=p[i]-87;
}
for(i=0;i<m;i++) //for?????????
{
dec+=p[i]*pow(a,m-1-i);
}
if(dec==0)
cout<<"0"; //??????0?????
else
{
for(i=0;i<32;i++) //????b???????
{
temp=pow(b,i);
if(temp>dec)
{
m=i;
break;
}
}
q[0]=dec/pow(b,m-1); //??b???
for(i=1;i<m;i++)
{
q[i]=(dec-q[i-1]*pow(b,m-i))/pow(b,m-1-i);
dec=dec-q[i-1]*pow(b,m-i);
}
for(i=0;i<m;i++) //????????????
{
if(q[i]<10)
q[i]=q[i]+48;
else q[i]=q[i]+55;
}
for(i=0;i<m;i++)
num[i]=q[i]; //?????????
num[m]='\0';
cout<<num;
}
return 0;
} | 55 |
27,162 |
int main()
{
int i,l,a,b,c[100],d,A=0;
char s[100];
scanf("%d %s %d",&a,s,&b);
l=strlen(s);
for(i=0;i<l;i++)
{
if(s[l-i-1]>='0'&&s[l-i-1]<='9')
c[i]=s[l-i-1]-'0';
if(s[l-i-1]>='a'&&s[l-i-1]<='z')
c[i]=s[l-i-1]-'a'+10;
if(s[l-i-1]>='A'&&s[l-i-1]<='Z')
c[i]=s[l-i-1]-'A'+10;
A=(double)A+(double)c[i]*pow((double)a,(double)i);
}
for(i=0;;i++)
{
d=A%b;
if(d<=9)
s[i]=d+'0';
else
s[i]=d-10+'A';
A=A/b;
if(A==0)
break;
}
for(;i>=0;i--)
{
printf("%c",s[i]);
}
return 0;
}
| 55 |
27,163 | //????a?
int nta(long a)
{
if(a>=10)
{
char b;
b=(char)('A'-10+a);
return ((char) (b));
}
else
{
char b;
b=(char)('1'-1+a);
return ((char) (b));
}
}
//a????
int atn(char i)
{
long j=i;
if(j>96)
{
j=j-'a'+10;
}
else
{ if ((j>33)&&(j<58))
{
j=j-'1'+1;
}
else
{
j=j-'A'+10;
}
}
return((long)(j));
}
//???????
int ten(long k)
{
long l,m;
l=k;
for (int n = 0; n < 69; n++)
{
l=l/10;
if (l>0)
{
m=n+1;
}
}
return (m);
}
//??e??
int loe(long t,long v)
{
long u,w=0;
u=t;
for (int x = 0; x < 69; x++)
{
u=u/v;
if (u>0)
{
w=x+1;
}
}
return (w);
}
//??????
int lth(char o[])
{
long f=0;
for (int g = 0; g <69 ; g++)
{
if((o[g]!=0)&&(o[g]!=32))f=f+1;
}
return ((f));
}
int main()
{
long d,e;
char h[70];
memset(h,0,sizeof(h));
cin>>d>>h>>e;
long p;
p=lth(h);
long s=0;
for (int q = 0; q < p; q++)
{
s=s*d+(atn(h[q]));
}
long y;
y=(loe(s,e));
char aa[70];
memset(aa,0,sizeof(aa));
long ab=s,ac=0;
for (int z = 0; z < y+1; z++)
{
ac=ab;
ab=ab/e;
if (ab>0)
{
aa[z]=nta(ac%e);
}
else
{
aa[z]=nta(ac);
}
}
if(aa[y]!=0)
{
for (int ad = 0; ad < y+1; ad++)
{
cout<<aa[y-ad];
}
}
else cout<<"0";
return 0;
} | 55 |
27,164 | main()
{
char a[100],b[100];
int i,j,n,k,l=0;
long c=0;
scanf("%d %s %d",&i,a,&j);
n=strlen(a);
for(k=0;k<n;k++)
{
if(a[k]>='A'&&a[k]<='Z')
a[k]=a[k]-'A'+10;
else if(a[k]>='a'&&a[k]<='z')
a[k]=a[k]-'a'+10;
else
a[k]=a[k]-'1'+1;
}
for(k=0;k<n;k++)
c=c*i+a[k];
for(k=0;;k++)
{
b[k]=c%j;
if(b[k]>=10)
b[k]=b[k]-10+'A';
else
b[k]=b[k]+'1'-1;
c=c/j;
l=l++;
if(c==0)
break;
}
for(k=0;k<l;k++)
printf("%c",b[l-k-1]);
}
| 55 |
27,165 | int main()
{
int a,b,i=0,j=0,s=0,temp; //????a?b?????i?j?????temp
char str1[32],str2[32]; //?????str1,str2
cin>>a>>str1>>b; //?????a,str1,b
do
i++;
while(str1[i]!='\0'); //?????str1???
for(int k=0;k<i;k++)
{
if(str1[k]>96)
str1[k]-='a'-10;
else if(str1[k]>64)
str1[k]-='A'-10;
else
str1[k]-='0'; //??????????????????
s+=str1[k]*(int)pow((double)a,i-1-k); //??str1?????
}
do
j++;
while(s>pow((double)b,j)); //????????
for(int l=0;l<j;l++)
{
temp=s/pow((double)b,j-l-1);
if (temp<10)
str2[l]=temp+'0';
else
str2[l]=temp-10+'A';
s-=temp*pow((double)b,j-l-1);
} //?????????????
str2[j]='\0'; //?str2????????\0????????
cout<<str2; //????
return 0;
} | 55 |
27,166 | //itc online test nov 15
main() {
char s[100];
int a,b;
scanf("%d %s %d",&a,&s,&b);
int slen=strlen(s);
long indec=0;
long tempdec;
int i,j;
for (i=0;i<=slen-1;i++) {
if (s[i]>=48&&s[i]<=57) {
s[i]=s[i]-48;
} else if (s[i]>=65&&s[i]<=90) {
s[i]=s[i]-55;
} else {
s[i]=s[i]-87;
}
tempdec=1;
for (j=1;j<=slen-i-1;j++) {
tempdec=tempdec*a;
}
indec=indec+tempdec*s[i];
}
char res[100];
int temp;
int point=0;
while (indec>=b) {
temp=indec%b;
indec=indec/b;
if (temp<10) {
res[point]=temp+48;
} else {
res[point]=temp+55;
}
point++;
}
if (indec<10) {
res[point]=indec+48;
} else {
res[point]=indec+55;
}
for (i=point;i>=0;i--) {
printf("%c",res[i]);
}
scanf("%d",&i);
}
| 55 |
27,167 | int main ()
{
int a,b,l;
char n[50],d[50],m[50];
scanf ("%d %s %d",&a,n,&b);
if (n[0]=='0')
printf ("0\n");
else
{
l=strlen(n);
int x=0;
int j=0;
for (int i=0;i<l;i++)
{
if (n[i]>='a' && n[i]<='z' )
n[i]=n[i]-'a'+10;
else if (n[i]>='A' && n[i]<='Z')
n[i]=n[i]-'A'+10;
else if (n[i]>='0' && n[i]<='9')
n[i]=n[i]-'0';
x=x*a+n[i];
}
for (;x!=0;j++)
{
d[j]=x%b;
x=x/b;
}
d[j]='\0';
for (int y=0;y<j;y++)
{
m[y]=d[j-y-1];
}
m[j]='\0';
for (int z=0;z<j;z++)
{
if (m[z]<=9)
m[z]=m[z]+'0';
else
m[z]=m[z]+'A'-10;
}
printf ("%s",m);
getchar();
getchar();
}
}
| 55 |
27,168 | int main()
{ int m,n,k,i,t=0,j=1,t1;
char a[20],b[20],c[20];
scanf("%d",&m);
scanf("%s",a);
scanf("%d",&n);
k=strlen(a);
for(i=k-1;i>=0;i--)
{ if(a[i]>=48&&a[i]<=57) t=t+(a[i]-48)*j;
else if(a[i]>=65&&a[i]<=90) t=t+(a[i]-55)*j;
else if(a[i]>=97&&a[i]<=122) t=t+(a[i]-87)*j;
j=j*m;
}
if(t==0) printf("%d",t);
else {i=0;
while(t>0)
{ t1=t%n;
t=t/n;
if(t1<=9) b[i]=t1+48;
else b[i]=t1+55;
i++;
}
for(j=0;j<i;j++)
{ c[j]=b[i-1-j];
printf("%c",c[j]);}}
printf("\n");
scanf("%d",&m);
}
| 55 |
27,169 | char ch(char a)
{
char c;
if(a>='A'&&a<='Z')c='A'-10;
else if(a>='a'&&a<='z')c='a'-10;
else c='0';
return c;
}
void main()
{
int a,b,i,j;
long sum=0;
char n[32]="\0",m[32]="\0",c;
scanf("%d ",&a);
for(i=0;i<32;i++){scanf("%c",&n[i]);if(n[i]==' ')break;}
scanf("%d",&b);
for(j=0;j<i;j++)sum=sum*a+n[j]-ch(n[j]);
for(j=0;j<32;j++){c='0';if(sum%b>9)c='A'-10;m[j]=sum%b+c;sum=sum/b;if(sum==0)break;}
for(i=0;i<=j;i++)printf("%c",m[j-i]);
} | 55 |
27,170 | /*
* ???: 1000010191_30_6.cpp
* ??: ???
* ????: 2010-11-5
* ??: ????
*/
int main()
{
int a,b;
char n[100];
cin>>a>>n>>b;
//?????
int t=0;
for (int i=0;n[i];i++)
{
if (n[i]>='0'&&n[i]<='9')
t=t*a+n[i]-'0';
if (n[i]>='a'&&n[i]<='z')
t=t*a+n[i]-'a'+10;
if (n[i]>='A'&&n[i]<='Z')
t=t*a+n[i]-'A'+10;
}
//??b??
int len=0;
char r[100];
while (t!=0)
{
int temp=t%b;
if (temp<10)
r[len]='0'+temp;
else
r[len]='A'+temp-10;
len++;
t=t/b;
}
for (int i=len-1;i>=0;i--)
cout<<r[i];
if (len==0) cout<<0<<endl; //??0???
cout<<endl;
return 0;
}
| 55 |
27,171 | void main()
{
int a,b,l,i,t,j;
long s=0;
char str1[100],str2[100];
scanf("%d%s%d",&a,str1,&b);
l=strlen(str1);
for(i=0;i<l;i++)
{if(str1[i]>96) str1[i]=str1[i]-32;}
for(i=0;i<l;i++)
{if(str1[i]>64) s=s*a+(str1[i]-55);
else s=s*a+(str1[i]-48);
}
if(s==0) printf("0");
else{
for(i=0;s>0;i++)
{t=s%b;
s=s/b;
if(t>9) str2[i]=t+55;
else str2[i]=t+48;
}
for(j=1;j<=i;j++)
{printf("%c",str2[i-j]);}
}
} | 55 |
27,172 | int main()
{
double a, b;
int s = 0, i, l, j;
int c[100];
char n[100];
cin >> a >> n >> b;
l = strlen(n);
for (i = l - 1; i >= 0; i --)
{
if (n[i] >= 48 && n[i] <= 57)
{
s = s + (n[i] - '0') * pow(a,(double)(l - i - 1));
}
if (n[i] >= 65 && n[i] <= 90)
{
s = s + (n[i] - 55) * pow(a,(double)(l - i - 1));
}
if (n[i] >= 97 && n[i] <= 122)
{
s = s + (n[i] - 87) * pow(a,(double)(l - i - 1));
}
}
if (s == 0)
{
cout << 0 << endl;
return 0;
}
if (b <= 10)
{
for (i = 0; ;i ++)
{
c[i] = s % (int)b;
s = s / (int)b;
if (s < b)
{
c[i + 1] = s;
break;
}
}
for (j = i + 1; j >= 0; j --)
{
cout << c[j];
}
}
else
{
memset(n, 0, sizeof(n));
for (i = 0; ;i ++)
{
if ((s % (int)b) > 9)
{
n[i] = (char)(s % (int)b + 55);
}
else
{
n[i] = (char)(s % (int)b + '0');
}
s = s / (int)b;
if (s < b)
{
if (s > 9)
{
n[++ i] = (char)(s + 55);
}
else
{
n[++ i] = (char)(s + '0');
}
break;
}
}
for (j = i; j >= 0; j --)
{
cout << n[j];
}
}
cout << endl;
return 0;
} | 55 |
27,173 | void main()
{
int a,b,len,i,nn[100],c,k=0;
long m=0;
char n[100],nnn[100];
scanf("%d%s%d",&a,n,&b);
len=strlen(n);
for(i=0;i<len;i++)
{
if(n[i]>='A' && n[i]<='Z')
nn[i]=n[i]-'A'+10;
else if(n[i]>='a' && n[i]<='z')
nn[i]=n[i]-'a'+10;
else if(n[i]>='0' && n[i]<='9')
nn[i]=n[i]-'0';
m=m*a+nn[i];
}
i=0;
while(m!=0)
{
nnn[i]=m%b;
m=m/b;
i++;
}
c=i-1;
for(i=c;i>=0;i--)
{
if(nnn[i]==0)
k++;
}
if(k==c+1)
{
printf("0");
}
else
{
for(i=c;i>=0;i--)
{
if(nnn[i]>=0 && nnn[i]<=9)
printf("%d",nnn[i]);
else if(nnn[i]>=10)
{
nnn[i]=nnn[i]-10+'A';
printf("%c",nnn[i]);
}
}
}
printf("\n");
}
| 55 |
27,174 |
int main()
{
char n[100],t[100];
int a,b,s[100],i,j,m;
long num=0;
scanf("%d%s%d",&a,n,&b);
m=strlen(n);
for(i=0;i<m;i++)
if(n[i]>='0'&&n[i]<='9')
num=num*a+n[i]-'0';
else if(n[i]>='a'&&n[i]<='z')
num=num*a+n[i]-'a'+10;
else if(n[i]>='A'&&n[i]<='Z')
num=num*a+n[i]-'A'+10;
for(i=0;num>=b;i++)
{
s[i]=num%b;
num=num/b;
}s[i]=num%b;
j=i;
for(i=0;i<=j;i++)
{
if(s[i]>=10)
t[i]=s[i]-10+'A';
else
t[i]=s[i]+'0';
}
for(i=j;i>=0;i--)
printf("%c",t[i]);
printf("\n");
return 0;
} | 55 |
27,175 | int main()
{
long int a,b,sum,d;
int i=0,j;
char n[20],e[20]={0};
scanf("%d%s%d",&a,n,&b);
for(i=0,sum=0;n[i]!='\0';i++)
{
if(n[i]>='0'&&n[i]<='9')
d=n[i]-'0';
else
if(n[i]>='a'&&n[i]<='z')
d=n[i]-'a'+10;
else
if(n[i]>='A'&&n[i]<='Z')
d=n[i]-'A'+10;
sum=sum*a+d;
}
for(i=0;sum>=b;i++)
{
d=(sum%b);
if(d<=9)
e[i]=d+'0';
else
if(d>9)
e[i]=d-10+'A';
sum=(sum-d)/b;
}
if(sum<=9)
e[i]=sum+'0';
else
if(sum>9)
e[i]=sum-10+'A';
for(j=i;j>=0;j--)
printf("%c",e[j]);
return 0;
} | 55 |
27,176 |
int main()
{
int a,b,l,decimal=0;
char c[40];
int i;
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';
}
int d[40];
for(i=0;i<l;i++)
{
if(c[i]>='a') c[i]=c[i]+10-'a';
else c[i]=c[i]-'0';
d[i]=1;
for(int j=0;j<l-i-1;j++)
{
d[i]=d[i]*a;
}
decimal=decimal+d[i]*c[i];
}
char e[40];
int k,y;
for(k=0;decimal!=0;k++)
{
e[k]=decimal%b;
decimal=decimal/b;
}
e[k]='\0';
char f[40];
for (y=0;y<k;y++)
{
if(e[y]<10)
f[k-1-y]=e[y]+'0';
else
f[k-1-y]=e[y]-10+'A';
}
f[k]='\0';
printf("%s",f);
}
getchar();
getchar();
getchar();
}
| 55 |
27,177 | int main()
{
int f(char x);
char x[100],z[100],w;
int y[100];
int a,b,c,d,j,k,sum=0,i,t=0;
scanf("%d",&a);
scanf("%s",x);
scanf("%d",&b);
c=strlen(x);
for(i=c-1;i>=0;i--)
{
y[i]=f(x[i]);
sum+=(int)(y[i]*pow(a,c-i-1));
}
if(sum==0)
printf("0");
else
{
for(i=1;i<=1000;i++)
{
if(sum<pow(b,i))
{
d=i-1;
break;
}
}
for(j=d;j>=0;j--)
{
for(k=1;k<=b;k++)
{
if(sum>=k*pow(b,j))
continue;
else
{
if(k<11)
w=k+47;
else
w=k+54;
z[t]=w;
sum-=(int)((k-1)*pow(b,j));
t=t+1;
break;
}
}
}
for(i=0;i<t;i++)
{
printf("%c",z[i]);
}
printf("\n");
}
return 0;
}
int f(char x)
{
if(islower(x))
return x-87;
else
if(isupper(x))
return x-55;
else
return x-48;
}
| 55 |
27,178 | int main()
{
int i; //??
char chnum[20]; //????
int num[20],resnum[20]; //num??????????? resnum ????
int n;
long sum=0; //n????? sum?????????
int a,b; //a?? b??
//???? ?????
cin>>a>>chnum>>b;
n=strlen(chnum);
for(i=0;i<20;i++)
{
if(chnum[i]=='a'){num[i]=10;continue;} if(chnum[i]=='A'){num[i]=10;continue;}
if(chnum[i]=='b'){num[i]=11;continue;} if(chnum[i]=='B'){num[i]=11;continue;}
if(chnum[i]=='c'){num[i]=12;continue;} if(chnum[i]=='C'){num[i]=12;continue;}
if(chnum[i]=='d'){num[i]=13;continue;} if(chnum[i]=='D'){num[i]=13;continue;}
if(chnum[i]=='e'){num[i]=14;continue;} if(chnum[i]=='E'){num[i]=14;continue;}
if(chnum[i]=='f'){num[i]=15;continue;} if(chnum[i]=='F'){num[i]=15;continue;}
if(chnum[i]=='g'){num[i]=16;continue;} if(chnum[i]=='G'){num[i]=16;continue;}
if(chnum[i]=='h'){num[i]=17;continue;} if(chnum[i]=='H'){num[i]=17;continue;}
if(chnum[i]=='i'){num[i]=18;continue;} if(chnum[i]=='I'){num[i]=18;continue;}
if(chnum[i]=='j'){num[i]=19;continue;} if(chnum[i]=='J'){num[i]=19;continue;}
if(chnum[i]=='k'){num[i]=20;continue;} if(chnum[i]=='K'){num[i]=20;continue;}
if(chnum[i]=='l'){num[i]=21;continue;} if(chnum[i]=='L'){num[i]=21;continue;}
if(chnum[i]=='m'){num[i]=22;continue;} if(chnum[i]=='M'){num[i]=22;continue;}
if(chnum[i]=='n'){num[i]=23;continue;} if(chnum[i]=='N'){num[i]=23;continue;}
if(chnum[i]=='o'){num[i]=24;continue;} if(chnum[i]=='O'){num[i]=24;continue;}
if(chnum[i]=='p'){num[i]=25;continue;} if(chnum[i]=='P'){num[i]=25;continue;}
if(chnum[i]=='q'){num[i]=26;continue;} if(chnum[i]=='Q'){num[i]=26;continue;}
if(chnum[i]=='r'){num[i]=27;continue;} if(chnum[i]=='R'){num[i]=27;continue;}
if(chnum[i]=='s'){num[i]=28;continue;} if(chnum[i]=='S'){num[i]=28;continue;}
if(chnum[i]=='t'){num[i]=29;continue;} if(chnum[i]=='T'){num[i]=30;continue;}
if(chnum[i]=='v'){num[i]=31;continue;} if(chnum[i]=='V'){num[i]=31;continue;}
if(chnum[i]=='w'){num[i]=32;continue;} if(chnum[i]=='W'){num[i]=32;continue;}
if(chnum[i]=='x'){num[i]=33;continue;} if(chnum[i]=='X'){num[i]=33;continue;}
if(chnum[i]=='y'){num[i]=34;continue;} if(chnum[i]=='Y'){num[i]=34;continue;}
if(chnum[i]=='z'){num[i]=35;continue;} if(chnum[i]=='Z'){num[i]=35;continue;}
num[i]=(int)chnum[i]-48;
}
//???? ???? ????????????
for(i=0;i<n;i++)
sum+=num[i]*pow((double)a,(double)(n-i-1));
//???? ??????????
i=19;
while(sum>=b)
{resnum[i]=sum%b;
sum=sum/b;
i--;
};
resnum[i]=sum;
//???? ????????b????
for(;i<20;i++)
{if(resnum[i]==10){cout<<"A";continue;}
if(resnum[i]==11){cout<<"B";continue;}
if(resnum[i]==12){cout<<"C";continue;}
if(resnum[i]==13){cout<<"D";continue;}
if(resnum[i]==14){cout<<"E";continue;}
if(resnum[i]==15){cout<<"F";continue;}
if(resnum[i]==16){cout<<"G";continue;}
if(resnum[i]==17){cout<<"H";continue;}
if(resnum[i]==18){cout<<"I";continue;}
if(resnum[i]==19){cout<<"J";continue;}
if(resnum[i]==20){cout<<"K";continue;}
if(resnum[i]==21){cout<<"L";continue;}
if(resnum[i]==22){cout<<"M";continue;}
if(resnum[i]==23){cout<<"N";continue;}
if(resnum[i]==24){cout<<"O";continue;}
if(resnum[i]==25){cout<<"P";continue;}
if(resnum[i]==26){cout<<"Q";continue;}
if(resnum[i]==27){cout<<"R";continue;}
if(resnum[i]==28){cout<<"S";continue;}
if(resnum[i]==29){cout<<"T";continue;}
if(resnum[i]==30){cout<<"U";continue;}
if(resnum[i]==31){cout<<"V";continue;}
if(resnum[i]==32){cout<<"W";continue;}
if(resnum[i]==33){cout<<"X";continue;}
if(resnum[i]==34){cout<<"Y";continue;}
if(resnum[i]==35){cout<<"Z";continue;}
cout<<resnum[i];}
//???? ?b??????????b????????
return 0;
}
| 55 |
27,179 | void main()
{
int a,b,i,p,len;
long int w=0;
char s[1000],s1[1000];
int zs[1000],zs1[1000];
scanf("%d %s %d",&a,s,&b);
len=strlen(s);
for(i=0;i<len;i++)
{
if(s[i]>=48&&s[i]<=57)
zs[i]=s[i]-48;
else if(s[i]<=90&&s[i]>=65)
zs[i]=s[i]-55;
else if(s[i]<=122&&s[i]>=97)
zs[i]=s[i]-87;
w=w*a+zs[i];
}
for(i=0;i<1000;i++)
{
p=i;
zs1[i]=w%b;
w=w/b;
if(w==0)
break;
}
for(i=0;i<=p;i++)
{
if(zs1[i]>=0&&zs1[i]<=9)
s1[i]=zs1[i]+48;
else if(zs1[i]>=10)
s1[i]=zs1[i]+55;
else break;
}
for(i=p;i>=0;i--)
printf("%c",s1[i]);
}
| 55 |
27,180 | void main()
{
int from,to;
char num[33],result[33]={0};
long dec=0;
int i,j;
scanf("%d%s%d",&from,num,&to);
if (num[0]=='0') printf("0");
else
{
//??10??
for(i=0;i<strlen(num);i++)
{
dec*=from;
if (num[i]>='0' && num[i]<='9')
dec=dec+num[i]-'0';
else if (num[i]>='A' && num[i]<='Z')
dec=dec+num[i]-'A'+10;
else if (num[i]>='a' && num[i]<='z')
dec=dec+num[i]-'a'+10;
}
//??????
if (to==10)
printf("%d",dec);
else
{
int digit;
i=0;
while(dec!=0)
{
digit=dec%to;
if (digit>=0 && digit<=9)
result[i]=digit+'0';
else
result[i]=digit-10 +'A';
i++;
dec=(dec-digit)/to;
}
//????
for(j=strlen(result)-1;j>=0;j--)
putchar(result[j]);
}
}
}
| 55 |
27,181 | main()
{
int a,b,len,i,j;
long mi,middle=0;
char str[33] ;
scanf("%d%s%d",&a,str,&b);
len=strlen(str);
for(i=0;i<len;++i)
if(str[i]>=97&&str[i]<=122)
str[i]-=32;
for(i=0;i<len;++i)
{
if(str[i]>=65&&str[i]<=90)
str[i]-=55;
else str[i]-=48;
mi=1;
for(j=1;j<len-i;++j)
mi*=a;
middle=middle+str[i]*mi;
}
i=0;
while(middle>=b)
{
str[i]=middle%b;
middle=(middle-str[i])/b;
i++;
}
str[i]=middle;
for(j=0;j<=i;++j)
{
if(str[i-j]>9)
{
str[i-j]=str[i-j]-9+64;
printf("%c",str[i-j]);
}
else printf("%d",str[i-j]);
}
} | 55 |
27,182 | int main()
{
int n,m;
int i,k,num=0;
char in[255],out[255]="0";
char a2[128];
char a[]="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
for(i=0;i<='9';i++)
a2[i]=i-'0';
for(i='a';i<='z';i++)
a2[i]=i-'a'+10;
for(i='A';i<='Z';i++)
a2[i]=i-'A'+10;
scanf("%d%s%d",&n,in,&m);
for(i=0;in[i]!='\0';i++)
num=num*n+a2[in[i]];
if(num==0)
k=1;
else k=0;
while(num>0)
{
out[k]=a[num%m];
k++;
num=num/m;
}
for(i=k-1;i>=0;i--)
printf("%c",out[i]);
printf("\n");
return 0;
}
| 55 |
27,183 |
main(){
char str[10000], m[10000];
long a, b, i, j, n[10000], sum=0;
scanf("%d %s %d", &a, str, &b);
for(i=0; i<strlen(str); i++){
if(str[i]<='z' && str[i]>='a') str[i]-=32;
else str[i]+=0;
}
for(i=0; i<strlen(str); i++){
if('0'<=str[i] && str[i]<='9') str[i]-=48;
else str[i]-=55;
n[i]=str[i];
}
for(i=0; i<strlen(str); i++) sum+=n[i]*pow(a, strlen(str)-i-1);
for(i=0; ;i++){
n[i]=sum%b;
sum/=b;
if(sum==0) break;
else continue;
}
for(j=0; j<=i; j++){
if(n[j]<10) m[j]=n[j]+48;
else m[j]=n[j]+55;
}
for(j=i; j>=0; j--) printf("%c", m[j]);
} | 55 |
27,184 | int main ()
{
char string1[1000],string2[1000];
int b,c=0,i,j=0,temp;
float a,d;
cin>>a>>string1>>d;
b=strlen(string1);
for(i=0;i<b;i++)
{
if(string1[i]>='0'&&string1[i]<='9')
c+=(string1[i]-48)*pow(a,b-i-1);
if(string1[i]>='a'&&string1[i]<='z')
c+=(string1[i]-87)*pow(a,b-i-1);
if(string1[i]>='A'&&string1[i]<='Z')
c+=(string1[i]-55)*pow(a,b-i-1);
}
int index = 0;
int e;
if(c==0)
cout<<'0'<<endl;
while(c!=0)
{
e=c%(int)d;
c=c/d;
if(e>=10)
string2[index]='A'+e-10;
else
string2[index] ='0'+e;
index++;
}
for(i=index-1;i>=0;i--)
cout<<string2[i];
cout<<endl;
return 0;
} | 55 |
27,185 |
int main()
{
int a, b, n1[300]={0}, i=0, j=0, k=0, number, n3[300]={0};
long n2=0;
char n[300]={0}, n_[300]={0};
scanf("%d%s%d", &a, n, &b);
// printf("%d %s %d", a, n, b);
number=strlen(n);
// printf("%d", number);
for(i=0;i<number;i++)
{
if(n[i]>=48 && n[i]<=57)
n1[i]=n[i]-48;
else if(n[i]>=65 &&n[i]<=90)
n1[i]=n[i]-55;
else if(n[i]>=97 && n[i]<=122)
n1[i]=n[i]-87;
n2=n2+n1[i]*pow(a, number-i-1);
}
if(n2==0)
printf("0");
if(b==10)
printf("%d", n2);
else
{
while(n2>0)
{
n3[j]=n2%b;
n2=n2/b;
j++;
}
for(k=0;k<j;k++)
{
if(n3[j-k-1]>=0 && n3[j-k-1]<=9)
n_[k]=n3[j-k-1]+48;
else if(n3[j-k-1]>=10 && n3[j-k]<= 35)
n_[k]=n3[j-k-1]+55;
}
printf("%s\n", n_);
}
return 0;
} | 55 |
27,186 | int main()
{
double q=0;
int n=0;
cin>>q;
cin.get();
char a[201],b[201];
int c[201];
double i=0;
int j=0,e=0,f=0,number=0,l=0;
cin>>a;
cin>>n;
e=strlen(a);
for(i=0;i<=e-1;i++)
{
l=0;
if(a[(int)i]>='0'&&a[(int)i]<='9')
l=a[(int)i]-'0';
else if(a[(int)i]>='A'&&a[(int)i]<='Z')
l=a[(int)i]-'A'+10;
else if(a[(int)i]>='a'&&a[(int)i]<='z')
l=a[(int)i]-'a'+10;
number=l*pow(q,e-1-i)+number;
}
for(i=0;i<=200;i++)
{
c[(int)i]=number % n;
if(c[(int)i]>=0 && c[(int)i]<=9)
b[(int)i]=c[(int)i]+'0';
else
b[(int)i]=c[(int)i]+'A'-10;
number=number/n;
if(number==0)
break;
}
f=i;
for(i=f;i>=0;i--)
cout<<b[(int)i];
cout<<endl;
return 0;
} | 55 |
27,187 | main()
{
int i,a,b,len,len2,x,de=0;
char str[1025],str2[1025];
scanf("%d%s%d",&a,str,&b);
len=strlen(str);
for(i=0;i<len;i++)
{
if(str[i]>=97) x=str[i]+10-'a';
else if(str[i]>='A'&&str[i]<='Z') x=str[i]+10-'A';
else x=str[i]-'0';
de=de*a+x;
}
for(i=0;i<1025;i++)
{
if(de%b>9) str2[i]=de%b+55;
else str2[i]=de%b+48;
de=de/b;
if(de==0) {str2[i+1]='\0';break;}
}
len2=strlen(str2);
for(i=0;i<len2;i++)
{
printf("%c",str2[len2-i-1]);
}
printf("\n");
} | 55 |
27,188 | void main()
{int a,b,l,i,t=0;
char n[100],m[100];
scanf("%d %s %d",&a,n,&b);
l=strlen(n);
for(i=0;i<l;i++)
{t*=a;
if(n[i]>='0'&&n[i]<='9')
t+=n[i]-'0';
else if(n[i]>='a'&&n[i]<='z')
t+=n[i]-'a'+10;
else
t+=n[i]-'A'+10;
}
if(t!=0)
{for(i=0;t!=0;i++)
{if(t%b>=0&&t%b<=9)
m[i]=t%b+'0';
else
m[i]=t%b-10+'A';
t=(t-t%b)/b;
}
for(t=i-1;t>=0;t--)
printf("%c",m[t]);
printf("\n");
}
else
printf("0\n");
} | 55 |
27,189 | int turntonum (char c)
{
if (c>='0'&&c<='9')
return (c-'0');
if (c>='a'&&c<='z')
return (c-'a'+10);
if (c>='A'&&c<='Z')
return (c-'A'+10);
}
int main ()
{
int a,b,l;
char c[100];
long long num;
cin >>a;getchar();
cin.getline(c,80,' ');
cin >>b;
l=strlen(c);
num=turntonum(c[0]);
for (int i=1;i<l;i++)
{
int f;
num=num*a+turntonum(c[i]);
}
if (num==0)
{
cout <<"0";
return 0;
}
int d[100],l_;
l_=log(num)/log(b)+1;
for (int i=l_-1;i>=0;i--)
{
d[i]=num%b;
num=num/b;
}
for (int i=0;i<l_;i++)
{
if (d[i]<10)
cout <<d[i];
else
putchar('A'+d[i]-10);
}
return 0;
}
| 55 |
27,190 | const int size=10000; //??????
char inda[size],outda[size];
int indata[size],t,ans[2*size],lans,ddd[size];//?????????
int main() //?????
{
int i,j,inbase,outbase,la,ld;
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'+37]=i;}
for(i='0';i<='9';i++) {map[i]=i-'0';rmap[i-'0']=i;}
cin>>inbase>>inda>>outbase; //??
la=strlen(inda);lans=0;ld=0;
for(i=0;i<la;i++)
indata[i]=map[inda[i]];
while(true)
{
if(la==1&&indata[0]<outbase){ans[lans++]=indata[0];break;}
if(inda[0]=='0'){ cout<<"0";break;}
for(i=0;i<la-1;i++)//??????
{
ddd[ld++]=indata[i]/outbase;
t=indata[i]%outbase;
indata[i+1]+=t*inbase;
}
ddd[ld++]=indata[i]/outbase;//????
ans[lans++]=indata[i]%outbase;//??????????
for(i=0;i<ld;i++)//??????0
if(ddd[i]) break;
for(j=0;i<ld;i++,j++)//?????????
indata[j]=ddd[i];
la=j;ld=0;//?????
}
for(i=0;i<lans;i++)//???????????????????
outda[i]=rmap[ans[i]];
for(i=lans-1;i>=0;i--)cout<<outda[i];
return 0;
}
| 55 |
27,191 | main()
{
long a,b,i,m[100],j=0,p=0,k=0,q[100];
char n[100],w[100];
scanf("%d%s%d",&a,n,&b);
for(i=0;i<=99;i++)
{
if('A'<=n[i]&&'Z'>=n[i])m[i]=n[i]-55;
else if('a'<=n[i]&&'z'>=n[i])m[i]=n[i]-87;
else if('0'<=n[i]&&'9'>=n[i])m[i]=n[i]-48;
}
for(i=0;i<=99;i++)
{if(n[i]!='\0')j++;else break;}
for(i=0;i<=j-1;i++)
p=p+m[i]*pow(a,j-i-1);
for(i=0;i<=99;i++)
{
q[i]=p%b;
if(q[i]>=10)w[i]=q[i]+55;
else w[i]=q[i]+48;
p=p/b;
k++;
if(p==0)break;
}
for(i=1;i<=k;i++)
printf("%c",w[k-i]);
}
| 55 |
27,192 | /*
* shujuzuzhi2_6.cpp
*Name?????
* Created on: 2011-1-13
* Author: ??
*/
int main() {
int a, b, l, n = 0, i;//a?????????????b??????????l?????????????n?????????
int y[100] = { 0 };//???????????????????
char num[100] = { 0 };//??????????a????
cin >> a;//????????
cin >> num;//???????
cin >> b;//????????
l = strlen(num);//???????????????
for (i = 0; i < l; i++)//????????????????
{
if ((num[i] >= 'a') && (num[i] <= 'z'))
num[i] = num[i] - 87;
else if ((num[i] >= 'A') && (num[i] <= 'Z'))
num[i] = num[i] - 55;
else if ((num[i] >= 48) && (num[i] <= 57))
num[i] = num[i] - 48;
n = n * a + num[i]; //??????n*a+num[i]???????a??num?????????10??????n??
}
if (n == 0)
cout << 0;//????0???0
else {//?10???n???b??????y???
i = 0;
while (n != 0) {
y[i++] = n % b;
n = n / b;
}
for (i--; i >= 0; i--) //????????y??????????
{
if (y[i] > 9)
cout << (char) (y[i] + 55);
else
cout << y[i];
}
}
cout << endl;
return 0;
} | 55 |
27,193 | int main()
{
int a,b;
char s[100]={0};
scanf("%d ",&a);
int i,n=1;
scanf("%s",&s);
scanf("%d",&b);
n=strlen(s);
for(i=0;i<n;i++)
{
if(s[i]>='a' && s[i]<='z') s[i]=s[i]-32;
if(s[i]>='A' && s[i]<='Z') s[i]=s[i]-55;
if(s[i]>='0' && s[i]<='9') s[i]=s[i]-48;
}
int t=0;
for(i=0;i<n;i++)
{
t+=(int)(s[i]*pow(a,n-i-1));
}
char s2[100];
int count=0;
if(t==0) printf("0");
else
{
for(i=0;t!=0;i++)
{
s2[i]=t%b+48;
if(t%b>=10) s2[i]=t%b+55;
count++;
t=t/b;
}
for(i=count-1;i>=0;i--)
{
printf("%c",s2[i]);
}
}
return 0;
}
| 55 |
27,194 | long trans1(char *s,int n)
{
long ans=0;
int i,j,len;
len=strlen(s);
for(i=0;i<len;i++)
{
if(s[i]>='0'&&s[i]<='9')
{
j=s[i]-'0';
ans=ans+j*pow(n,len-i-1);
}
else if(s[i]>='a'&&s[i]<='z')
{
j=s[i]-'a'+10;
ans=ans+j*pow(n,len-i-1);
}
else if(s[i]>='A'&&s[i]<='Z')
{
j=s[i]-'A'+10;
ans=ans+j*pow(n,len-i-1);
}
}
return ans;
}
void trans2(char *s,int n,long m)
{
int i,r,len;
for(i=0;m!=0;i++)
{
r=m%n;
if(r>=10)
s[i]=r-10+'A';
else
s[i]=r+'0';
m=m/n;
}
s[i]='\0';
len=strlen(s);
for(i=len-1;i>=0;i--)
putchar(s[i]);
}
void main()
{
int n1,n2;
long k;
char s[5000],ans[5000];
scanf("%d%s%d",&n1,s,&n2);
if(s[0]=='0')
printf("0");
else
{
k=trans1(s,n1);
trans2(ans,n2,k);
}
} | 55 |
27,195 | long trans(int len,int a[],int b);
void main()
{
int ori,fin,len0,i,len3,j;
long ten;
char num0[100],num3[100];
int num1[100]={0},num2[100]={0};
scanf("%d%s%d",&ori,num0,&fin);
len0=strlen(num0);
for(i=0;i<len0;i++)
{
if(num0[i]>='A'&&num0[i]<='Z')
num1[i]=num0[i]-'A'+10;
else if(num0[i]>='a'&&num0[i]<='z')
num1[i]=num0[i]-'a'+10;
else
num1[i]=num0[i]-'0';
}
ten=trans(len0,num1,ori);
if(ten==0)
printf("0\n");
else
{
for(i=0;ten;i++)
{
num2[i]=ten%fin;
ten=ten/fin;
}
len3=i;
for(j=0;j<=len3;j++,i--)
{
if(num2[i-1]<=9)
num3[j]=num2[i-1]+'0';
else
num3[j]=num2[i-1]+'A'-10;
}
num3[len3]='\0';
printf("%s\n",num3);
}
}
long trans(int len,int a[],int b)
{
long x;
if(len==1)
return(a[len-1]);
else
x=a[len-1]+b*trans(len-1,a,b);
return(x);
} | 55 |
27,196 |
int main()
{
int a,b;
cin>>a;
char num[12000];
cin>>num;
cin>>b;
int ln=strlen(num);
int sum=0;
for(int i=0;i<ln-1;i++)
{
if(num[i]>='0'&&num[i]<='9')
sum=(sum+(num[i]-'0'))*a;
if(num[i]>='a'&&num[i]<='z')
sum=(sum+(num[i]-'a'+10))*a;
if(num[i]>='A'&&num[i]<='Z')
sum=(sum+(num[i]-'A'+10))*a;
}
if(num[ln-1]>='0'&&num[ln-1]<='9')
sum+=num[ln-1]-'0';
if(num[ln-1]>='a'&&num[ln-1]<='z')
sum+=num[ln-1]-'a'+10;
if(num[ln-1]>='A'&&num[ln-1]<='Z')
sum+=num[ln-1]-'A'+10;
int j=0;
char output[11000];
if (sum==0)
cout<<'0'<<endl;
else
{
while(sum!=0)
{
if(sum%b>=0&&sum%b<=9)
output[j]=sum%b+'0';
else if(sum%b>=10)
output[j]=sum%b+'A'-10;
sum=sum/b;
j++;
}
for(int i=j-1;i>=0;i--)
cout<<output[i];
}
return 0;
} | 55 |
27,197 |
long long a,b,i,len,j,h[130],t[100],m;
char s[1000],r[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()
{
cin>>a;
cin>>s;
cin>>b;
for(i='0';i<='9';i++)
h[i]=i-48;
for(i='a';i<='z';i++)
h[i]=i-87;
for(i='A';i<='Z';i++)
h[i]=i-55;
len=strlen(s);
m=0;j=1;
for (i=len-1;i>=0;i--)
{m=m+h[s[i]]*j;j=j*a;}
i=0;
while(m>0)
{
i++;
t[i]=m%b;
m=m/b;
}
if (i==0) cout << 0 << endl;
for(j=i;j>0;j--) cout<<r[t[j]];
//cin>>i;
//if(a!=20&&a!=10&&a!=35&&a!=17)cout << "sb" << endl;
return 0;
}
| 55 |
27,198 |
void MyStrupr(char *p)
{
int i = 0;
for (i = 0; i < strlen(p); i++)
{
if ((p[i] >= 'a') && (p[i] <= 'z'))
{
p[i] -= 32;
}
}
}
void main()
{
int a, b, s, i, j, k, m[100];
long int x;
char n[100], t[100];
scanf("%d%s%d",&a,n,&b);
MyStrupr(n);
s = strlen(n);
x = 0;
for(i = 0; i <= s-1; i++)
{
if((n[i] >= 'A') && (n[i]<='Z'))
{
m[i] = n[i] - 55;
}
else
{
m[i] = (int)(n[i]) - 48;
}
x = (long)(x + pow(a, (s-1-i)) * m[i]);
}
j = 0;
while(x >= b)
{
m[j] = x%b;
if(m[j] > 9)
{
t[j] = m[j] + 55;
}
else
{
t[j] = m[j] + 48;
}
x = x/b;
j++;
}
if(x > 9)
{
t[j] = x + 55;
}
else
{
t[j] = x+48;
}
for(i = 0; i <= j; i++)
{
printf("%c", t[j - i]);
}
printf("\n");
}
| 55 |
27,199 | int main()
{
char n[100],y[100];
int m[100],x[100];
int a,b,ten=0,i=0,j=0,k,l;
cin>>a>>n>>b;
l=strlen(n);
for(i=0;i<l;i++)
{
if(n[i]>='0'&&n[i]<='9')
m[i]=n[i]-48;
else if(n[i]>='A'&&n[i]<='Z')
m[i]=n[i]-55;
else if(n[i]>='a'&&n[i]<='z')
m[i]=n[i]-87;
double pow(double x,double y);
ten=ten+m[i]*(int)pow((double)a,(double)(l-1-i));
}
if(ten==0)
cout<<"0";
while(ten!=0)
{
x[j]=ten%b;
ten=ten/b;
if(x[j]>=0&&x[j]<=9)
y[j]=x[j]+48;
else if(x[j]>=10&&x[j]<=35)
y[j]=x[j]+55;
j=j+1;
}
for(k=j-1;k>=0;k--)
cout<<y[k];
cout<<endl;
return 0;
}
| 55 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.