label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
55 | 27100 | int main()
{
int m,n,c[100],d[100],i,j,p,q,t=1,s=0;
char a[100],b[100];
scanf("%d %s %d",&m,a,&n);
for(i=0;a[i]!='\0';i++)
{
if(a[i]>='0'&&a[i]<='9')
c[i]=a[i]-'0';
else if(a[i]>='a'&&a[i]<='z')
c[i]=a[i]-'a'+10;
else if(a[i]>='A'&&a[i]<='Z')
c[i]=a[i]-'A'+10;
}
p = i;
for(i=p-1;i>=0;i--)
{
s=s+t*c[i];
t=t*m;
}
if(s==0)
printf("0");
else
{
for(i=0;s!=0;i++)
{
d[i]=s%n;
s=s/n;
}
q = i;
for(i=0;i<q;i++)
{
if(d[i]>=0&&d[i]<=9)
b[i]=d[i]+'0';
else
b[i]=d[i]+'A'-10;
}
for(i=q-1;i>=0;i--)
printf("%c",b[i]);
}
printf("\n");
getchar();
getchar();
}
|
55 | 27101 | int main()
{
char n[100]=" ";
double a=0.0;
int b=0,N=0,i=0,j=0,p=0,sum=0;
cin>>a>>n>>b;
N=strlen(n);
for(i=0;i<N;i++)
{
if('A'<=n[i]&&n[i]<='Z')
n[i]=n[i]-55;
else if('a'<=n[i]&&n[i]<='z')
n[i]=n[i]-87;
else if('0'<=n[i]&&n[i]<='9')
n[i]=n[i]-48;
}
for(i=0;i<N;i++)
sum=sum+n[i]*pow(a,N-i-1);
if(sum>0)
{
for(i=0;sum>0;i++)
{
n[i]=sum%b;
sum=(sum-n[i])/b;
}
for(j=0;j<=i/2;j++)
{
p=n[j];
n[j]=n[i-j];
n[i-j]=p;
}
for(j=0;j<=i;j++)
{
if(0<=n[j]&&n[j]<=9)
n[j]=n[j]+48;
else if(n[j]>9)
n[j]=n[j]+55;
}
for(j=1;j<=i;j++)
cout<<n[j];
}
else if(sum==0)
cout<<"0"<<endl;
return 0;
}
|
55 | 27102 | 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 | 27103 | 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 | 27104 | 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 | 27105 | int main()
{
int sys2,oct=0,homo,i,j,t; //??sys1?sys2????????????
double sys1,length; //?????????,??sys1?double
char num[32]; //????????
cin>>sys1>>num>>sys2;
length=strlen(num); //????????
for(i=0;i<length;i++) //?????????????????????
num[i]=(char)toupper(num[i]);
for(i=0;i<length;i++) //???????????
{
if(num[i]>=48&&num[i]<=57)
homo=num[i]-48;
else
homo=num[i]-55;
oct=oct+homo*pow(sys1,length-i-1);
}
int change[32];
for(i=0;;i++) //????????sys2???????sys2???
{
change[i]=oct%sys2;
oct=oct/sys2;
if(oct==0)
break;
}
for(j=0;j<=i-j;j++) //???????????????????
{
t=change[j];
change[j]=change[i-j];
change[i-j]=t;
}
char ans[32];
for(j=0;j<=i;j++) //??????ASCII?
{
if(change[j]>=10)
ans[j]=change[j]+55;
else
ans[j]=change[j]+48;
cout<<ans[j]; //??????
}
cout<<endl;
return 0;
} |
55 | 27106 | /*
* ????.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 | 27107 | 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 | 27108 | int main(int argc, char* argv[])
{
int from,to,i,j;
long sum=0;
char in[255],out[255]="0";
scanf ("%d%s%d",&from,in,&to);
char s10[100],s[]="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
for (i='0';i<='9';i++)
s10[i]=i-'0';
for (i='a';i<='z';i++)
s10[i]=i-'a'+10;
for (i='A';i<='Z';i++)
s10[i]=i-'A'+10;
for (i=0;in[i]!='\0';i++)
sum=sum*from+s10[in[i]];
for (i=0;i<255;i++)
{
out[i]=s[sum%to];
sum=sum/to;
if (sum==0) break;
}
for (j=i;j>=0;j--)
printf ("%c",out[j]);
return 0;
} |
55 | 27109 | //????
//2010?11?16?
//1000012753 ???
int main()
{
char str1[200];
char stdard[36] = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9',
'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J','K', 'L', 'M', 'N',
'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'};
int i, j, l1, l2, l3, r, str2[200];
double a, b, medium = 0.0;
cin >> a >> str1 >> b;
l1 = strlen(str1);
for (i = 0; i < l1; i++)
{
if (str1[i] >= 'a' && str1[i] <= 'z')
str1[i] -= 'a' - 'A';
}
j = 0;
for (i = l1 - 1; i >= 0; i--)
str2[j++] = str1[i];
for (i = 0; i < l1; i++)
{
for (j = 0; j < 36; j++)
{
if (str2[i] == stdard[j])
medium += j * pow (a, i);
}
}
// cout << medium;
j = 0;
while ((int)medium >= (int)b)
{
str2[j++] = (int)medium % (int)b;
medium = (int)medium/(int)b;
}
str2[j] = (int)medium;
for ( ; j >= 0; j--)
cout << stdard[str2[j]];
cout << endl;
// itoa(medium, buf, (int)b);
/* l2 = strlen(buf);
r = 0;
for (i = 0; i < l2; i++)
{
r = ((r * 10) + buf[i] - '0') % (int)b;
for (j = 0; j < 36; j++)
{
if (j == r)
{
str2[i] = stdard[j];
break;
}
}
}
str2[i] = '\0';
l3 = strlen(str2);
for (i = l3 - 1; i >= 0; i--)
cout << str2[i];
cout << endl;*/
return 0;
}
|
55 | 27110 |
int turn(char num)
{
if(num>='0'&&num<='9') return num-48;
if(num>='a'&&num<='z') return num-87;
if(num>='A'&&num<='Z') return num-55;
}
char turn(int num)
{
if(num>=0&&num<=9) return num+48;
if(num>=10&&num<=36) return num+55;
}
int main()
{
int a,b,i=-1,j=0,s;
long temp=0,temp1=0;
char num[8*sizeof(long)]={'\0'};
int num1[8*sizeof(long)]={0};
cin>>a;cin.get();
do
{
i++;
num[i]=cin.get();
}while(num[i]!=' ');
cin>>b;
for(;j<i;j++)
temp+=turn(num[j])*pow((double)a,i-j-1);
temp1=temp;
for(i=0;temp1>0;i++)
{
num1[i]=temp1%b;
temp1=temp1/b;
}
for(j=i-1;j>0;j--)
cout<<turn(num1[j]);
cout<<turn(num1[0]);
return 0;
}
|
55 | 27111 | int main()
{
char s[10000];
int a,b,k,d,i,j,c,n;
k=0;
scanf("%d %s %d",&a,s,&b);
for(i=strlen(s)-1;i>=0;i--)
{
if(s[i]>='a'&&s[i]<='z')
d=10+(int)(s[i]-'a');
if(s[i]>='A'&&s[i]<='Z')
d=10+(int)(s[i]-'A');
if(s[i]>='0'&&s[i]<='9')
d=(int)(s[i]-'0');
n=strlen(s)-1-i;
c=1;
for(j=0;j<n;j++)
c*=a;
k=k+d*c;
}
for(i=0;;i++)
{
if(k%b<=9)
{
c=k%b+48;
s[i]=(char)(c);
}
if(k%b>9)
{
c=k%b+55;
s[i]=(char)(c);
}
if(k/b==0)
{
break;
}
k=k/b;
}
d=i;
for(i=d;i>=0;i--)
printf("%c",s[i]);
scanf("%d",1);
return 0;
}
|
55 | 27112 |
long decimal(char c[],long x)
{
long d=0;
for(int i=0;c[i]!='\0';i++)
{
if(c[i]>='0'&&c[i]<='9')
d=d*x+c[i]-'0';
if(c[i]>='A'&&c[i]<='Z')
d=d*x+c[i]-'A'+10;
if(c[i]>='a'&&c[i]<='z')
d=d*x+c[i]-'a'+10;
}
return d;
}
int main()
{
long a,b;
int length;
char n[65] = {0};
cin>>a>>n>>b;
long x = decimal(n,a);
for(int i=0;x>=0;i++)
{
int remainder=x%b;
n[i]=remainder<10?'0'+remainder:'A'+remainder-10;
x=(x-remainder)/b;
length=i;
if(x==0)
break;
}
for(int i=length;i>=0;i--)
cout<<n[i];
cout<<endl;
return 0;
} |
55 | 27113 | 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 | 27114 | main()
{
char n[33],m[33];
long c,x,y;
int a,b,d,e,l,i;
scanf("%d%s%d",&a,n,&b);
l=strlen(n);
for(i=0;i<l;i++)
{if(n[i]>='a'&&n[i]<='z') n[i]=n[i]+10-'a';
if(n[i]>='A'&&n[i]<='Z') n[i]=n[i]+10-'A';
if(n[i]>='0'&&n[i]<='9') n[i]=n[i]-'0';}
c=0;
for(i=0;i<=l-1;i++)
{
c=c*a+n[i];
}
d=0;
do
{
x=c/b;
y=c%b;
for(i=d-1;i>=0;i--) m[i+1]=m[i];
m[0]=y;
c=x;
d++;
} while(x!=0);
m[d]='\0';
for(i=0;i<d;i++)
{
if(m[i]>=0&&m[i]<=9) m[i]=m[i]+'0';
else m[i]=m[i]+'A'-10;
}
printf("%s\n",m);
} |
55 | 27115 | int main()
{
int a,b;
char num1[32];
int num2[32]={0};
long num;
int i,lenth;
scanf("%d %s %d",&a,num1,&b);
for(lenth=0;num1[lenth]!='\0';lenth++)
{
if(num1[lenth]<='9')num1[lenth]-='0';
else num1[lenth]-='A'-10;
if(num1[lenth]>=35)num1[lenth]-=32;
}
for(i=1,num=num1[0];i<lenth;i++)
num=num*a+num1[i];
for(i=31;num>=b;i--)
{
num2[i]=num%b+1;
num/=b;
}
num2[i]=num+1;
for(i=0;i<32;i++)
{
if(num2[i]==0)continue;
else if(num2[i]<10)printf("%d",num2[i]-1);
else printf("%c",num2[i]+'A'-11);
}
return 1;
}
|
55 | 27116 | //*************************
//* ? ?????? *
//* ? ??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 | 27117 | 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 | 27118 |
long C(long Z,long X)
{ long V;
if (X==0)
V=1;
else
{
V=1;
for(long B=1;B<=X;B++)
V=V*Z;
}
return V;
}
main()
{
char q;
int d=0;
long o,a,b,p,k,h,i,t;
char n[20],l,g;
scanf("%d %s %d",&a,n,&b);
o=strlen(n);
long m[o];
for(k=0;k<=o-1;k++)
{
l=n[k];
if(('9'-l>=0)&&('0'-l<=0))
l=l-'0';
else
{
if((l<=96)&&(l>=10))
l=l-55;
else
{
if(l>=97)
l=l-87;
}
}
m[k]=l;
}
p=0;
for(k=0;k<=o-1;k++)
{long s=o-k-1;
p=p+(m[k])*(C(a,s));
}
if(p==0)
printf("0");
if(b>=10)
{
for(int j=9;j>=0;j--)
{
t=p/(C(b,j));
p=p-t*C(b,j);
if(t!=0||d!=0)
{
if(t>=10&&t<=50)
{
g=t+55;
printf("%c",g);
}
else
printf("%d",t);
d++;
}
}
}
else
{
for(int j=20;j>=0;j--)
{
t=p/(C(b,j));
p=p-t*C(b,j);
if(t!=0||d!=0)
{
if(t>=10&&t<=50)
{
g=t+55;
printf("%c",g);
}
else
printf("%d",t);
d++;
}
}
}
getchar();
getchar();
}
|
55 | 27119 | int zheng (char x);
char fan(int x);
int main()
{
int n,m,f,sum=0,wei=0,i;
char zhuan[50];
scanf("%d",&n);
char x[10];
scanf("%s",x);
scanf("%d",&m);
f=strlen(x);
for(i=0;i<f;i++)
{
sum+=zheng(x[i])*pow(n,f-i-1);
}
for(i=49;i>=0;i--)
{
zhuan[i]=fan(sum%m);
wei++;
sum=sum/m;
if(sum==0)
break;
}
for(i=50-wei;i<50;i++)
{
printf("%c",zhuan[i]);
}
return 0;
}
int zheng(char x)
{
int m;
if(x>='a'&&x<='z')
m=x-87;
else if(x>='A'&&x<='Z')
m=x-55;
else
m=x-48;
return m;
}
char fan(int x)
{
char m;
if(x>=0&&x<=9)
m=x+48;
else if(x>=10&&x<=35)
m=x+55;
return m;
} |
55 | 27120 |
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 | 27121 | main()
{
int a,b,l,i,m,j,s;
char n[100];
scanf("%d %s %d",&a,&n,&b);
l=strlen(n);
for(i=0;i<=l-1;i++)
{
if(n[i]>='A'&&n[i]<='Z')
n[i]=n[i]-'A'+10;
else if(n[i]>='a')
n[i]=n[i]-'a'+10;
else
n[i]=n[i]-'0';
}
s=0;
for(i=l-1;i>=0;i--)
{
m=n[i];
for(j=0;j<l-i-1;j++)
{
m*=a;
}
s+=m;
}
i=0;
int x[100];
int y[100];
for(s=s;s>=b;s=s/b)
{
x[i]=s%b;
i++;
}
x[i]=s;
for(j=0;j<=i;j++)
{
y[j]=x[i-j];
}
for(j=0;j<=i;j++)
{
if(y[j]<=9&&y[j]>=0)
{
n[j]=y[j]+48;
}
else
n[j]=y[j]+55;
}
n[j]='\0';
puts(n);
}
|
55 | 27122 | /**
* 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 | 27123 | 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 | 27124 | void main()
{
int a,b,l,i,m,t,j;
long sum=0;
char n[40],y[40],z[40];
scanf("%d %s %d",&a,n,&b);
l=strlen(n);
m=1;
for(i=1;i<=l;i++)
{
t=n[l-i];
if(t<60)
sum=sum+(n[l-i]-48)*m;
else if(t<91)
sum+=(n[l-i]-55)*m;
else
sum+=(n[l-i]-87)*m;
m=m*a;
}
//printf("%d",sum);
i=0;
if(sum!=0)
{while(sum!=0)
{
i++;
t=sum%b;
if(t<=9)
y[29-i]=t+48;
else
y[29-i]=t+55;
sum=sum/b;
}
for(j=0;j<=i-1;j++)
{
z[j]=y[29-i+j];
}
z[i]='\0';
printf("%s",z);}
else
printf("0");
} |
55 | 27125 | int main()
{
char n[100];
int a,b;
cin>>a>>n>>b;
int num=0;
int i;
int len=strlen(n);//???????
for(i=0;i<len;i++)//??????10??
{
if(n[i]<='9' && n[i]>='0')
{
n[i]=n[i]-48;
}
if(n[i]<='z' && n[i]>='a')
{
n[i]=n[i]-87;
}
if(n[i]<='Z' && n[i]>='A')
{
n[i]=n[i]-55;
}
num=num+n[i]*((double)pow((double)a,(double)(len-1-i)));
}
if(num==0)
{
cout<<0;
}
else//???b??????????
{
int latter[100];
i=0;
do
{latter[i]=num%b;
num=num/b;
i++;
}while(num/b!=0);
latter[i]=num%b;
latter[i+1]='\0';
char n2[100];
int j;
for(j=0;i>=0;i--,j++)
{
if(latter[i]>=0 && latter[i]<=9)
{
n2[j]=latter[i]+48;
}
if(latter[i]>=10 && latter[i]<=36)
{
n2[j]=latter[i]+55;
}
cout<<n2[j];
}
}
cout<<endl;
return 0;
} |
55 | 27126 | 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 | 27127 | main()
{
int a,b,i,j,h,s,g,p,q,l;
char n[100];
int m[100];
char z[100];
scanf("%d %s %d",&a,n,&b);
l=strlen(n) ;
h=0;
for(i=1,g=1,s=0;i<=l;i++)
{ if(n[l-i]>='a'&&n[l-i]<='z')
h=n[l-i]-'a'+10;
else
{if(n[l-i]>='A'&&n[l-i]<='Z')
h=n[l-i]-'A'+10;
else
h=n[l-i]-'0';}
s=s+h*g;
g=g*a; }
if(s==0) printf("0");
else
{
for(j=0;s>0;j++)
{ m[j]=s%b;
s=s/b;
q=j;}
for(p=0;p<=q;p++)
{ if (m[p]>=0&&m[p]<=9)
z[q-p]=m[p]+'0';
else
z[q-p]=m[p]+'A'-10; }
z[q+1]='\0';
printf("%s",z);
}
}
|
55 | 27128 | main ()
{
int a2i[128],from,to,len=0,i;
char i2a[] ="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ" ,in[255],out[255]="0" ;
long num = 0;
for (i='0';i<='9';i++)
{a2i[i]=i-'0';}
for (i='A';i<='Z';i++)
{a2i[i]=i-'A'+10; }
for (i='a';i<='z';i++)
{a2i[i]=i-'a'+10;}
scanf("%d %s %d",&from,in,&to);
for (i=0;in[i]!='\0';i++)
num = num*from +a2i[in[i]];
len = (num == 0)? 1:0;
while (num >0)
{
out[len++] = i2a[num%to] ;
num/=to;
}
for (i=len-1;i>=0;i--)
printf ("%c",out[i]);
}
|
55 | 27129 | 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 | 27130 | 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 | 27131 | void main()
{
int a1,b1,temp=0,numtemp[10];
char num1[10],num2[10],c;
int i=0,j=0,k=0,n;
scanf("%d %s %d",&a1,num1,&b1);
while(num1[i]!='\0')
{
if(num1[i]>=97&&num1[i]<=122)
num1[i]-=32;
if(num1[i]>=65&&num1[i]<=90)
numtemp[i]=num1[i]-55;
else
numtemp[i]=num1[i]-48;
i+=1;
}
i-=1;
for(j=0;j<=i;j++)
temp+=numtemp[j]*power(a1,i-j);
i=0;
j=0;
while(power(b1,i)<temp)
i++;
j=i-1;
for(k=0;k<i;k++)
{
n=temp/power(b1,j);
if(n>=10)
c=(char)(n+55);
else
c=(char)(n+48);
temp-=power(b1,j)*n;
j--;
num2[k]=c;
n=0;
}
num2[k]='\0';
if(k!=0)
printf("%s\n",num2);
else
printf("0\n");
} |
55 | 27132 |
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 | 27133 | 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 | 27134 | void main()
{
int a,b,k,i,m,j,n,o;
long ten=0;
char x[32]="\0"; char y[32]="\0";
scanf("%d %s %d",&a,x,&b);
k=strlen(x);
for(i=0;i<k;i++)
{
ten=a*ten;
if(x[i]<60)
ten=ten+(x[i]-48);
else if(x[i]<95) ten=ten+(x[i]-55);
else ten+=(x[i]-87);
}
j=0;
do{
m=ten%b;
ten=(ten-m)/b;
if(m<10) y[j]=m+48;
else y[j]=m+55;
j++;
}
while(ten!=0);
n=strlen(y);
for(o=n-1;o>=0;o--)
{
printf("%c",y[o]);
}
} |
55 | 27135 | //????
int ji(int a,int b);
int main()
{
int jinzhi1=0; //????1
int jinzhi2=0; //????2
int p=0; //????
int i=0; //???
int j=0; //?????
char n[100]; //?????????
char m[100]; //?????????
long s=0; //?????????
cin>>jinzhi1>>n>>jinzhi2;
p=strlen(n);
//???????????
while(i<p)
{
(int) n[i];
if(n[i]>96) //??????????,???s?????
{
s=s+(n[i]-87)*ji(jinzhi1,(p-i-1));
}
else
{
if(n[i]>64)
{
s=s+(n[i]-55)*ji(jinzhi1,(p-i-1));
}
else
{
s=s+(n[i]-'0')*ji(jinzhi1,(p-i-1));
}
}
i=i+1;
}
i=0;//?????
if(s==0)
{
cout<<0<<endl;
}
else
{
while(s!=0) //????
{
m[i]=s%jinzhi2;
s=(s-m[i])/jinzhi2;
i+=1;
}
for(j=0;j<i;j++) //?????????????
{
if(m[i-1-j]>9)
{
m[i-1-j]=m[i-1-j]+55;
cout<<m[i-1-j];
}
else
{
m[i-1-j]=m[i-1-j]+48;
cout<<m[i-1-j];
}
}
}
return 0;
}
int ji(int a,int b) //????????
{
int i=0;
int ji=1;
for(i=0;i<b;i++)
{
ji=ji*a;
}
return ji;
} |
55 | 27136 |
//????
int main()
{
int n,m;
int i,j,k,l;
char a[33];
int b[33];
long int mid;
int ar;
cin>>n;
for(i=0;i<33;i++)
{
a[i]=48;
b[i]=-1;
}
cin>>a;
i=0;
while(a[i]!='\0')
i++;
a[i]=48;
k=33-i;
for(l=0;l<i;l++)
{
a[k]=a[l];
a[l]=48;
k++;
}
//????????
//??????????????
for(k=0;k<33;k++)
{
if((a[k]>='0')&&(a[k]<='9'))
a[k]-='0';
else if((a[k]>='a')&&(a[k]<='z'))
a[k]=a[k]-87;
else
a[k]=a[k]-55;
}
//???????ing
mid=0;
ar=1;
for(j=32;j>=33-i;j--)
{
mid+=a[j]*ar;
ar*=n;
}
//?????????
cin>>m;
k=0;
while(mid!=0)
{
b[k]=mid%m;
mid=mid/m;
k++;
}
for(i=32;i>=0;i--)
if(b[i]!=-1)
{
if(b[i]>=10)
{
char m=b[i]+55;
cout<<m;
}
else
cout<<b[i];
}
cout<<'\n';
return 0;
}
|
55 | 27137 |
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 | 27138 |
int main()
{
int i,j,n,num,sum=0,x,k,o,t,a,b;
char *p;
sum=0;
p=(char*)malloc(sizeof(char)*20);
scanf("%d %s %d",&a,p,&b);
for(j=0;j<strlen(p);j++)
if(*(p+j)<='z'&&*(p+j)>='a')
*(p+j)-=32;
for(j=0;j<strlen(p);j++)
{
if(*(p+j)<='9'&&*(p+j)>='0')
{num=(int)*(p+j)-48;
t=strlen(p)-j;
while(t>1) num*=a,t--;}
else
{num=(int)*(p+j)-65+10;
t=strlen(p)-j;
while(t>1) num*=a,t--;}
sum+=num;
}
x=sum; k=0;
while(x/b!=0) k++,x=x/b;
char *q;
q=(char*)malloc(sizeof(char)*k);
x=sum;
*(q+k+1)='\0';
while(k>=0)
{o=x%b;
if(o<=9&&o>=0)
{*(q+k)=(char)(o+48);
x=x/b;
k--;}
else
{*(q+k)=(char)(o+55);
x=x/b;
k--;}
}
printf("%s\n",q);
}
|
55 | 27139 |
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 | 27140 | //????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 | 27141 | int main() {
int a, b, ten = 0;
char str[100], str2[100];
cin >> a >> str >> b;
int len = strlen( str );
for ( int i = 0; str[i] != '\0'; i ++ ) {
if ( str[i] >= '0' && str[i] <= '9' ) ten += ( str[i] - '0' ) * pow ( ( double ) a, ( double ) ( len - 1 - i ) ) ;
else if ( str[i] <= 'z' && str[i] >= 'a' ) ten += ( str[i] - 'a' + 10 ) * pow ( ( double ) a, ( double ) ( len - 1 - i ) );
else ten += ( str[i] - 'A' + 10 ) * pow ( ( double ) a, ( double ) ( len - 1 - i ) );
}
int j = 0;
if ( ten == 0 ) cout << 0;
else {
while ( ten != 0 ) {
if ( ten % b <= 9 ) str2[j ++] = ( char )( ten % b + '0' );
else str2[j ++] = ( char )( ten % b - 10 + 'A' );
ten /= b;
}
j --;
for ( int i = j; i >= 0; i -- ) {
cout << str2[i];
}
}
return 0;
}
|
55 | 27142 | void main()
{
int a,b,i,j,t,k;
char m[32],n[32];
long middle,mult;
middle=0;
scanf("%d",&a);
scanf("%s",m);
scanf("%d",&b);
i=strlen(m);
for(j=0;j<=i-1;j++)
{
if(m[j]>='0'&&m[j]<='9')m[j]=m[j]-'0';
if(m[j]>='a'&&m[j]<='z')m[j]=m[j]-'a'+10;
if(m[j]>='A'&&m[j]<='Z')m[j]=m[j]-'A'+10;
}
for(j=0;j<=i-1;j++)
{
mult=1;
for(t=i-1-j;t>=1;t--)
{
mult=mult*a;
}
middle=middle+m[j]*mult;
}
if(middle==0)printf("0");
if(middle>0)
{ j=0;
while(middle>0)
{
n[j]=middle%b;
middle=middle/b;
j++;
}
for(k=0;k<=j-1;k++)
{
if(n[k]<=9&&n[k]>=0)n[k]=n[k]+'0';
else if(n[k]>=10)n[k]='A'-10+n[k];
}
for(k=j-1;k>=0;k--)
{
printf("%c",n[k]);
}
}
} |
55 | 27143 | int main()
{
char str[100000];
long int k,t,n,m,a,i,j;
scanf("%d%s%d",&k,str,&t);
n=strlen(str);
for(i=0;i<n;i++)
{
if(str[i]>96)
str[i]=str[i]-32;
}
m=0;
for(i=0;i<n;i++)
{
a=1;
for(j=1;j<n-i;j++)
{
a=a*k;
}
if(str[i]>=65)
m=m+(str[i]-55)*a;
else
m=m+(str[i]-48)*a;
}
if(m==0)
printf("0");
else
{i=0;
while(m>0)
{
j=m%t;
if(j<10)
str[i]=j+48;
else str[i]=j+55;
i=i+1;
m=(m-j)/t;
}
for(j=i-1;j>=0;j--)
printf("%c",str[j]);}
return 0;
}
|
55 | 27144 | void main()
{
long a,b,k,h,n,i,m;
char s[100],t[100];
scanf("%d%s%d",&a,&s,&b);
n=strlen(s);
for(k=0,i=0;i<n;i++)
{
if(s[i]<='Z'&&s[i]>='A')
s[i]=s[i]-55;
else if(s[i]<='z'&&s[i]>='a')
s[i]=s[i]-87;
else
s[i]=s[i]-48;
for(h=1,m=(int)s[i];h<=n-i-1;h++)
m=m*a;
k=k+m;
}
h=0;
if(k!=0)
{
while (k!=0)
{
t[h]=k%b;
h++;
k=k/b;
}
for(i=h-1;i>=0;i--)
{
if(t[i]<10)
t[i]=t[i]+48;
else
t[i]=t[i]+55;
printf("%c",t[i]);
}
}
else
printf("0");
printf("\n");
}
|
55 | 27145 | int convert1(char a)
{
if ((a >= '0') && (a <= '9'))
return a - '0';
if ((a >= 'a') && (a <= 'z'))
return (a - 'a' + 10);
if ((a >= 'A') && (a <= 'Z'))
return (a - 'A' + 10);
}
char convert2(int a)
{
if ((a >= 0) && (a <= 9))
return (a + 48);
else
return (a + 55);
}
int main()
{
int a , b , len , k = 1 , i , j;
long t = 0;
char num[100] , p;
int num1[100];
cin >> a >> num >> b;
len = strlen(num);
for (i = len - 1 ; i >= 0 ; i--)
{
t = t + k * convert1(num[i]);
k = k * a;
}
i = 1;
while(t >= b)
{
num1[i] = t % b;
i++;
t = t / b;
}
num1[i] = t;
for (j = i ; j >= 1; j--)
{
p = convert2(num1[j]);
cout << p;
}
return 0;
}
|
55 | 27146 |
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 | 27147 | 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 | 27148 | int main()
{
long k=0,a,b,i,h=0,c;
unsigned int e[100];
char n[100];
scanf("%d %s %d",&a,n,&b);
c = strlen(n);
for(i=0;i<=c-1;i++)
{
if(n[i]>='0'&& n[i]<='9')
n[i]=n[i]-('0'-0);
if(n[i]<='Z' && n[i]>='A')
n[i]=n[i]-('A'-10);
if(n[i]>='a' && n[i]<='z')
n[i]=n[i]-'a'+10;
h=a*h+n[i];
}
if(h==0)
printf("0");
for(i=0;h>0;i++)
{
e[i]=h%b;
h=h-e[i];
h=h/b;
k=k+1;
}
for(i=0;i<=k-1;i++)
{
n[i]=e[k-1-i];
if (n[i]>9)
n[i]=n[i]+'A'-10;
else
n[i]=n[i]+'0';
}
n[k]='\0';
printf("%s\n",n);
getchar();
getchar();
getchar();
getchar();
return 0;
} |
55 | 27149 | 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]; }
for(i=0;;i++)
{
num[i]=n%b;
n=n/b;
if(n==0)
break;
}
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];}
}
return 0;
}
|
55 | 27150 | 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 | 27151 |
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 | 27152 | 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 | 27153 | int f(char c)
{
int w;
if(c>='0' && c<='9')
{
w=c-'0';
return w;
}
if(c>='a' && c<='z')
{
w=c-'a'+10;
return w;
}
if(c>='A' && c<='Z')
{
w=c-'A'+10;
return w;
}
}
char g(int a)
{
char c;
if(a>=0 && a<9)
{
c=a+'0';
return c;
}
if(a>=10)
{
c=a-10+'A';
return c;
}
}
int main()
{
int a,b,i,j,l,x;
long sum=0,y;
char n[10];
scanf("%d %s %d",&a,n,&b);
if(a==b)
printf("%s\n",n);
else
{
l=strlen(n);
for(i=0;i<l;i++)
{
x=f(n[i]);
y=(long)pow(a,l-i-1);
sum=sum+x*y;
}
if(sum==0)
printf("0");
else
{
char m[50];
long z;
l=(int)(log(sum)/log(b));
for(i=0;i<=l;i++)
{
if(i==l)
{
z=sum;
m[i]=g(z);
}
else
{
for(j=1;j<=b;j++)
{
z=j*pow(b,l-i);
if(z>sum)
{
z=(j-1)*pow(b,l-i);
sum=sum-z;
m[i]=g(j-1);
break;
}
}
}
}
for(i=0;i<=l;i++)
printf("%c",m[i]);
printf("\n");
}
}
return 0;
}
|
55 | 27154 | main()
{
int a,b,num1[100],num2[100],l1=0,l2=0,i,j=0;
long n=0;
char ch1[100],ch2[100],c;
for(i=0;i<100;i++)
{
num1[i]=0;
num2[i]=0;
ch1[i]='0';
ch2[i]='0';
}
scanf("%d ",&a);
for(i=0;(c=getchar())!=' ';i++)
{
l1++;
ch1[i]=c;
if('0'<=c&&c<='9')num1[i]=c-'0';
else if('a'<=c&&c<='z')num1[i]=c-'a'+10;
else if('A'<=c&&c<='Z')num1[i]=c-'A'+10;
}
scanf("%d",&b);
for(i=0;i<l1;i++)
n=n+num1[i]*(int)pow(a,l1-1-i);
for(i=1;j==0;i++)
{
if(n/(int)pow(b,i)==0)
{
j=1;
break;
}
}
l2=i;
for(i=0;i<l2;i++)
{
num2[99-i]=n%b;
n=(n-num2[99-i])/b;
if(0<=num2[99-i]&&num2[99-i]<=9)ch2[99-i]=num2[99-i]+'0';
else if(10<=num2[99-i])ch2[99-i]=num2[99-i]-10+'A';
}
for(i=0;i<l2;i++)
printf("%c",ch2[100-l2+i]);
}
|
55 | 27155 | long int num(long int x,int i,int b)
{
long int a;
a=x;
int j;
for (j=0;j<i;j++)
a=a*b;
return a;
}
void main ()
{
int a,b,i,j,length;
char shu[100],zhuanhuan[100];
scanf("%d %s %d",&a,shu,&b);
long int k=0;
length=strlen(shu);
long int l;
for (i=0;i<length-1;i++)
{
if( ((shu[i]>='A')&&(shu[i]<='Z')))
{
l=shu[i]-'A'+10;
k=k+num(l,length-i-1,a);
}
if(((shu[i]>='0')&&(shu[i]<='9')))
{
l=shu[i]-'0';
k=k+num(l,length-i-1,a);
}
if( ((shu[i]>='a')&&(shu[i]<='z')))
{
l=shu[i]-'a'+10;
k=k+num(l,length-i-1,a);
}
}
if ((shu[length-1]>='A')&&(shu[length-1]<='Z'))
k=k+shu[length-1]-'A'+10;
if(((shu[length-1]>='0')&&(shu[length-1]<='9')))
k=k+shu[length-1]-'0';
if ((shu[length-1]>='a')&&(shu[length-1]<='z'))
k=k+shu[length-1]-'a'+10;
int m=0;
int n;
long int f=k;
do
{
n=f%b;
if ((n>=0)&&(n<=9))
{
zhuanhuan[m]=n+'0';
m++;
}
else
{
zhuanhuan[m]=n-10+'A';
m++;
}
f=f/b;
}while(f!=0);
for (i=m-1;i>=0;i--)
printf("%c",zhuanhuan[i]);
printf("\n");
} |
55 | 27156 | 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 | 27157 | void main()
{
int a,b,i,j;
long k;
char n[50],m[50],s[50];
scanf("%d %s %d",&a,n,&b);
k=0;
for(i=0;i<strlen(n);i=i+1)
{
if(n[i]>=48&&n[i]<=57)
k=k*a+n[i]-48;
if(n[i]>='A'&&n[i]<='Z')
k=k*a+n[i]-55;
if(n[i]>='a'&&n[i]<='z')
k=k*a+n[i]-87;
}
if(k==0)
printf("0");
for(i=0;k>0;i=i+1)
{
if(k%b<10)
m[i]=k%b+48;
else m[i]=k%b+55;
k=k/b;
}
i=i-1;
for(j=0;i>=0;j=j+1)
{
s[j]=m[i];
i=i-1;
}
for(i=0;i<j;i=i+1)
{
printf("%c",s[i]);
}
}
|
55 | 27158 | 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 | 27159 | 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 | 27160 | 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 | 27161 | 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 | 27162 | 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 | 27163 | void main()
{
long int f=0,e=0,b,c,i,g,k=0,j=0,v=1;
char d[100],a[100];
int h[100];
scanf("%d",&b);//d???
for(i=0;;i++)
{a[i]=getchar();
if (a[i]==' ') break;
}//??????
for(i=0;;i++)
{d[i]=getchar();
if (d[i]==' ') break;j++;
}
scanf("%d",&c);//?????
//for(i=0;i<4;i++)
//printf("%c\n",d[i]);
//printf("%d %d",b,c);
g=b;//????
{
for(i=0;;i++)
{if (d[i]==' ') break;
if (d[i]< 59 ) h[i]=d[i]-48;
else if (d[i]<='Z') h[i]=d[i]-55;
else h[i] = d[i]-87;
//printf("%d\n",h[i]);
};
for(i=j-1;i>=0;i--)
{f=f+h[i]*b/g;b=b*g;}
// printf("%d\n",f);//??
}//??10
{
for(i=0;;i++)
{
h[i]=f%c;f=f/c;k++;
if (f==0) break;
};//??
for(i=0;i<k;i++)
{ if (h[i]<=9)
d[i]=h[i]+48;
else d[i]=h[i]+55;
}
for(i=k-1;i>=0;i--)
if (j>=10) {printf("2147483647");break;}
else printf("%c",d[i]);
printf("\n");//????
}
}
|
55 | 27164 | int main()
{
int a,n,b,s,i,j,k,l,sz[100],zh[100];
char zf[100],tj[100];
scanf("%d %s %d",&a,zf,&b);
l=strlen(zf);
for(i=0;i<l;i++){
if(zf[i]>='0'&&zf[i]<='9'){
sz[i]=zf[i]-'0';
}
else if(zf[i]>='a'&&zf[i]<='z'){
sz[i]=zf[i]-'a'+10;
}
else if(zf[i]>='A'&&zf[i]<='z'){
sz[i]=zf[i]-'A'+10;
}
}
s=0;
for(i=0;i<l;i++){
s=s*a+sz[i];
}
j=0;
if(s==0){
zh[j]=0;
j++;
}
else{
while(s>0){
zh[j]=s%b;
s=s/b;
j++;
}
}
for(k=0;k<j;k++){
if(zh[k]>9){
tj[k]='A'+zh[k]-10;
}
else{
tj[k]=zh[k]+'0';
}
}
for(k=j-1;k>=0;k--){
printf("%c",tj[k]);
}
return 0;
}
|
55 | 27165 | 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 | 27166 | int f(char x)
{
int xx;
xx=x-48;
if(xx>9)xx=x-'A'+10;
if(xx>36)xx=x-'a'+10;
return xx;
}
char g(int y)
{
char yy;
if(y<10)yy=y+'0';
if(y>=10)yy=y-10+'A';
return yy;
}
int main()
{
long nn=0;
int a,b,i;
char n[500];
scanf("%d %s %d",&a,n,&b);
int length=strlen(n);
int k=1;
for(i=length-1;i>=0;i--)
{
nn+=f(n[i])*k;
k*=a;
}
int m[500];
int j=0;
do
{
m[j]=nn%b;
nn=nn/b;
j++;
}
while(nn>=1);
for(i=j-1;i>=0;i--)printf("%c",g(m[i]));
} |
55 | 27167 |
int main()
{
int shu=0,j,i,a,b,mm;
char m[100],n[100];
cin>>a;
cin.get();
cin>>m;
cin>>b;
for(i=0;m[i]!='\0';i++)
{if(m[i]>=65&&m[i]<=90) m[i]=m[i]+32;}
for(i=0;m[i]!='\0'; i++)
{
if(m[i]>=48&&m[i]<=57) mm=m[i]-48;
else mm=m[i]-97+10;
shu=shu*a+mm;
}
if(shu==0) cout<<shu<<endl;
for(i=0;shu!=0;i++)
{
n[i]=shu%b;
if(n[i]>=9) n[i]=n[i]+55;
else n[i]=n[i]+48;
shu=shu/b;
}
for(j=i-1;j>=0;j--) cout<<n[j];
return 0;
} |
55 | 27168 | int qr(int x,int y)
{
if(y<=0)
return(1);
else return x*qr(x,(y-1));
}
int main()
{
int a,b,n,i,j,d[100];
long int k=0;
char p[100],q[100];
scanf("%d %s %d",&a,p,&b);
n=strlen(p);
for(i=0;i<n;i++)
{
if(p[i]<='z'&&p[i]>='a')
p[i]-=32;
}
for(i=0;i<n;i++)
{
if(p[i]>='A'&&p[i]<='Z')
k+=(qr(a,(n-1-i))*(p[i]-'A'+10));
else
k+=(qr(a,(n-1-i))*(p[i]-'0'));
}
for(i=0;;i++)
{
if(k>=b)
{
d[i]=(k-(k/b)*b);
k=k/b;
}
else
{
d[i]=k;
break;
}
}
for(j=0;j<=i;j++)
{
if(d[j]<=9)
q[j]=d[j]+'0';
else
q[j]=d[j]-10+'A';
}
for(j=i;j>=0;j--)
printf("%c",q[j]);
return(0);
}
|
55 | 27169 | int zhsh (int, int, int, char[], int, int, int);//???????
int main ()
{
char s[100], u[100];
int a, b, l, k = 0, i = 0, j = 0, r, l1;
cin >> a >> s >> b;
l = strlen(s);
int sum = 1;
zhsh (i, j, l, s, k, sum, a);//?????????????????
if(zhsh (i, j, l, s, k, sum, a) == 0)//??0??????????
cout << "0" << endl;
else
{
k = zhsh (i, j, l, s, k, sum, a);
for (j = 0; k != 0; j++)//????0?
{
r = k % b;
if (r >= 10)//??????????
u[j] = r - 10 + 'A';
else
u[j] = r + '0';
k=k/b;
}
u[j] = '\0';//????????????
l1 = strlen(u);
for ( j= l1 - 1; j >= 0; j--)
cout << u[j];
cout << endl;
}
return 0;
}
int zhsh(int i,int j,int l,char s[],int k,int sum,int a)//???????
{
for(i = 0, j = l - 1; j >= 0; i++ , j--)
{
if(s[j] >= 65)
{
if(s[j] >= 97)
k = k + (s[j] - 87) * sum;
else
k = k + (s[j] - 55) * sum;
}
else
k = k + (s[j] - 48) * sum;
sum = sum * a;
}
return k;
}
|
55 | 27170 | int main(int argc, char* argv[])
{
int a,b,i,j,l,k;
int sum=0,out=0;
char s[51];
scanf("%d %s %d",&a,s,&b);
l=strlen(s);
//printf("%d\n",l);
for(i=0;s[i]!='\0';i++)
{
if(s[i]>=97&&s[i]<=122)
s[i]=s[i]-32;
}
// printf("%s\n",s);
for(i=0;s[i]!='\0';i++)
{
if(s[i]>=65&&s[i]<=90)
{
k=s[i]-55;//printf("%d\n",k);
}
else
{
k=s[i]-48;//printf("=%d\n",k);
}
for(j=0;j<l-i-1;j++)
{
k=k*a;//printf("%d\n",k);
}
// printf("+%d\n",k);
sum=sum+k;
}
for(i=50;i>=0;i--)
{
if(sum%b>=0&&sum%b<=9)
{
s[i]=sum%b+48;
}
if(sum%b>=10)
{
s[i]=sum%b+55;
}
sum=(sum-sum%b)/b;
if(sum==0)
break;
}
for(j=i;j<51;j++)
{
printf("%c",s[j]);
}
printf("\n");
return 0;
} |
55 | 27171 | 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 | 27172 | 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 | 27173 | 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 | 27174 | int main()
{
char s[20],r[40];
int i,j,a,b,l;
long n=0;
scanf("%d%s%d",&a,s,&b);
l=strlen(s);
for(i=0;i<l;i++)
{
if(s[i]>='a'&&s[i]<='z')
n=a*n+s[i]-'a'+10;
else if(s[i]>='A'&&s[i]<='Z')
n=a*n+s[i]-'A'+10;
else n=a*n+s[i]-'0';
}
//printf("%ld\n",n);
i=0;
if(n==0)
{
printf("0\n");
return 0;
}
while(n>0)
{
if(n%b<=9)
r[i++]=n%b+'0';
else
r[i++]=n%b-10+'A';
n=n/b;
}
for(j=i-1;j>=0;j--)
{
printf("%c",r[j]);
}
printf("\n");
return 0;
}
|
55 | 27175 | 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 | 27176 | main()
{
char a[100],b[100],c[100];
int m,n,i,k,t,q;
long j;
for(i=0;i<100;i++)
b[i]=0;
scanf("%d %s %d",&m,a,&n);
i=0;
j=0;
t=0;
q=0;
while(a[q]!=0)
{
t=t+(a[q]!='0');
q++;
}
if(t!=0)
{
while(a[i]!=0)
{
if(a[i]<='9')
k=a[i]-'0';
else
{
if(a[i]<='Z')
k=10+a[i]-'A';
else
k=10+a[i]-'a';
}
j=j*m+k;
i++;
}
i=0;
while(j!=0)
{
b[i]=j%n;
j=j/n;
i++;
}
for(j=0;j<=i-1;j++)
{
if(b[i-j-1]<=9)
c[j]=b[i-j-1]+'0';
else
c[j]=b[i-j-1]-10+'A';
}
for(j=0;j<100;j++)
{
if(!((c[j]>='0'&&c[j]<='9')||(c[j]>='A'&&c[j]<='Z')))
c[j]=0;
}
printf("%s\n",c);
}
else
printf("0\n");
}
|
55 | 27177 | //*???2010?10?26?*
//*??????*
//******************************************
int main()//???
{//?????
int a=0,b=0,shijinzhi=0,weishu=0,i=0,j=0,shuchu[1000];//???????a?????????b?????????shijinzhi?????????????????weishu????????shuchu?????
char shuru[1000]="abcdefg";//????????????
cin>>a;
cin>>shuru;
cin>>b;//???????????????????????
weishu=strlen(shuru);//????????
for(i=0;i<=weishu-1;i++)
{
if(('A'<=shuru[i])&&(shuru[i]<='Z'))
shuru[i]=shuru[i]-'A'+10;
else if(('a'<=shuru[i])&&(shuru[i]<='z'))
shuru[i]=shuru[i]-'a'+10;
else if(('0'<=shuru[i])&&(shuru[i]<='9'))
shuru[i]=shuru[i]-'0';
}//?????
for(i=0;i<=weishu-1;i++)
{
shijinzhi=shijinzhi+(int)(shuru[i]*pow(1.0*a,1.0*(weishu-i-1)));
}//????????
if(shijinzhi==0)
printf("%d",shijinzhi);//???????????0??????
if(shijinzhi!=0)
{
for(i=0;shijinzhi!=0;i++)
{
shuchu[i]=shijinzhi%b;
shijinzhi=shijinzhi/b;
}
for(j=i-1;j>=0;j--)
{
if((0<=shuchu[j])&&(shuchu[j]<=9))
printf("%d",shuchu[j]);
else if(shuchu[j]>=10)
{
shuchu[j]=shuchu[j]+'A'-10;
printf("%c",shuchu[j]);
}
}
}//???0???????????????????
printf("\n");//??
return 0;
}//????? |
55 | 27178 | 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 | 27179 | 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 | 27180 | int main() //5
{
double m=0,n=0,sum=0;
char a[100]="0";
int b[100];
char c[100]="0"; //10
cin>>m;
cin>>a[0];
for(int i=1;i<100;i++)
{
if((a[i]=getchar())==' ')break; //15
}
cin>>n;
int longa=strlen(a);
for(int j=0;j<(longa-1);j++)
{ //20
b[j]=a[j];
if(b[j]>47&&b[j]<58)sum=sum+(b[j]-48)*pow(m,(longa-j-2));
if(b[j]>64&&b[j]<91)sum=sum+(b[j]-55)*pow(m,(longa-j-2));
if(b[j]>96&&b[j]<123)sum=sum+(b[j]-87)*pow(m,(longa-j-2));
} //25
int z=0,x=0,sum2=sum,n2=n;
do
{
z=sum2%n2;
sum2=sum2/n2; //30
if(z>=0&&z<10)c[x]=z+48;
if(z>=10&&z<37)c[x]=z+55;
x++;
}
while(sum2!=0); //35
int longc=strlen(c);
for(int y=1;y<=longc;y++)
{
cout<<c[longc-y];
} //40
return 0;
} |
55 | 27181 | // ??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 | 27182 | /*
??
?????????????????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
??
???????????????
*/
int dec(char nf[100],int ii,int sysf) //?????????????
{ //nf???????????nf?0??nf?ii??????sysf?????????
int sum=0,exp=1;
int k,j;
for (k=ii;k>=0;k--)
{
if (ii!=k) exp=exp*sysf;
sum+=((int)nf[k])*exp;
}
return sum;
}
void trans(char outf[100],int pos,int decf,int sysf) //?????????????????????????????????????????
{ //outf????????????outf?99??outf?0????pos?????????????decf??????????sysf??????
int rem,t;
while((decf!=0)&&(pos>=0))
{
rem=decf%sysf; //rem???????????
decf=(int)(decf/sysf); //decf??????????
if ((rem>=0)&&(rem<=9)) outf[pos]=rem+48;
else if ((rem>=10)&&(rem<=35)) outf[pos]=rem+55;
pos--;
}
for (t=pos+1;t<=99;t++) cout<<outf[t];
cout<<endl;
}
int main()
{
int a,b,i=0,k,temp;
char n[100],c;
char output[100];
cin>>a;
getchar();
while (c=getchar(),c!=' ')
{
n[i]=c;
i++;
}
i--;
cin>>b;
for (k=0;k<=i;k++)
{
if ((n[k]>='a')&&(n[k]<='z')) n[k]-=87;
else if ((n[k]>='A')&&(n[k]<='Z')) n[k]-=55;
else if ((n[k]>='0')&&(n[k]<='9')) n[k]-=48;
}
temp=dec(n,i,a);
if (temp==0) cout<<"0"<<endl;
else trans(output,99,temp,b);
return 0;
} |
55 | 27183 | void run(int base1, char a[50], int base2)
{
char d[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 len = strlen(a);
int b[50] = {0}, c[50] = {0}, s = 0, i =0;
for (i = 0; i < len; i++)
{
if (a[i] >= 'A' && a[i] <= 'Z')
b[i] = a[i] - 55;
else
{
if (a[i] >= 'a' && a[i] <= 'z')
b[i] = a[i] - 87;
else
b[i] = a[i] - '0';
}
s += b[i] * pow(base1 + 0.0,len - i - 1);
}
i = 0;
while (s > 0)
{
c[i++] = s % base2;
s = s / base2;
}
if (i == 0)
{cout << "0";}
else
{
i--;
for (; i >= 0; i--)
cout << d[c[i]];
}
}
int main()
{
int base1, base2, i;
char a[50];
for (i = 0; i < 50; i++)
{
a[i] = '\0';
}
cin >> base1 >> a >> base2;
run (base1,a,base2);
return 0;
} |
55 | 27184 | int main()
{
unsigned long shuz1,shuz2,total=0;
int i=0,j=0,k=0,length;
char n[33],result[33];
cin>>shuz1>>n>>shuz2;
for(i=0;i<33;i++)
{
if(n[i]=='\0')
{
length=i;
break;
}
}
for(i=0;i<length;i++)
{
if(n[i]>60&&n[i]<93)
total+=(n[i]-55)*pow((double)shuz1,length-i-1);
else if(n[i]>93)
total+=(n[i]-87)*pow((double)shuz1,length-i-1);
else
total+=(n[i]-48)*pow((double)shuz1,length-i-1);
}
if (total == 0) {
cout << 0 << endl;
return 0;
}
for(j=0;total>0;j++)
{
result[j]=total%shuz2;
total=(total-result[j])/shuz2;
}
for(k=0;k<33;k++)
{
if(result[k]<10)
result[k]=result[k]+48;
else
result[k]=result[k]+55;
}
for(k=j-1;k>=0;k--)
cout<<result[k];
cout << endl;
return 0;
}
|
55 | 27185 | 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 | 27186 | 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 | 27187 | //*******************************************************
//*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 | 27188 | void main()
{
int i,j,k,l,a,b,c,s,m=0;
char n[32],x[32];
scanf("%d %s %d",&a,n,&b);
l=strlen(n);
for(i=0;i<l;i++)
{
for(j=1,s=1;j<=i;j++)s=s*a;
if(n[l-i-1]>=65&&n[l-i-1]<=90) k=n[l-i-1]-55;
else
if(n[l-i-1]>=97&&n[l-i-1]<=122) k=n[l-i-1]-87;
else k=n[l-i-1]-48;
k=k*s;
m=m+k;
}
for(i=0;;i++)
{
c=m%b;
if(c<=9) x[i]=c+48;
else x[i]=c+55;
if(m/b==0) break;
m=m/b;
}
for(j=0;j<=i;j++)
printf("%c",x[i-j]);
}
|
55 | 27189 | 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 | 27190 | 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 | 27191 | 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 | 27192 | /*
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 | 27193 | /*
* ????.cpp
* ???????????????????2???36???
* ????: 2010-11-9
* ??: ??
*/
//?????
//???
int main() {
//??a, n, b???????
char n[101];
int a, b, length, i, j, temp; //length????????temp???
long int value = 0, product; //value???????product??????
cin >> a >> n >> b;
//?a???n???????????value
length = strlen(n);
for (i = 0; i < length; i++) {
product = 1;
//?n[i]?????A-Z????????10-35
if (n[i] >= 65 && n[i] <= 90) {
temp = n[i] - 55;
}
//?n[i]?????????????10-35
else if (n[i] >= 97 && n[i] <= 122) {
temp = n[i] - 87;
}
//?n[i]?'0'-'9'????????0-9
else {
temp = n[i] - 48;
}
//???????value
for (j = 0; j < length - i - 1; j++) {
product *= a;
}
value += temp * product;
}
//?value???b???????????
if (value == 0) {
//??n=0????0?????
cout << "0" << endl;
return 0;
} else {
//?n??0???value??b?????????????m?
char m[101];
for (i = 0;; i++) {
temp = value % b;
if (value == 0) {
break;
} else if (temp >= 0 && temp <= 9) {
m[i] = temp + 48;
} else {
m[i] = temp + 55;
}
value /= b;
}
//?m????????
length = i;
for (i = length - 1; i >= 0; i--) {
cout << m[i];
}
}
return 0; //????
}
|
55 | 27194 | 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 | 27195 |
char Change(int x);
int change(char x);
int main()
{
int a,b,i,length,Length;
char num[30],NUM[100];
long number=0;
cin>>a>>num>>b;
for(i=0;i<30;i++)
{
if(num[i]!='\0') ;
else break;
}
length=i;
for(i=0;i<length;i++)
{
number+=change(num[length-i-1])*pow((double)a,(double)i);
}
for(i=0;i<100&&number>=b;i++)
{
NUM[i]=Change(number-(number/b)*b);
number=number/b;
}
Length=i+1;
NUM[i]=Change(number);
for(i=0;i<Length;i++)
{
cout<<NUM[Length-1-i];
}
return 0;
}
int change(char x)
{
if(x>=48&&x<=57) return(x-48);
if(x>=65&&x<=90) return(x-55);
if(x>=97&&x<=122) return(x-87);
}
char Change(int x)
{
if(x<=9) return(x+48);
if(x>=10) return(x+55);
}
|
55 | 27196 | 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 | 27197 | void main()
{
int a,b,t,i,j,n;
char s1[33],s2[33],temp;
scanf("%d %s %d",&a,s1,&b);
n=strlen(s1);
t=0;
for(i=0;i<n;i++)
{
if(s1[i]>='0'&&s1[i]<='9') t=t*a+(s1[i]-'0');
if(s1[i]>='a'&&s1[i]<='z') t=t*a+(s1[i]-'a'+10);
if(s1[i]>='A'&&s1[i]<='Z') t=t*a+(s1[i]-'A'+10);
}
i=0;
do
{
if(t%b>=0&&t%b<=9) s2[i]=t%b+'0';
if(t%b>=10&&t%b<36) s2[i]=t%b-10+'A';
t=t/b;
i++;
}
while(t!=0);
s2[i]='\0';
for(j=i-1;j>=i/2;j--)
{
temp=s2[j];
s2[j]=s2[i-1-j];
s2[i-1-j]=temp;
}
printf("%s",s2);
} |
55 | 27198 |
int main(int argc, char* argv[])
{
int a,b;
int i,j;
int c=0;//c????n???
char n[20];
int num=0;//10????????
scanf("%d%s%d",&a,n,&b);
int k;//k??????(??a????????)
//????n???
for(i=0;n[i]!='\0';i++)
{c++;}
//???n???10???
for(i=0;n[i]!='\0';i++)
{
k=1;
for(j=c-i-1;j>0;j--)
{
k*=a;
}
switch (n[i])
{
case 'a': num+=10*k;break;
case 'A': num+=10*k;break;
case 'b': num+=11*k;break;
case 'B': num+=11*k;break;
case 'c': num+=k*12;break;
case 'C': num+=k*12;break;
case 'd': num+=k*13;break;
case 'D': num+=k*13;break;
case 'e': num+=k*14;break;
case 'E': num+=k*14;break;
case 'f': num+=k*15;break;
case 'F': num+=k*15;break;
case 'g': num+=k*16;break;
case 'G': num+=k*16;break;
case 'h': num+=k*17;break;
case 'H': num+=k* 17;break;
case 'i': num+=k* 18;break;
case 'I': num+=k* 18;break;
case 'j': num+=k* 19;break;
case 'J': num+=k* 19;break;
case 'k': num+=k* 20;break;
case 'K': num+=k* 20;break;
case 'l': num+=k* 21;break;
case 'L': num+=k* 21;break;
case 'm': num+=k* 22;break;
case 'M': num+=k* 22;break;
case 'n': num+=k* 23;break;
case 'N':num+=k* 23;break;
case 'o':num+=k* 24;break;
case 'O':num+=k* 24;break;
case 'p':num+=k* 25;break;
case 'P':num+=k* 25;break;
case 'q':num+=k* 26;break;
case 'Q':num+=k* 26;break;
case 'r':num+=k* 27;break;
case 'R':num+=k* 27;break;
case 's':num+=k* 28;break;
case 'S':num+=k* 28;break;
case 't':num+=k* 29;break;
case 'T':num+=k* 29;break;
case 'u':num+=k* 30;break;
case 'U':num+=k* 30;break;
case 'v':num+=k* 31;break;
case 'V':num+=k* 31;break;
case 'w':num+=k* 32;break;
case 'W':num+=k* 32;break;
case 'x':num+=k* 33;break;
case 'X':num+=k* 33;break;
case 'y':num+=k* 34;break;
case 'Y':num+=k* 34;break;
case 'z':num+=k* 35;break;
case 'Z':num+=k* 35;break;
case '0':num+=k* 0;break;
case '1':num+=k* 1;break;
case '2':num+=k* 2;break;
case '3':num+=k* 3;break;
case '4':num+=k* 4;break;
case '5':num+=k* 5;break;
case '6':num+=k* 6;break;
case '7':num+=k* 7;break;
case '8':num+=k* 8;break;
case '9':num+=k* 9;break;
}
}
int p[20];
int q,count=0;
for(i=0;(num/b)>0;i++)
{
q=num%b;
p[i]=q;
count++;
num=num/b;
}
switch (num)
{
case 10:printf("A");break;
case 11:printf("B");break;
case 12:printf("C");break;
case 13:printf("D");break;
case 14:printf("E");break;
case 15:printf("F");break;
case 16:printf("G");break;
case 17:printf("H");break;
case 18:printf("I");break;
case 19:printf("J");break;
case 20:printf("K");break;
case 21:printf("L");break;
case 22:printf("M");break;
case 23:printf("N");break;
case 24:printf("O");break;
case 25:printf("P");break;
case 26:printf("Q");break;
case 27:printf("R");break;
case 28:printf("S");break;
case 29:printf("T");break;
case 30:printf("U");break;
case 31:printf("V");break;
case 32:printf("W");break;
case 33:printf("X");break;
case 34:printf("Y");break;
case 35:printf("Z");break;
default:printf("%d",num);break;
}
for(i=count-1;i>=0;i--)
{
switch (p[i])
{
case 10:printf("A");break;
case 11:printf("B");break;
case 12:printf("C");break;
case 13:printf("D");break;
case 14:printf("E");break;
case 15:printf("F");break;
case 16:printf("G");break;
case 17:printf("H");break;
case 18:printf("I");break;
case 19:printf("J");break;
case 20:printf("K");break;
case 21:printf("L");break;
case 22:printf("M");break;
case 23:printf("N");break;
case 24:printf("O");break;
case 25:printf("P");break;
case 26:printf("Q");break;
case 27:printf("R");break;
case 28:printf("S");break;
case 29:printf("T");break;
case 30:printf("U");break;
case 31:printf("V");break;
case 32:printf("W");break;
case 33:printf("X");break;
case 34:printf("Y");break;
case 35:printf("Z");break;
default:printf("%d",p[i]);break;
}
}
return 0;
}
|
55 | 27199 | 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");
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.