label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
55 | 27300 | 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 | 27301 | int main()
{
char c[1000];
int n,x=0,i;
int a,b;
scanf("%d%s%d",&a,c,&b);
n=strlen(c);
for(i=0;i<=n-1;i++)
{
if('A'<=c[i] && c[i]<='Z')
c[i]=c[i]-'A'+10;
else if('a'<=c[i]&&c[i]<='z')
c[i]=c[i]-'a'+10;
else if('0'<=c[i]&&c[i]<='9')
c[i]=c[i]-'0';
}
for(i=0;i<=n-1;i++)
{
x=x+c[i]*pow(a,n-i-1);
}
if(x==0)
printf("%d",x);
if(x!=0)
{
int y;int n[100],j;
y=x;
for(i=0;y!=0;i++)
{
n[i]=y%b;
y=y/b;
}
for(j=i-1;j>=0;j--)
{
if(0<=n[j] && n[j]<10)
printf("%d",n[j]);
else if(n[j]>=10)
{
n[j]=n[j]+'A'-10;
printf("%c",n[j]);
}
}
}
printf("\n");
getchar();
getchar();
}
|
55 | 27302 | 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 | 27303 | int main()
{
long a,b,n,i,p[100];
long sum=0;
char u[100];
scanf("%ld%s%ld",&a,u,&b);
n=strlen(u);
if(u[0]=='0')
printf("0\n");
else{
for(i=0;i<n;i++)
{
if(u[i]>='0'&&u[i]<='9')
sum=sum+(u[i]-48)*pow(a,n-i-1);
if(u[i]>='a'&&u[i]<='z')
sum=sum+(u[i]-87)*pow(a,n-i-1);
if(u[i]>='A'&&u[i]<='Z')
sum=sum+(u[i]-55)*pow(a,n-i-1);
}
long t;
t=sum;
i=0;
n=0;
while(t!=0)
{
p[i]=t%b;
t=t/b;
i++;
n++;
}
for(i=n-1;i>=0;i--)
{
if(p[i]<=9)
printf("%ld",p[i]);
if(p[i]>=10)
printf("%c",p[i]+55);
}
}
return 0;
} |
55 | 27304 | int pow(int di,int mi)
{
int k,p=1;
if(mi>=1)
{
for(k=1;k<=mi;k++)
{
p*=di;
}
}
return p;
}
int main()
{
int a,b,num=0,i,j;
char n[100];
int m[100];
cin>>a>>n>>b;
for(i=0;i<=100;i++)
{
if(n[i]=='\0')break;
m[i]=(int)(n[i]);
if(n[i]<=57&&n[i]>=48)m[i]=m[i]-48;
if(n[i]<=90&&n[i]>=65)m[i]=m[i]-55;
if(n[i]<=122&&n[i]>=97)m[i]=m[i]-87;
}
for(j=0;i>=1;j++)
{
num=num+m[j]*pow(a,i-1);
i--;
}
if(num==0)cout<<'0'<<endl;
else
{
int q,w;
char r[100];
int t[100];
for(q=0;q<100;q++)
{
if(num==0)break;
t[q]=num%b;
num=num/b;
}
for(w=0;q>=1;w++)
{
r[w]=(char)(t[q-1]);
if(0<=t[q-1]&&t[q-1]<=9)r[w]+=48;
if(10<=t[q-1]&&t[q-1]<=35)r[w]+=55;
q--;
}
r[w]='\0';
cout<<r<<endl;
}
return 0;
}
|
55 | 27305 |
int zh(char a)
{
int b;
if((a>='A')&&(a<='Z'))
{
b=(int)(a)-55;
return b;
}
else
{
b=(int)(a)-48;
return b;
}
}
char fzh(int a)
{
char b;
if(a>9)
{
b=(char)(a+55);
return b;
}
else
{
b=(char)(a+48);
return b;
}
}
int cf(int a,int b)
{
int i;
int sum=a;
if(b==0)
{
sum=1;
}
for(i=0;i<b-1;i++)
{
sum*=a;
}
return sum;
}
int main()
{
int a,b;
int i,j;
int l;
char c[10000];
char t[10000];
int sum=0;
scanf("%d%s%d",&a,c,&b);
l=strlen(c);
for(i=0;i<l;i++)
{
if((c[i]>='a')&&(c[i]<='z'))
{
c[i]=c[i]-'a'+'A';
}
}
for(i=0;i<l;i++)
{
sum+=cf(a,l-1-i)*zh(c[i]);
}
if(sum==0)
{
printf("0");
}
for(i=0;sum!=0;i++)
{
t[i]=fzh(sum%b);
sum=sum/b;
}
for(j=i-1;j>=0;j--)
{
printf("%c",t[j]);
}
printf("\n");
return 0;
}
|
55 | 27306 |
int trans(char a) //???????????????10??????a????????????
{
int m; //m???10??????
if (a >= '0' && a <= '9') //a???
m = a - '0';
else if (a >= 'a' && a <= 'z') //a?????
m = a - 'a' + 10;
else
m = a - 'A' + 10; //a?????
return m; //????????????
}
void change(int a, char n[], int b) //a?n?b???????????????????????????????
{
int m = 0, i, j = 1, d, k, num[100]; //m?????????????i?j???d????k??????????????num????10??????????????
for (i = 0; n[i] != ' '; i++) //???????????????10??????????????????
{
num[i] = trans(n[i]); //????????????????????????10??
}
k = i; //??????????
char c[100]; //c???????????
for (i = k - 1; i >= 0; i--) //?????????????j???????????????123=3*1+2*10+1*100?
{
m = m + num[i] * j;
j = j * a;
}
if (m == 0) //??????0?????0
cout << "0";
else
{
i = 0;
while (m > 0)
{
d = m % b; //???
m = m / b; //??
if (d >= 10) //??????10????c
{
c[i] = 'A' + d - 10;
}
else //??????10?????c
c[i] = d + '0';
i++; //????????????
}
for (i--; i >= 0; i--) //??
{
cout << c[i];
}
}
}
int main() //???
{
char n[100]; //n??????
int a, b, i, num[100]; //a???????b????????i?????num?????????????????????????
cin >> a;
cin.get(); //??a???????
for (i = 0; (n[i] = cin.get()) != ' ';) //???????????
i++;
cin >> b;
change(a, n, b); //??????????????10???????????????????
return 0;
}
|
55 | 27307 | int main()
{
char n[100],m[100];
int i,j,a,b,num=0,x[100],y[100];
cin>>a>>n>>b;
for(i=0;i<strlen(n);i++)
{
if(n[i]>='A' && n[i]<='Z')x[i]=n[i]-'A'+10;
else if(n[i]>='a' && n[i]<='z')x[i]=n[i]-'a'+ 10;
else if(n[i]>='0' && n[i]<='9')x[i]=n[i]-'0';
num=num*a+x[i];
}
for(i=0;;i++)
{
y[i]=num%b;
num=(num-y[i])/b;
if(y[i]>=0 && y[i]<=9)
m[i]=y[i]+'0';
else m[i]=y[i]-10+'A';
if (num == 0) break;
}
for(j=i;j>=0;j--)
{
cout<<m[j];
}
return 0;
} |
55 | 27308 | main()
{
int a,c,d,e,f,l,x,i;
char b[40000];
scanf("%d %s %d",&a,b,&c);
l=strlen(b);
if(b[0]=='0')
printf("0\n");
else
{
for(d=0;d<l;d++)
{
if(b[d]>='A' && b[d]<='Z')
b[d]=b[d]-'A'+'a';
}
x=0;
for(e=0;e<l;e++)
{
if(b[e]>='a')
f=b[e]-'a'+10;
else
f=b[e]-'0';
x=f+x*a;
}
int g[40000];
for(e=0;x!=0;e++)
{
g[e]=x%c;
x=x/c;
}
char h[40000];
for(i=0;i<e;i++)
{
if(g[i]<10)
h[e-i-1]=g[i]+'0';
else
h[e-i-1]=g[i]+'A'-10;
}
h[e]='\0';
printf("%s",h);
}
getchar();
getchar();
}
|
55 | 27309 | void main()
{
char c[100],d[100],e='a';
long int a,b,m,k,s=0,p,q,i=0,j;
scanf("%d%s%d",&a,c,&b);
m=strlen(c);
while(c[i]!=0)
{
if('A'<=c[i]&&c[i]<='Z')
c[i]+='a'-'A';
i++;
}
for(i=0;i<m;i++)
{
if(a<=10)
k=c[i]-48;
else
{
if(48<=c[i]&&c[i]<=57)
k=c[i]-48;
else
{
k=9;
while(e<=c[i])
{
k=k++;
e++;
}
}
}
for(j=1;j<(m-i);j++)
k=k*a;
s=s+k;
e='a';
}
i=0;
e='A';
if(s==0)
printf("0");
else
{
while(s>0)
{
p=s/b;
q=s%b;
s=p;
if(0<=q&&q<=9)
d[i]=q+48;
else
for(j=10;j<=q;j++)
{
d[i]=e;
e++;
}
i++;
e='A';
}
i--;
for(;i>=0;i--)
printf("%c",d[i]);
}
} |
55 | 27310 | main()
{
long a,b,c,i,m,j;
char n[33];
scanf("%ld %s %ld",&a,n,&b);
c=strlen(n);
for(i=0,m=0;i<c;i++)
{
if(n[i]>='0'&&n[i]<='9')
m=m*a+(n[i]-'0');
else if(n[i]>='a'&&n[i]<='z')
m=m*a+(n[i]+10-'a');
else if(n[i]>='A'&&n[i]<='Z')
m=m*a+(n[i]+10-'A');
}
for(i=0,n[0]=0;m>=0;i++)
{
for(j=i;j>=0;j--)
n[j+1]=n[j];
if(m%b<=9)
n[0]=m%b+'0';
else
n[0]=m%b+'A'-10;
m=m/b;
if(m==0)
break;
}
printf("%s",n);
} |
55 | 27311 | 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 | 27312 | 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+=num[i]*((int)pow(a,(nlen1-1-i)));
}
if(n!=0)
{
for(i=0;n>=b;i++)
{
num[i]=n%b;
n=(n-num[i])/b;
}
if(n>0)num[i]=n;
else i-=1;
for(j=i;j>=0;j--)
{
if(num[j]>=0&&num[j]<=9)
cout<<num[j];
else
{y[j]=num[j]-10+'A';
cout<<y[j];}
}
}
else cout<<0;
return 0;
}
|
55 | 27313 | int zheng(char x);
char fan(int x);
int main(){
int n,m,f,sum,i;
char zhuan[50];
scanf("%d",&n);
char x[10];
scanf("%s",x);
scanf("%d",&m);
f=strlen(x);
sum=0;
int wei=0;
for(i=0;i<f;i++){
sum=sum+zheng(x[i])*pow(n,f-i-1);
}
for(i=49;i>=0;i--){
zhuan[i]=fan(sum%m);
wei++;
sum=sum/m;
if(sum==0)
break;
}
for(i=50-wei;i<50;i++){
printf("%c",zhuan[i]);
}
return 0;
}
int zheng(char x){
int m;
switch(x){
case '1':m=1;break;
case '2':m=2;break;
case '3':m=3;break;
case '4':m=4;break;
case '5':m=5;break;
case '6':m=6;break;
case '7':m=7;break;
case '8':m=8;break;
case '9':m=9;break;
case '0':m=0;break;
case 'a':m=10;break;
case 'A':m=10;break;
case 'b':m=11;break;
case 'B':m=11;break;
case 'c':m=12;break;
case 'd':m=13;break;
case 'e':m=14;break;
case 'f':m=15;break;
case 'g':m=16;break;
case 'h':m=17;break;
case 'i':m=18;break;
case 'j':m=19;break;
case 'k':m=20;break;
case 'l':m=21;break;
case 'm':m=22;break;
case 'n':m=23;break;
case 'o':m=24;break;
case 'p':m=25;break;
case 'q':m=26;break;
case 'r':m=27;break;
case 's':m=28;break;
case 't':m=29;break;
case 'u':m=30;break;
case 'v':m=31;break;
case 'w':m=32;break;
case 'x':m=33;break;
case 'y':m=34;break;
case 'z':m=35;break;
case 'C':m=12;break;
case 'D':m=13;break;
case 'E':m=14;break;
case 'F':m=15;break;
case 'G':m=16;break;
case 'H':m=17;break;
case 'I':m=18;break;
case 'J':m=19;break;
case 'K':m=20;break;
case 'L':m=21;break;
case 'M':m=22;break;
case 'N':m=23;break;
case 'O':m=24;break;
case 'P':m=25;break;
case 'Q':m=26;break;
case 'R':m=27;break;
case 'S':m=28;break;
case 'T':m=29;break;
case 'U':m=30;break;
case 'V':m=31;break;
case 'W':m=32;break;
case 'X':m=33;break;
case 'Y':m=34;break;
case 'Z':m=35;break;
}
return m;
}
char fan(int x){
char m;
switch(x){
case 0:m='0';break;
case 1:m='1';break;
case 2:m='2';break;
case 3:m='3';break;
case 4:m='4';break;
case 5:m='5';break;
case 6:m='6';break;
case 7:m='7';break;
case 8:m='8';break;
case 9:m='9';break;
case 10:m='A';break;
case 11:m='B';break;
case 12:m='C';break;
case 13:m='D';break;
case 14:m='E';break;
case 15:m='F';break;
case 16:m='G';break;
case 17:m='H';break;
case 18:m='I';break;
case 19:m='J';break;
case 20:m='K';break;
case 21:m='L';break;
case 22:m='M';break;
case 23:m='N';break;
case 24:m='O';break;
case 25:m='P';break;
case 26:m='Q';break;
case 27:m='R';break;
case 28:m='S';break;
case 29:m='T';break;
case 30:m='U';break;
case 31:m='V';break;
case 32:m='W';break;
case 33:m='X';break;
case 34:m='Y';break;
case 35:m='Z';break;
}
return m;
}
|
55 | 27314 | int main()
{
int a,b;
int l,j,m,k;
int s=0;
char n[40],x[40],y[40];
scanf("%d %s %d",&a,n,&b);
l=strlen(n);
for(int i=0;i<l;i++)
{
if(n[i]>='a'&&n[i]<='z')
n[i]=n[i]-'a'+10;
else if(n[i]>='A'&&n[i]<='Z')
n[i]=n[i]-'A'+10;
else n[i]=n[i]-'0';
s=n[i]+s*a;
}
if(s==0) printf("0");
else
{
for(j=0;s!=0;j++)
{
x[j]=s%b;
s=(int)s/b;
}
for(k=0;k<j;k++)
{
y[k]=x[j-1-k];
}
for(int i=0;i<j;i++)
{
if(y[i]>9) y[i]=y[i]-10+'A';
else y[i]=y[i]+'0';
}
y[j]='\0';
printf("%s",y);
}
getchar();
getchar();
} |
55 | 27315 | void main()
{
int a[1000],b[1000],d[1000];
int i,n,m,lc,ld=0,n1,sum=0;
char c[1000],e[1000];
scanf("%d %s %d",&n,c,&m);
lc=strlen(c);
if(c[0]=='0')
{
printf("0");
}
if(c[0]!='0')
{
for(i=0;i<lc;i++)
{
if(c[i]<=90&&c[i]>=65)
{
a[i]=c[i]-55;
}
if(c[i]<=122&&c[i]>=97)
{
a[i]=c[i]-87;
}
if(c[i]<=57&&c[i]>=48)
{
a[i]=c[i]-48;
}
}
for(i=0;i<lc;i++)
{
n1=(int)pow(n,i);
b[i]=a[lc-i-1]*n1;
sum=sum+b[i];
}
for(i=0;sum>0;i++)
{
d[i]=sum%m;
ld++;
sum=sum/m;
}
for(i=ld-1;i>=0;i--)
{
if(d[i]<=9&&d[i]>=0)
{
e[i]=d[i]+48;
}
if(d[i]<=36&&d[i]>=10)
{
e[i]=d[i]+55;
}
printf("%c",e[i]);
}
}
}
|
55 | 27316 | void main()
{
char intonumber(char x);
char intochar(int y);
char str[N];
gets(str);
int i=0,c1=0;
while(str[i]!=' ')
{
c1=c1*10+intonumber(str[i++]);
}
while(str[i]==' ')
i++;
unsigned long n1=0;
while(str[i]!=' ')
{
n1=n1*c1+intonumber(str[i++]);
}
while(str[i]==' ')
i++;
int l1=0;
while(str[i]!='\0')
{
l1=l1*10+intonumber(str[i++]);
}
int f;
char yu[M];
for(f=0;n1>0;f++)
{
yu[f]=intochar(n1%l1);
n1=n1/l1;
}
if (f==0) printf("%d",0);
for(f--;f>=0;f--)
printf("%c",yu[f]);
}
char intonumber(char x)
{
if(x>='a'&&x<='z')
x=x-87;
else if(x>='A'&&x<='Z')
x=x-55;
else if(x>=48&&x<=57)
x=x-48;
return(x);
}
char intochar(int y)
{
if(y>=0&&y<=9)
y=y+48;
else if(y>9&&y<=35)
y=y+55;
return(y);
}
|
55 | 27317 | void main()
{
char A[200],B[200];
int a,b,i=0,m=0;
long int n=0,k=0;
scanf("%d%s%d",&a,A,&b);
while (A[i]!='\0')
{
n=n*a;
if(A[i]<=60) n=n+A[i]-48;
else if(A[i]<=90) n=n+A[i]-55;
else n=n+A[i]-87;
i++;
}
k=n;
i=0;
if(k==0) printf("%ld",k);
while (n>0)
{
m=n%b;
if(m<=9) B[i]=m+48;
else if(m>=10) B[i]=m+55;
n=n/b;
i++;
}
B[i]='\0';
m=strlen(B);
n=k;
i=m-1;
while (i>=0)
{
m=n%b;
if(m<=9) B[i]=m+48;
else if(m>=10) B[i]=m+55;
n=n/b;
i--;
}
printf("%s\n",B);
} |
55 | 27318 | long int sum=0;
char a[10000];
long int c[10000];
int main()
{
long int i,j,k,l,n,m,y=0,x,t=0;
long int hhh(int q, int p);
char b[10000];
scanf("%d %s %d",&n,a,&x);
l=strlen(a);
for(i=0;i<l;i++)
{if(a[i]>96&&a[i]<123)
a[i]=a[i]-87;
if(a[i]>64&&a[i]<91)
a[i]=a[i]-55;
if(a[i]>47&&a[i]<58)
a[i]=a[i]-48;
}
for(i=l-1;i>=0;i--)
{c[i]=(int)a[i]*hhh(n,l-1-i);
}
for(i=0;i<l;i++)
sum=sum+c[i];
if(sum==0)t=1;
while(sum>0)
{b[y]=sum%x;
sum=sum/x;
y++;
}
for(i=0;i<y;i++)
{if(b[i]>9)
b[i]=b[i]+55;
else b[i]=b[i]+48;
}
if(t==0)
{
for(i=y-1;i>=0;i--)
printf("%c",b[i]);
}
if(t==1)
printf("0");
}
long int hhh(int q, int p)
{
long int i,w=1;
for(i=0;i<p;i++)
w=q*w;
return w;
}
|
55 | 27319 | /**
grids???????
http://programming.grids.cn/programming/problem/24947e911f454e43abea1300d470e3c4/show.do
-----------------------------
??
?????????????????2???36?????????long??????????
???????????0?1?...?9?a?b?...?z????0?1?...?9?A?B?...?Z??
-----------------------------
????
?????????????a?n?b?a?????n ?a?????b????a????n???b?????
a?b???????2 ? a?b < 36?
-----------------------------
????
???????????????????b?????????????????????0?1?...?9?A?B?...?Z??
-----------------------------
????
15 Aab3 7
-----------------------------
????
210306
-----------------------------
??
???????????????
-----------------------------
???
2010.10.22
*/
/**
?originBase?number???10??
*/
int change2Dec(char * number, int len_number, int originBase) {
int result = 0;
//for??
for (int i=0; i<len_number; i++) {
//???????10????????
int numberBit = 0;
if (number[i]>='0' && number[i]<='9') {
numberBit = number[i]-'0';
}
else if (number[i]>='a' && number[i]<='z') {
numberBit = number[i]-'a'+10;
}
else {
numberBit = number[i]-'A'+10;
}
//???????????
int position = len_number-i;
//????????????
int currentBitValue = numberBit;
for (int j=1; j<position; j++) {
currentBitValue *= originBase;
}
result += currentBitValue;
}
return result;
}
/**
?10??decNumber???newBase??????newNumber????????????
*/
int changeDec2NewBase(int decNumber, int newBase, char * newNumber) {
int bitValue[100]; //???????????????????
int length=0; //???????
while (decNumber/newBase > 0) {
bitValue[length++] = decNumber%newBase; //??
decNumber /= newBase;
}
bitValue[length++] = decNumber; //??????
//????bitValue????????newNumber
for (int i=length-1,j=0; i>=0; i--,j++) {
int currentBit = bitValue[i];
if (currentBit < 10)
newNumber[j]=currentBit+'0';
else
newNumber[j]=currentBit+'A'-10;
}
return length;
}
int main()
{
int originBase; //????
int newBase; //???
char number[100]; //????????
char newNumber[100]; //??????
cin >> originBase >> number >> newBase;
int len_number = strlen(number); //????????
int len_newNumber; //????????
int decNumber = change2Dec(number, len_number, originBase); //?originBase????number???int??decNumber
len_newNumber = changeDec2NewBase(decNumber, newBase, newNumber); //?int?decNumber???newBase???????newNumber????
newNumber[len_newNumber] = NULL;
cout << newNumber << endl;
return 0;
}
|
55 | 27320 | int main()
{
int a,b,i=0,k=0,len;
char n[100],m[100];
cin>>a>>m>>b;
len=strlen(m);
for(i=0;m[i]!='\0';i++)
{
k*=a;
if(m[i]>='a'&&m[i]<='z')
k+=m[i]-'a'+10;
else if(m[i]>='A'&&m[i]<='Z')
k+=m[i]-'A'+10;
else if(m[i]>='0'&&m[i]<='9')
k+=m[i]-'0';
}
i=0;
n[0]='0';
n[1]='\0';
while(k!=0)
{
if(k%b<=9)
{
n[i++]='0'+k%b;
k=k/b;
}
else
{
n[i++]='A'+k%b-10;
k=k/b;
}
}
if(i!=0)
n[i]='\0';
len=strlen(n);
for(i=len-1;i>=0;i--)
{
cout<<n[i];
}
cout<<endl;
return 0;
} |
55 | 27321 | int main ()
{
long b,c,i,j,d=0,z[100],sum=0,k;
char a[100],s[36];
for (i=0;i<36;i++)
{
if(i>=0&&i<=9)
s[i]=i+48;
else
s[i]=i+55;
}
scanf ("%d %s %d",&b,a,&c);
d=strlen(a);
for (i=0;i<d;i++)
{
if (a[i]<123&&a[i]>96)
a[i]=a[i]-32;
}
for (i=0;i<d;i++)
{
for(j=0;j<36;j++)
{
if (a[i]==s[j])
sum=sum+j*pow(b,d-1-i);
}
}
for (i=0;i>=0;i++)
{
if (sum==0)
{
k=i;
break;
}
else
{
z[i]=sum%c;
sum=sum/c;
}
}
for(i=k-1;i>=0;i--)
printf("%c",s[z[i]]);
if (a[0]=='0')
printf("%c",a[0]);
return 0;
} |
55 | 27322 | int xToTen(int x, char c[])
{
int i, lenth, ten, num;
lenth = strlen(c);
for(i = 0, ten = 0; i < lenth; i++)
{
if(c[i] >= '0' && c[i] <= '9')
num = c[i] - '0';
if(c[i] >= 'A' && c[i] <= 'Z')
num = c[i] - 'A' + 10;
if(c[i] >= 'a' && c[i] <= 'z')
num = c[i] - 'a' + 10;
ten = ten * x + num;
}
return (ten);
}
void tenToYout(int ten, int y)
{
int a[100];
int i, lenth;
for(lenth = 0; ten >= y; lenth++)
{
a[lenth] = ten % y;
ten /= y;
}
a[lenth] = ten;
for(i = lenth; i >= 0; i--)
{
if(a[i] < 10)
cout << a[i];
else
cout << (char)(a[i] - 10 + 'A');
}
cout << endl;
}
int main()
{
char c[100];
int x, y;
cin >> x >> c >> y;
tenToYout (xToTen(x, c), y);
return 0;
}
|
55 | 27323 | int main()
{
int a,b;
char n[100];
scanf("%d %s %d",&a,n,&b);
int c[100];
int e[100];
int d=0; //n??????
int i,j;
for(i=0;i<100&&n[i]!='\0';i++)
{
if(n[i]>='a'&&n[i]<='z')
c[i]=n[i]-'a'+10;
else if(n[i]>='A'&&n[i]<='Z')
c[i]=n[i]-'A'+10;
else if(n[i]>='0'&&n[i]<='9')
c[i]=n[i]-'0';
d=d*a+c[i];
}
if(d==0)
printf("%d",d);
for(i=0;i<100&&d!=0;i++)
{
e[i]=d%b;
d=d/b;
}
for(j=0;j<i;j++)
{
if(e[i-j-1]<=9&&e[i-j-1]>=0)
n[j]=e[i-j-1]+'0';
else if(e[i-j-1]>=10)
n[j]=e[i-j-1]-10+'A';
}
n[i]='\0';
puts(n);
getchar();
getchar();
getchar();
getchar();
}
|
55 | 27324 | main()
{
int a=0,b=0,m=0,j=0,i=0,k=0,l=0,y=0;
char n[1000],o[1000];
for(j=0;j<=1000;j++)
{o[j]='\0';}
scanf("%d %s %d",&a,n,&b);
//strlwr(n);
for(j=0;n[j]!='\0';j++)
if(n[j]>='A'&&n[j]<='Z')
n[j]=n[j]-'A'+'a';
//j=strlen(n);
for(i=0;i<j;i++)
{
if(n[i]>='a'&&n[i]<='z')
n[i]=n[i]-'a'+10;
else if(n[i]>='0'&&n[i]<='9')
n[i]=n[i]-'1'+1;
}
for(i=0;i<j;i++)
{
k=n[i];
for(l=0;l<(j-i-1);l++)
{
k=k*a;
}
m=m+k;
}
//printf("%d",m);
do
{
for(y=1;o[y]!='\0';y++);
//y=strlen(o);
for(i=y;i!=0;i--)
{
o[i]=o[i-1];
}
o[0]=m%b;
if(o[0]=='\0')
o[0]=46;
m=(int)m/b;
}
while(m!=0);
y=strlen(o);
for(i=0;i<y;i++)
{
if(o[i]>=10&&o[i]<=36)
o[i]=o[i]-10+'A';
else if(o[i]>=0&&o[i]<=9)
o[i]=o[i]-1+'1';
else if(o[i]==46)
o[i]='0';
}
printf("%s",o);
return 0;
}
|
55 | 27325 | void shuchu(int c[], int i)
{
int j;
for(j = i - 1 ; j >= 0 ; j--)
{
if(c[j] >= 0 && c[j] <= 9)
{
cout << c[j];
}
if(c[j] >= 10)
{
cout << (char)(c[j] + 55);
}
}
cout << endl;
}
int main()
{
char str1[10000], str2[10000], l;
int i, j, num[10000] = {0}, sum = 0, c[10000] = {0}, nlen, k;
double before , after;
memset(str1, ' ', sizeof(str1));
memset(str2, ' ', sizeof(str2));
cin >> before;
cin >> str1;
cin >> after;
nlen = strlen(str1);
for(i = 0 ; i < nlen ; i++)
{
if(str1[i] >= 97 && str1[i] < 122)
{
str1[i] = (char)toupper(str1[i]);
}
if(str1[i] >= 65 && str1[i] <= 90)
{
num[i] = str1[i] - '7';
}
else
num[i] = str1[i] - '0';
}
k = nlen - 1;
for(i = 0 ; i < nlen ; i++)
{
sum = sum + num[i] * pow(before, k);
k--;
}
i = 0;
do
{
c[i] = sum % (int)after;
sum = sum / after;
i++;
}while(sum > 0);
shuchu(c, i);
return 0;
}
|
55 | 27326 | int main() {
int a, b, ten = 0;
char num[1000];
char num1[1000];
cin >> a >> num >> b;
for ( int i = 0; i < strlen(num); i ++ ) {//??????????????
if ( num[i] >= (int)'A' && num[i] <= (int)'Z')
num[i] += 32;
}
for ( int i = 0; i < strlen(num); i ++ ) { //????????????
if ( num[i] >= (int)'a' && num[i] <= (int)'z')
ten += ( (int)num[i] - 87 ) * pow( (double)a , (double)strlen(num) - 1 - i) ;
else if ( num[i] >= (int)'1' && num[i] <= (int)'9')
ten += ( (int)num[i] - 48 ) * pow( (double)a , (double)strlen(num) - 1 - i) ;
}
if ( ten == 0 ) cout << 0; //????? ??0
else {
int j = 0;
for ( ; ; ){ //?????????b???
if ( ten == 0 ) break;
if ( ten % b < 10 ) num1[j] = (char)(ten % b + 48);
else num1[j] = (char)(ten % b + 55 );
ten = ten / b;
j ++;
}
for ( int i = j - 1; i >= 0; i -- ) {
cout << num1[i]; //??
}
}
return 0;
}
|
55 | 27327 | int power(int,int);
int main ()
{
char number1[100],number2[100];
int i,first,second,ten=0,l1,l2=0,remain;
cin >> first ;
cin.get();
cin.getline(number1,100,' ');
cin >> second;
l1=strlen(number1);
for (i=0;i<l1;i++)
{
if (number1[i]>='a'&&number1[i]<='z')
ten=(number1[i]-'a'+10)*(int)(power(first,l1-i-1))+ten;
if (number1[i]>='A'&&number1[i]<='Z')
ten=(number1[i]-'A'+10)*(int)(power(first,l1-i-1))+ten;
if (number1[i]>='0'&&number1[i]<='9')
ten=(number1[i]-'0')*(int)(power(first,l1-i-1))+ten;
} //??????
remain=ten;
while (remain!=0)
{
remain=remain/second;
l2++;
}
if (ten==0)
l2=1;
for (i=0;i<l2;i++)
{
number2[i]=ten/(int)(power(second,l2-i-1));
ten=ten-number2[i]*(int)(power(second,l2-i-1));
if (number2[i]>=10)
number2[i]=number2[i]-10+'A';
else
number2[i]=number2[i]+'0';
}
number2[l2]='\0';
cout << number2 << endl;
return 0;
}
int power(int a,int b)
{
int i,sum = 1;
for(i = 1; i <= b; i++)
sum = sum * a;
return sum;
}
|
55 | 27328 | int main()
{
long a,b,c=0,k,i;
char an[100],*p,bn[100]="";
scanf("%d %s %d",&a,an,&b);
for(p=an;*p!='\0';p++)
{
if((*p>='a')&&(*p<='z'))
c=c*a+*p-87;
if((*p>='A')&&(*p<='Z'))
c=c*a+*p-55;
if((*p>='0')&&(*p<='9'))
c=c*a+*p-48;
}
for(i=0;c>=b;i++)
{
k=c%b;
c=c/b;
if((k>=0)&&(k<9)) bn[i]=k+48;
else
bn[i]=k+55;
}
if((c>=0)&&(c<9)) bn[i]=c+48;
else
bn[i]=c+55;
for(;i>=0;i--)
printf("%c",bn[i]);
return 0;
} |
55 | 27329 | 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 | 27330 | /*
* ???: 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 | 27331 | void main()
{
int a,b,i,p,q;
char n[100],out[100];
char c;
long m,k;
scanf("%d%s%d",&a,n,&b);
for(i=0;(c=n[i])!='\0';i++)
{
if(c>='A'&&c<='Z')
q=c-55;
else if(c>='a'&&c<='z')
q=c-87;
else
q=c-48;
if(i!=0)
m=a*m+q;
else
m=q;
}
for(i=0;(k=m/b)!=0;i++)
{
p=m%b;
m=m/b;
if(p<10)
out[i]=p+48;
else
out[i]=p+55;
}
p=m%b;
if(p<10)
out[i]=p+48;
else
out[i]=p+55;
for(;i>=0;i--)
printf("%c",out[i]);
} |
55 | 27332 | int main()
{
int a,b,i,n=0,t=0,sum;
char s[1000];
int q[1000];
int p[1000];
char m[1000];
scanf("%d %s %d",&a,s,&b);
for(i=0;s[i]!='\0';i++)
n=n+1;
for(i=0;i<=n-1;i++)
{
if(s[i]>'9')
{
if(s[i]>'Z')
s[i]=s[i]-'a'+10;
else
s[i]=s[i]-'A'+10;
}
else
s[i]=s[i]-'0';
}
sum=1;
for(i=n-1;i>=0;i--)
{
t=s[i]*sum+t;
sum=sum*a;
}
if(t==0)
printf("0");
q[0]=t;
for(i=0;q[i]!=0;i++)
q[i+1]=q[i]/b;
for(i=0;q[i]!=0;i++)
{
p[i]=q[i]%b;
if(p[i]>9)
p[i]=p[i]-10+'A';
else
p[i]=p[i]+'0'-0;
}
p[i]='\0';
n=0;
for(i=0;p[i]!='\0';i++)
n=n+1;
for(i=0;i<=n-1;i++)
m[i]=p[n-i-1];
m[n]='\0';
printf("%s",m);
getchar();
getchar();
} |
55 | 27333 | void main()
{
char num[50];
int answer=0,i,j,a,b,n,an[50];
scanf("%d%s%d",&a,num,&b);
n=strlen(num);
for(i=0;i<n;i++)
{
if(num[i]>47&&num[i]<58)
answer=answer+(num[i]-48)*pow(a,n-i-1);
if(num[i]>64&&num[i]<91)
answer=answer+(num[i]-55)*pow(a,n-i-1);
if(num[i]>96&&num[i]<123)
answer=answer+(num[i]-87)*pow(a,n-i-1);
}
for(j=0;;j++)
{
i=answer%b;
answer=(answer-i)/b;
if(i>=0&&i<10)
an[j]=i+48;
if(i>=10)
an[j]=i+55;
if(answer==0)
break;
}
for(i=j;i>=0;i--)
printf("%c",an[i]);
} |
55 | 27334 | char a[32];
int b[32];
char trans[36]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R',
'S','T','U','V','W','X','Y','Z'};
int main()
{
int n,m;
int i,j,k;
long int mid;
int ar;
cin>>n>>a>>m;
int len=strlen(a);
for(k=0;k<len;k++)
{
if((a[k]>='0')&&(a[k]<='9'))
a[k]-='0';
if((a[k]>='a')&&(a[k]<='z'))
a[k]=a[k]-'a'+10;
if((a[k]>='A')&&(a[k]<='Z'))
a[k]=a[k]-'A'+10;
}
mid=0;
ar=1;
for(j=len-1;j>=0;j--)
{
mid+=a[j]*ar;
ar*=n;
}
k=0;
while(mid!=0)
{
b[k]=mid%m;
mid=mid/m;
k++;
}
for(i=k-1;i>=0;i--)
if(b[i]!=-1)
cout<<trans[b[i]];
cout<<'\n';
return 0;
}
|
55 | 27335 |
int main(int argc, char* argv[])
{
unsigned int a,b,n;
char num[100]={0};
cin>>a>>num>>b;
int i;
unsigned int s=0;
n=strlen(num);//?????
for(i=0;i<n;i++)
{
if(num[i]>='a')
num[i]=num[i]-87;
else if(num[i]>='A')
num[i]=num[i]-55;
else
{
num[i]=num[i]-48;
}
s=(int)(s+num[i]*pow((double)a,(double)(n-i-1)));//??
}
//cout<<s<<endl;
char m[100];
int j=0;
for(j=0;s>0;j++)
{
m[j]=s%b;
s=s/b;
if(m[j]>9)
m[j]=m[j]+55;
else
m[j]=m[j]+48;
}
if(j == 0 )
cout<<0;
else
for(j=j-1;j>=0;j--)
cout<<m[j];
return 0;
} |
55 | 27336 | 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 | 27337 | int main(int argc, char* argv[])
{
long b,i,c,d,e=0,f;
char a[50],s[50];
long z[50];
scanf("%d%s%d",&b,a,&c);
d=strlen(a);
for(i=0;i<d;i++)
{
if(a[i]>='0'&&a[i]<='9')
z[i]=a[i]-48;
else if(a[i]>='A'&&a[i]<='Z')
z[i]=a[i]-55;
else if(a[i]>='a'&&a[i]<='z')
z[i]=a[i]-87;
}
for(i=0;i<d;i++)
{
for(f=0;f<d-i-1;f++)
z[i]=z[i]*b;
}
for(i=0;i<d;i++)
{
e=e+z[i];
}
for(i=0;;i++)
{
s[i]=e%c+48;
e=e/c;
if(e==0)
break;
}
long w;
w=i+1;
char t[50];
for(i=0;i<w;i++)
{
if(s[i]>'9')
s[i]=s[i]+7;
}
for(i=0;i<w;i++)
{
t[w-1-i]=s[i];
}
int y;
y=strlen(t);
for(i=0;i<w;i++)
{
if(t[i]!='\0')
printf("%c",t[i]);
else break;
}
return 0;
}
|
55 | 27338 | //????a?
long long nta(long long a)
{
if(a>=10)
{
char b;
b=(char)('A'-10+a);
return ((char) (b));
}
else
{
char b;
b=(char)('1'-1+a);
return ((char) (b));
}
}
//a????
long long atn(char i)
{
long long j=i;
if(j>96)
{
j=j-'a'+10;
}
else
{ if ((j>33)&&(j<58))
{
j=j-'1'+1;
}
else
{
j=j-'A'+10;
}
}
return((long long)(j));
}
//???????
long long ten(long long k)
{
long long l,m;
l=k;
for (long long n = 0; n < 69; n++)
{
l=l/10;
if (l>0)
{
m=n+1;
}
}
return (m);
}
//??e??
long long loe(long long t,long long v)
{
long long u,w=0;
u=t;
for (long long x = 0; x < 69; x++)
{
u=u/v;
if (u>0)
{
w=x+1;
}
}
return (w);
}
//??????
long long lth(char o[])
{
long long f=0;
for (long long g = 0; g <69 ; g++)
{
if((o[g]!=0)&&(o[g]!=32))f=f+1;
}
return ((f));
}
int main()
{
long long d,e;
char h[70];
memset(h,0,sizeof(h));
cin>>d>>h>>e;
long long p;
p=lth(h);
long long s=0;
long long ae[100];
ae[0]=1;
for (long long af= 1; af< 20; af++)
{
ae[af]=ae[af-1]*d;
}
for (long long q = p-1; q >=0 ; q--)
{
s=s+(atn(h[q])*ae[p-1-q]);
}
long long y;
y=(loe(s,e));
char aa[70];
memset(aa,0,sizeof(aa));
long long ab=s,ac=0;
for (long long z = 0; z < y+1; z++)
{
ac=ab;
ab=ab/e;
if (ab>0)
{
aa[z]=nta(ac%e);
}
else
{
aa[z]=nta(ac);
}
}
for (long long ad = 0; ad < y+1; ad++)
{
cout<<aa[y-ad];
}
return 0;
} |
55 | 27339 | int main()
{
char N1[32];
int N2[32];
int N3[32];
int a,b,n=0;
cin>>a;
cin>>N1;
cin>>b;
int len1=strlen(N1);
for(int i=0;i<len1;i++)
{
if(N1[i]>='a'&&N1[i]<='z')
N1[i]-=('a'-'A');
if(N1[i]>='A'&&N1[i]<='Z')
N3[i]=N1[i]-'A'+10;
else
N3[i]=N1[i]-'0';
}
for(int i=0;i<len1;i++)
n=n * a+N3[i];
if(n==0)
{
cout<<0<<endl;return 0;}
int j;
for(j=0;n!=0;j++)
{
N2[j]=n%b;
n=n/b;
}
for(j --;j>=0;j--)
if (N2[j] < 10)
cout<<N2[j];
else
cout << (char)(N2[j] - 10 + 'A');
return 0;
}
|
55 | 27340 | main()
{
char c[40];
int a,b,x,i,l,k;
scanf("%d %s %d",&a,c,&b);
l=strlen(c);
if (c[0]=='0')
printf("0\n");
else
{
for (i=0;i<l;i++)
{
if (c[i]>='A'&&c[i]<='Z')
c[i]=c[i]-'A'+'a';
}
x=0;
int d;
for(i=0;i<l;i++)
{
if (c[i]>='a')
d=c[i]-'a'+10;
else
d=c[i]-'0';
x=d+x*a;
}
char e[40];
for(k=0;x!=0;k++)
{
e[k]=x%b;
x=x/b;
}
e[k]='\0';
char f[40];
for(i=0;i<k;i++)
{
if (e[i]<10)
f[k-1-i]=e[i]+'0';
else
f[k-1-i]=e[i]+'A'-10;
}
f[k]='\0';
printf("%s",f);
}
getchar();
getchar();
} |
55 | 27341 |
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 | 27342 | int main()
{
int a,b,temp,i;
long s=0,l=1;
char n[20000],m[20000];
scanf("%d%s%d",&a,n,&b);
int len = strlen(n);
for (i=len-1; i>=0; l*=a,i--)
{
if (n[i]<='9' && n[i]>='0')
s+=(n[i]-'0')*l;
else if(n[i]>='a' && n[i]<='z')
s+=(n[i]-'a'+10)*l;
else
s+=(n[i]-'A'+10)*l;
}
for (i=0;s>0;i++)
{
temp=s%b;
s=s/b;
if (temp>9)
m[i]=(char)'A'+temp-10;
else
m[i]=(char)'0'+temp;
}
for (i--;i>=0;i--)
{
printf("%c",m[i]);
}
printf("\n");
return 0;
} |
55 | 27343 | main()
{
int a,b;
int i,m=0;
long int n=0;
char w;
int f;
char s[64];
char t[64];
char *p;
char *r;
p=s;
r=t;
scanf("%d",&a);
scanf("%s",s);
scanf("%d",&b);
while ((*p)!='\0')
{
if ((*p)>='A'&&(*p)<='Z')
n=n*a+((*p)-'A'+10);
else if ((*p)>='a'&&(*p)<='z')
n=n*a+((*p)-'a'+10);
else if((*p)>='0'&&(*p)<='9')
n=n*a+((*p)-'0');
p++;
}
if (n==0)
printf("%d",n);
while(n!=0)
{
f=n%b;
n=n/b;
if (f>9)
*r='A'+f-10;
else *r=f+'0';
r++;
m++;
}
for(i=0;i<m/2;i++)
{
w=t[i];
t[i]=t[m-1-i];
t[m-1-i]=w;
}
for(i=0;i<m;i++)
{
printf("%c",t[i]);
}
}
|
55 | 27344 | int main()
{
int n,a,b,i,k=-1,dec=0,temp[33];
char num[33],result[33];
cin>>a>>num>>b;
n=strlen(num);
for(i=0;i<n;i++)
{
if(num[i]>='A'&&num[i]<='Z')
num[i]=num[i]+'a'-'A';
}
for(i=0;i<n;i++)
{
if(num[i]>='a'&&num[i]<='z')
dec=dec*a+(num[i]-'a'+10);
else
dec=dec*a+(num[i]-'0');
}
if(dec==0)
cout<<'0'<<endl;
else
while(dec>0)
{
k=k+1;
temp[k]=dec%b;
dec=(dec-dec%b)/b;
}
for(i=k;i>=0;i--)
{
if(temp[i]<10)
result[i]=temp[i]+'0';
else
result[i]=temp[i]+'A'-10;
cout<<result[i];
}
cout<<endl;
return 0;
}
|
55 | 27345 | 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 | 27346 | int main()
{
int a,b,n=0,c,i;
char d[100];
cin>>a;
cin.get();
while((c=cin.get())!=' ')
{
if(48<=c&&c<=57) c=c-48;
if(65<=c&&c<=90) c=c-55;
if(97<=c&&c<=122) c=c-87;
n=n*a+c;
}
cin>>b;
if(n==0) cout<<'0'<<endl;
for(i=1; n!=0; i++)
{
d[i]=n%b;
n=n/b;
}
for(i=i-1; i>=1; i--)
{
if(0<=d[i]&&d[i]<=9) d[i]=d[i]+48;
else d[i]=d[i]+55;
cout<<d[i];
}
cout<<endl;
return 0;
}
|
55 | 27347 | void main()
{
long int i,m,k,s,c[32],a,b;char n[32];
scanf("%d%s%d",&a,n,&b);
m=0;s=1;k=0;i=31;
while(i>=0)
{
if(n[i]>=48)
{
if(n[i]>=97)n[i]=n[i]-87;
else if(n[i]>=65)n[i]=n[i]-55;
else n[i]=n[i]-48;
m=n[i]*s;
s=s*a;
k=k+m;
}
i--;
}
i=0;
do
{
c[i]=k%b;
k=k/b;
i++;
}while(k!=0);
for(--i;i>=0;i--)
{
if(c[i]>9)printf("%c",c[i]+55);
else printf("%d",c[i]);
}
printf("\n");
}
|
55 | 27348 | 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 | 27349 |
int main()
{
int a,b,num=0;
char c1[100],c2[100];
cin>>a>>c1>>b;
if( c1[0]=='0' )
{
cout<<0;
}
for( int i=0 ; i<strlen(c1) ; i++ )
{
if( c1[i]>='a' && c1[i]<='z' )
{
c1[i]=c1[i]-'a'+10;
}
else if( c1[i]>='A' && c1[i]<='Z' )
{
c1[i]=c1[i]-'A'+10;
}
else if( c1[i]>='0' && c1[i]<='9' )
{
c1[i]-='0';
}
num=a*num+c1[i];
}
// cout<<num<<endl;
int i=0;
while( num>0 )
{
c2[i]=num%b;
num=num/b;
if( c2[i]<=9 )
{
c2[i]+='0';
}
else if( c2[i]>=10 )
{
c2[i]+='A'-10;
}
i++;
}
c2[i]='\0';
for( int i=strlen(c2)-1 ; i>=0 ; i-- )
{
cout<<c2[i];
}
} |
55 | 27350 | main()
{
int a,n,b,i,j;
int l;
int sum=0;
char c[40];
int d[40];
char e[40];
char f[40];
scanf("%d %s %d",&a,c,&b);
l=strlen(c);
if(c[0]=='0')
printf("0");
else
{
for(i=0;i<l;i++)
{
if(c[i]>='A'&&c[i]<='Z')
c[i]=c[i]-'A'+'a';}
for(i=0;i<l;i++)
{
if(c[i]>='a')
d[i]=c[i]-'a'+10;
else
d[i]=c[i]-'0';
sum=sum*a+d[i];
}
for(i=0;sum!=0;i++)
{
e[i]=sum%b;
sum=sum/b;
if(e[i]>9)
e[i]=e[i]-10+'A';
else
e[i]=e[i]+'0';
}
for(j=0;j<=i;j++)
f[j]=e[i-j-1];
f[i]='\0';
printf("%s",f);
getchar();
getchar();
}
}
|
55 | 27351 | const long maxL=300;
long a,b;
char str[maxL+10];
long from[maxL+10],to[maxL+10];
long ans[maxL+10];
main(){
long i,j,k,L,x;
scanf("%ld%s%ld",&a,str,&b);
L=strlen(str);
for(i='0';i<='9';i++){
from[i]=i-'0';
to[i-'0']=i;
}
for(i='a';i<='z';i++)from[i]=i-'a'+10;
for(i='A';i<='Z';i++){
from[i]=i-'A'+10;
to[i-'A'+10]=i;
}
x=0;
for(i=0;i<L;i++){
x*=a;
x+=from[str[i]];
}
L=0;
while(x){
ans[++L]=x%b;
x/=b;
}
if(L==0)ans[++L]=0;
for(i=L;i>=1;i--){
printf("%c",to[ans[i]]);
}
printf("\n");
return 0;
}
|
55 | 27352 | int ston(char x[],int y,int);
void ntos(char x[],int y,int z);
void main()
{
char in[100]="\0",out[100]="\0";
int i,d,exp1,exp2,l;
scanf("%d %s %d",&exp1,in,&exp2);
l=strlen(in);
for(i=0;i<l;i++)
if(in[i]<='z'&&in[i]>='a')in[i]=in[i]+'A'-'a';
d=ston(in,exp1,l);
ntos(out,exp2,d);
for (i=0;i<=strlen(out)-1;i++)
{
if(out[i]>=10+'0')out[i]=out[i]+'A'-10-'0';
}
puts(out);
}
int ston(char x[],int y,int l)
{
int z=0;
int i;
for(i=0;i<l;i++)
{
if(*(x+i)<='Z'&&*(x+i)>='A')x[i]=x[i]-'A'+10;
else *(x+i)=*(x+i)-'0';
}
for(i=1;i<=l;i++)
{
z=z*y+x[i-1];
}
return(z);
}
void ntos(char x[],int y,int z)
{
if(z<y)x[0]=z+'0';
else
{
ntos(x,y,z/y);
x[strlen(x)]=z%y+'0';
}
} |
55 | 27353 | char str[50],ans[50];
int main()
{
int i,j,k,l,length,num,x;
long m,n,ten=0,ten2=0;
scanf("%ld%s%ld",&n,str,&m);
length=strlen(str);
for(i=0;i<length;i++)
{
x=1;
if((str[i]>='a')&&(str[i]<='z')) num=str[i]-87;
else if((str[i]>='A')&&(str[i]<='Z')) num=str[i]-55;
else num=str[i]-48;
for(j=0;j<(length-i-1);j++)
{
x=x*n;
}
ten=ten+x*num;
}
if(ten==0) printf("0\n");
else
{
for(k=0;(ten!=0);k++)
{
ten2=ten;
ten=ten/m;
ans[k]=ten2-ten*m+48;
}
for(l=0;l<k;l++)
{
if(l!=(k-1))
{
if(ans[k-l-1]>'9') {ans[k-l-1]=ans[k-l-1]+7;printf("%c",ans[k-l-1]);}
else printf("%c",ans[k-l-1]);
}
else
{
if(ans[k-l-1]>'9') {ans[k-l-1]=ans[k-l-1]+7;printf("%c\n",ans[k-l-1]);}
else printf("%c\n",ans[k-l-1]);
}
}
}
return 0;
}
|
55 | 27354 | int b;
void main()
{ void PF(int k);
int a; char n[10];int i,len;
scanf("%d %s %d",&a,n,&b);
len=strlen(n);
int sum=0;
for(i=0;i<len;i++)
{
if(n[i]>='0'&&n[i]<='9')
sum=sum*a+n[i]-'0';
else
if(n[i]>='a'&&n[i]<='z')
sum=sum*a+n[i]-'a'+10;
else
sum=sum*a+n[i]-'A'+10;
}
PF(sum);
}
void PF(int k)
{
if(k<b)
{
if(k>=0&&k<=9)
printf("%c",k+'0');
else
printf("%c",k-10+'A');
}
else
{
PF(k/b);
if(k%b>=0&&k%b<=9)
printf("%c",k%b+'0');
else
printf("%c",k%b-10+'A');
}
}
|
55 | 27355 | int main()
{
long mizhi(int input1,int input2);
long a,b,temp,temp1=0,temp2,temp3;
int n,i,j,k=0;
char str[1000];
scanf("%d%s%d",&a,&str,&b);
n=strlen(str);
for(i=0;i<n;i++)
{
if(str[i]>=65&&str[i]<=90)
{
temp2=str[i]-55;
}
else if(str[i]>=97&&str[i]<=122)
{
temp2=str[i]-87;
}
else if(str[i]>=48&&str[i]<=57)
{
temp2=str[i]-48;
}
temp1=temp1+temp2*mizhi(a,n-1-i);
}
temp=temp1;
for(j=0;;j++)
{
if(temp<b)
{
break;
}
else
{
temp=temp/b;
k++;
}
}
for(i=0;i<=k;i++)
{
if(temp1>=b)
{
if(temp1/mizhi(b,k-i)<=9)
{
printf("%ld",temp1/mizhi(b,k-i));
temp1=temp1%mizhi(b,k-i);
}
else
{
printf("%c",55+temp1/mizhi(b,k-i));
temp1=temp1%mizhi(b,k-i);
}
}
else if(temp1<b&&k-i!=0)
{
printf("0");
}
else
{
if(temp1<=9)
{
printf("%ld",temp1);
}
else
{
printf("%c",55+temp1);
}
break;
}
}
}
long mizhi(int input1,int input2)
{
int z=1,k=1;
if(input2==0)
{
return(1);
}
else
{
do
{
z=z*input1;
k++;
}while(k<=input2);
}
return(z);
} |
55 | 27356 | int main()
{
int a, b, sum=0, i, l, p[100];
char s[100],q[100];
cin >> a;
scanf("%s",s);
cin >> b;
l = strlen(s);
for(i=0;i<l;i++)
{
if(s[i]>='a')
sum = sum * a + (s[i] - 87);
else
{
if(s[i]>='A'&&s[i]<='Z')
sum = sum * a + (s[i] - 55);
else
sum = sum * a + (s[i] - 48);
}
}
if(sum==0)
cout <<"0";
else
{
for(i=0;sum;i++)
{
p[i] = sum % b;
if(p[i]<10)
q[i] = p[i] + 48;
else
q[i] = p[i] + 55;
sum = sum / b;
}
for(i--;i>=0;i--)
cout << q[i];
}
return 0;
} |
55 | 27357 | int v(int y,int z)
{
int k=1,j;
for(j=0;j<z;j++)
k=k*y;
return(k);
}
void main()
{
int n,m,i,k,l;
char a[100],b[200];
long x=0;
scanf("%d %s %d",&n,a,&m);
l=strlen(a);
for(i=l-1;i>=0;i--)
{
if(a[i]>='0'&&a[i]<='9')
x=x+(a[i]-'0')*v(n,l-1-i);
else x=x+((a[i]-'A')%('a'-'A')+10)*v(n,l-1-i);
}
for(i=0;;i++)
{
if(x%m>=0&&x%m<=9)
b[i]=x%m+'0';
else
b[i]=x%m-10+'A';
x=(x-x%m)/m;
if(x==0)
break;
}
for(k=i;k>=0;k--)
printf("%c",b[k]);
} |
55 | 27358 | //???? ??? 12858
long int turntoten (int a,char n[]) //?n???a???10?????c?
{
long int ans = 0;
int i,l,lc,w;
l = strlen(n);
lc = 1;
for (i = l-1; i >= 0; i--)
{
if ((n[i] >= '0') && (n[i] <= '9'))
w = n[i] - '0';
if ((n[i] >= 'a') && (n[i] <= 'z'))
w = n[i] - 'a' + 10;
if ((n[i] >= 'A') && (n[i] <= 'Z'))
w = n[i] - 'A' + 10; //?w??n??????
ans += w * lc;
lc *= a;
}
return ans;
}
void turntob (int b,long int c)
{
char ans[100];
int j,i = 0,ys = 0;
if (c == 0) cout << 0;
while (c > 0) //???????????b???
{
ys = c % b;
if (ys >= 10)
ans[i] = (char) 55 + ys;
else
ans[i] = (char) 48 + ys;
i++;
c = c / b;
}
for (j = i-1; j >= 0; j--)
cout << ans[j]; //????
}
int main()
{
int a,b;
long int c; //c?n???????
char n[100];
cin >> a >> n >> b;
c = turntoten (a,n);//?n???a???10?????c?
turntob (b,c); //?c???b??????
cout << endl;
return 0;
} |
55 | 27359 |
void up(char *input)
{
while (*input)
{
if (((*input)>='a')&&((*input)<='z')) *input-=32;
input++;
}
}
int main()
{
char chart[]="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int src=0,dst=0;
int i;
long int result=0;
char input[100],output[MAX],*curr;
scanf("%d %s %d",&src,input,&dst);
up(input);
for(i=0;input[i];i++)
{
if (input[i]>='A')
result=result*src+input[i]-'A'+10;
else result=result*src+input[i]-'0';
}
output[MAX-1]=0;
curr=&(output[MAX-1]);
do
{
curr--;
*curr=chart[result%dst];
result/=dst;
}while (result);
printf("%s",curr);
return 0;
} |
55 | 27360 | int main()
{
char numa[100],numb[100];//???a???b??
long na[100],nb[100];
long a,b;
cin>>a>>numa>>b;
long digit_a=0;
long m=1,j;
while(numa[digit_a]!=0)
digit_a++;
//??a??????
for(j=1;j<digit_a;j++)
m=m*a;
long i;
long numd=0;
for(i=0;i<digit_a;i++)
{
if((numa[i]>='a')&&(numa[i]<='z'))
na[i]=numa[i]-87;
if((numa[i]>='A')&&(numa[i]<='Z'))
na[i]=numa[i]-55;
if((numa[i]>='0')&&(numa[i]<='9'))
na[i]=numa[i]-48;
numd=numd+m*na[i];
m=m/a;
}
//???????numd
if(numd==0)
cout<<0<<endl;
long k=0;
while(numd!=0)
{
nb[k]=numd%b;
numd=numd/b;
if((nb[k]>=0)&&(nb[k]<=9))
numb[k]=nb[k]+48;
else
numb[k]=nb[k]+55;
k++;
}
//k?b??????
long t;
for(t=k-1;t>=0;t--)
cout<<numb[t];
return 0;
}
|
55 | 27361 | 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 | 27362 |
int main(int argc, char* argv[])
{
char a[3],b[100],c[3],after[100],strtmp,after1[100];
int before=0 ;
int n1,n2,i,n,A[100],tmp,m;
scanf ("%s %s %s",a,b,c);
n1=atoi (a);
n2=atoi (c);
n=strlen (b);
//printf ("%d\n%d\n",n1,n2);
for (i=0;i<n;i++)
{
if (b[i]>='a'&&b[i]<='z')
b[i]=b[i]-32;
if (b[i]>='0'&&b[i]<='9')
A[i]=b[i]-48;
if (b[i]>='A'&&b[i]<='Z')
A[i]=b[i]-55;
//printf ("%d\n",A[i]);
}
for (i=0;i<n;i++)
{
before = before*n1+A[i];
}//printf ("%d\n",before);
if (before==0)
{after1[0]='0';after1[1]='\0';}
else {
for (i=0;i<100;i++)
{
if (before<1)
break;
else
{
tmp=before%n2;
before=before/n2;
if(tmp>=10)
strtmp=tmp+55;
else
strtmp=tmp+48;
after[i]=strtmp;
}
}
after[i]='\0';
//puts (after);
m=strlen (after);
//printf ("%d\n",m);
for (i=0;i<m;i++)
{
after1[i]=after[m-i-1];
}
after1[i]='\0';}
puts (after1);
return 0;
} |
55 | 27363 |
char CHR[120];
int p1,p2,p3,num;
int deal(char Q)
{
if ((Q>='0')&&(Q<='9')) return Q-'0';
if ((Q>='A')&&(Q<='Z')) return Q-'A'+10;
return -1;
}
char laed(int Q)
{
if ((Q>=0)&&(Q<=9)) return '0'+Q;
if (Q>9) return 'A'+Q-10;
}
void output(int ans)
{
if (ans==0) return;
else
{
output(ans/p3);
cout<<laed(ans%p3);
}
}
int main()
{
cin>>p1;cin.get();
p2=0;num=0;
while ((CHR[p2]=cin.get())!=' ')
{
if ((CHR[p2]>='a')&&(CHR[p2]<='z')) CHR[p2]=CHR[p2]-'a'+'A';
num=num*p1+deal(CHR[p2]);
p2++;
}
cin>>p3;
if (num==0) cout<<0;
else output(num);
cout<<endl;
return 0;
}
|
55 | 27364 | 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 | 27365 | 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 | 27366 | void main()
{
int a1,a2,i,len,j;
unsigned long t=0,n[40],k;
char num1[40];
scanf("%d%s%d",&a1,&num1,&a2);
len=strlen(num1);
for(i=len-1,j=0;i>=0;i--,j++)
{
if(num1[i]>='A'&&num1[i]<='Z')n[i]=10+num1[i]-'A';
if(num1[i]>='a'&&num1[i]<='z')n[i]=10+num1[i]-'a';
if(num1[i]>='0'&&num1[i]<='9')n[i]=1+num1[i]-'1';
t=t+n[i]*(int)pow(a1,j);
}
for(i=0;;i++)
{
k=t/(int)pow(a2,i);
if(k<a2)/* ! */
break;
}
for(;i>=0;i--)
{
n[i]=t/(int)pow(a2,i);
t=t-(int)pow(a2,i)*n[i];
if(n[i]>=0&&n[i]<=9)
printf("%c",n[i]+48);
if(n[i]>=10&&n[i]<=35)
printf("%c",n[i]+55);
}
}
|
55 | 27367 | void main()
{
char n[20],tab[100];
int a,b,nlen,k,z[10];
long d=0,i;
scanf("%d%s%d",&a,n,&b);
nlen=strlen(n);
for(i=0;i<nlen;i++)
{
if(n[i]>='0'&&n[i]<='9')
z[i]=n[i]-48;
else
if(n[i]>='a'&&n[i]<='z')
z[i]=n[i]-87;
else
if(n[i]>='A'&&n[i]<='Z')
z[i]=n[i]-55;
}
for(i=0;i<nlen;i++)
{
k=pow(a,nlen-i-1);
d=d+z[i]*k;
}
if(d==0)
printf("0");
else
{
for(i=0;i<36;i++)
{
if(d%b<=9)
tab[i]=d%b;
switch(d%b)
{
case 10:tab[i]='A';break;
case 11:tab[i]='B';break;
case 12:tab[i]='C';break;
case 13:tab[i]='D';break;
case 14:tab[i]='E';break;
case 15:tab[i]='F';break;
case 16:tab[i]='G';break;
case 17:tab[i]='H';break;
case 18:tab[i]='I';break;
case 19:tab[i]='J';break;
case 20:tab[i]='K';break;
case 21:tab[i]='L';break;
case 22:tab[i]='M';break;
case 23:tab[i]='N';break;
case 24:tab[i]='O';break;
case 25:tab[i]='P';break;
case 26:tab[i]='Q';break;
case 27:tab[i]='R';break;
case 28:tab[i]='S';break;
case 29:tab[i]='T';break;
case 30:tab[i]='U';break;
case 31:tab[i]='V';break;
case 32:tab[i]='W';break;
case 33:tab[i]='X';break;
case 34:tab[i]='Y';break;
case 35:tab[i]='Z';break;
}
d/=b;
}
for(i=35;i>=0;i--)
if(tab[i]!=0)
break;
for(;i>=0;i--)
{
if(tab[i]>9)
printf("%c",tab[i]);
else
printf("%d",tab[i]);
}
}
}
|
55 | 27368 | 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 | 27369 | void zhuanhuan(char a[])
{
char t;
int i,length;
length=strlen(a);
for(i=0;i<length/2;i++)
{
t=a[i];
a[i]=a[length-i-1];
a[length-i-1]=t;
}
}
void main()
{
unsigned int i=0;
int sum=0,a,b;
char num_1[100],num_2[100];
scanf("%d %s %d",&a,num_1,&b);
while(num_1[i]!='\0')
{
if(num_1[i]>='0'&&num_1[i]<='9')
sum=sum*a+num_1[i]-'0';
else if(num_1[i]>='A'&&num_1[i]<='Z')
sum=sum*a+num_1[i]-'A'+10;
else if(num_1[i]>='a'&&num_1[i]<='z')
sum=sum*a+num_1[i]-'a'+10;
i++;
}
i=0;
while(sum/b!=0)
{
int yu=sum%b;
if(yu>=0&&yu<=9)num_2[i]='0'+yu;
else if(yu>=10)
num_2[i]='A'+yu-10;
sum=sum/b;
i++;
}
if(sum>=0&&sum<=9)num_2[i]='0'+sum;
if(sum>=10)num_2[i]='A'+sum-10;
num_2[i+1]='\0';
zhuanhuan(num_2);
if(num_2[0]!=0)puts(num_2);
else for(i=1;i<strlen(num_2)-1;i++)printf("%c",num_2[i]);
} |
55 | 27370 |
int fim[255], map[37]; char C[1000];
int main(void) {
int a, b; char ch[100];
for (int i = 0; i <= 36; i++) if (i <= 9) fim[i + 48] = i; else fim['a' + i - 10] = i; //??????
for (int i = 0; i <= 36; i++) if (i <= 9) map[i] = i + 48; else map[i] = i + 'A' - 10; //??
scanf("%d %s %d", &a, ch, &b);
int S = 0;
for (int i = 0; i < (int)strlen(ch); i++) {
ch[i] = tolower(ch[i]);
S = S * a + fim[ch[i]];
} //??????
if (S == 0) {
puts("0");
} else {
int l = 0;
while (S)
C[l++] = map[S % b], S /= b; //???b??
reverse(C, C + l);
puts(C);
}
return 0;
}
|
55 | 27371 |
void preProcess(char *p)
{
for (int i = 0; i < strlen(p); i++)
{
if (*(p + i) - 'a' >= 0 && *(p + i) - 'z' <= 0)
{
*(p + i) = '0' + (*(p + i) - 'a' + 10);
continue;
}
if (*(p + i) - 'A' >= 0 && *(p + i) - 'Z' <= 0)
{
*(p + i) = '0' + (*(p + i) - 'A' + 10);
continue;
}
}
}
int main()
{
int m, n;
char sOrig[200], sRes[200];
cin >> m >> sOrig >> n;
preProcess(sOrig);
//cout << sOrig << endl;
int nValue = 0;
char *p = sOrig;
while (*p != '\0') nValue = nValue * m + *p++ - '0';
char *s = sRes;
if (nValue == 0)
{
*s++ = '0';
}
while (nValue)
{
if (nValue % n < 10) *s++ = nValue % n + '0';
else *s++ = nValue % n - 10 + 'A';
nValue /= n;
}
*s-- = '\0';
while(s >= sRes) cout << *s--;
cout << endl;
return 0;
} |
55 | 27372 | int main()
{
long m,p,i,n,x,ten=0,k,j,q,y,sum=0;
char c[100]={0};
scanf("%ld%s%ld",&m,c,&p);
n=strlen(c);
if(c[0]=='0')
printf("0\n");
else{
for(i=0;i<n;i++)
if(c[i]>='A'&&c[i]<='Z')
c[i]+=32;
for(i=n-1;i>=0;i--)
{
if(c[i]>='a'&&c[i]<='z')
x=(c[i]-87)*pow(m,n-1-i);
else
x=(c[i]-48)*pow(m,n-1-i);
ten=ten+x;
}
sum=ten;k=ten;i=0;
while(k)
{
k=k/p; i++;
}
for(j=0;j<i;j++)
{ten=sum;
for(y=j+1;y<i;y++)
ten=ten/p;
q=ten%p;
if(q<=9)
printf("%c",q+48);
if(q>9)
printf("%c",q+55);
}
}
return 0;
}
|
55 | 27373 | int main(int argc, char* argv[])
{
int a[50],i,z1,z2,n;
long x,z;
char s1[3],s2[50],s3[3],s[50];
scanf("%s %s %s",s1,s2,s3);
z1=atoi(s1);z2=atoi(s3);z=1;x=0;
n=strlen(s2);
for (i=0;i<n;i++)
if ((s2[i]>='A')&&(s2[i]<='Z')) s2[i]=s2[i]+32;
for (i=0;i<n;i++)
{
if (s2[i]<='9') a[i]=s2[i]-'0';
else a[i]=s2[i]-'a'+10;
}
for (i=n-1;i>=0;i--)
{
x=x+a[i]*z;
z=z*z1;
}
i=0;
while (x!=0)
{
a[i]=x%z2;
i++;
x=(x-x%z2)/z2;
}
if (i==0) printf("0");
else
{
n=i-1;
for (i=n;i>=0;i--)
if (a[i]<10) s[n-i]='0'+a[i];
else s[n-i]='A'+a[i]-10;
s[n+1]='\0';
puts(s);
}
return 0;
}
|
55 | 27374 |
int main()
{
int i,a,b,c=0,t[100],l,k[100];
char s[100];
scanf("%d %s %d",&a,s,&b);
l=strlen(s);
for(i=0;i<l;i++)
{
if((s[i]>='a')&&(s[i]<='z'))
t[i]=s[i]-87;
else if((s[i]>='A')&&(s[i]<='Z'))
t[i]=s[i]-55;
else
t[i]=s[i]-48;
}
for(i=l-1;i>-1;i--)
{
c+=t[i]*pow(a,l-1-i);
}
for(i=1;;i++)
{
k[i]=c%b;
if(k[i]>9)
k[i]=k[i]+55;
if(c<b)
break;
int h=c/b;
c=h;
}
for(;i>0;i--)
{
if(k[i]>=55)
printf("%c",k[i]);
else
printf("%d",k[i]);
}
return 0;
}
|
55 | 27375 | int main()
{
long convert_to10(char str[], int a);
void convert_from10(long a, int b);
int a, b;
char str[100];
cin >> a >> str >> b;
convert_from10(convert_to10(str, a), b);
return 0;
}
long convert_to10(char str[], int a)
{
int len, i;
long num10 = 0;
len = strlen(str);
for (i = 0; i < len; i++)
{
if (str[i] >= 'A' && str[i] <= 'Z')
num10 = num10 * a + str[i] - 'A' + 10;
if (str[i] >= 'a' && str[i] <= 'z')
num10 = num10 * a + str[i] - 'a' + 10;
if (str[i] >= '0' && str[i] <= '9')
num10 = num10 * a + str[i] - '0';
}
return num10;
}
void convert_from10(long a, int b)
{
char str[10000];
int i, j, k, len;
for (i = 0;;i++)
{
k = a % b;
if (k < 10)
str[i] = k + '0';
else
str[i] = k - 10 + 'A';
a = (a - k) / b;
len = i;
if (a == 0)
{
for (j = len; j >= 0; j--)
cout << str[j];
break;
}
}
}
|
55 | 27376 |
long p(int r,int s);
int main()
{
char num[1000]={0},numx[1000]={0}; //?????????num????a???n?numx?????b???
int n[1000]={0},x[1000]; //n???num??????????
int a,b,j=0;
long c;
unsigned long N=0; //N?n??????
cin>>a;
getchar(); //?????
cin.getline(num,1001,' '); //??n??????????num?
cin>>b;
for (int i=0;i<strlen(num);i++) //?num??????????
{
if (num[i]>=65&&num[i]<91) //????????????????
n[i]=num[i]-65+10;
else if (num[i]>=97&&num[i]<123) //????????????????
n[i]=num[i]-97+10;
else n[i]=num[i]-'0'; //?????????????
N=N+n[i]*p(a,strlen(num)-i-1); //??N
}
c=N;
if (c==0) //?N?0???????
cout<<"0";
while (c!=0) //?unsigned long??N ???b????????????numx?
{
x[j]=c%b;
c=c/b;
j++;
}
for (int i=j-1;i>=0;i--) //?numx????
{
if (x[i]>=10) //??????10???????
numx[i]=x[i]+'A'-10;
else
numx[i]=x[i]+'0';
cout<<numx[i]; //??
}
return 0;
}
long p(int r,int s) //p?????????
{
long ans=1;
for (int k=0;k<s;k++)
ans=ans*r;
return (ans);
} |
55 | 27377 | int main()
{
int n=-1,a=0,b=0,num,s=0,i=0,j=1;//??????n ???a ????b ??????????num ??????????s ????i,j
char numb[32];//??????
cin >>a;//?????
numb[0]=cin.get();
do
{n++;}
while ((numb[n]=cin.get())!=' '); //??????
for (i=0;i<n;i++)//???????????
{
num=1;
if (numb[i]<58)
numb[i]=numb[i]-48;
else if (numb[i]>96)
numb[i]=numb[i]-87;
else numb[i]=numb[i]-55;
for (j=1;j<n-i;j++) num=num*a;
s+=num*numb[i];
}
cin >>b;
n=0;
do
{
num=s%b;
if (num<10)
numb[n]=num+48;
else
numb[n]=num+55;
n++;
s=s/b;
}
while (s!=0) ;
for (n=n-1;n>=0;n--) cout <<numb[n];//????????
return 0;
}
|
55 | 27378 | int main( )
{
int a,b,k,length,i=0,j,n=0,m=0,t=1;
char c,str[34],str1[34];
cin>>a>>str>>b;
length=strlen(str);
for (i=1;i<=length;i++)
{
if ((str[i-1]>=48)&&(str[i-1]<=57)) k=str[i-1]-48;
else if ((str[i-1]>=65)&&(str[i-1]<=90)) k=str[i-1]-55;
else if ((str[i-1]>=97)&&(str[i-1]<=122)) k=str[i-1]-87;
m=length-i;
t=1;
for (j=1;j<=m;j++)
t=t*a;
n=n+k*t;
}
i=0;
do
{
k=n%b;
n=n/b;
if ((k>=0)&&(k<=9)) str1[i]=k+48;
else if (k>=10) str1[i]=k+55;
i++;
} while (n!=0);
for (j=i;j>=1;j=j-1)
cout<<str1[j-1];
return 0;
}
|
55 | 27379 | main()
{
int i,j;
int n,m,a=0,b[1000];
char str[1000],c;
scanf("%d%c%s%c%d",&n,&c,str,&c,&m);
for(i=0;str[i]!='\0';i++)
{
if(str[i]>=48&&str[i]<=57)
a=a*n+(str[i]-'0');
if(str[i]>=97&&str[i]<=122)
a=a*n+(str[i]-'a'+10);
if(str[i]>=65&&str[i]<=90)
a=a*n+(str[i]-'A'+10);
}
for(i=1;;i++)
{
b[i]=(a%(int)pow(m,i))/(int)pow(m,i-1);
a=a-a%(int)pow(m,i);
if(a==0)
break;
}
for(j=i;j>=1;j--)
{
if(b[j]>=0&&b[j]<10)
printf("%c",b[j]+'0');
else
printf("%c",b[j]-10+'A');
}
}
|
55 | 27380 | void main()
{
char c[101],d[101];
int a,b,i,j,p,x;
long n=0;
scanf("%d %s %d",&a,c,&b);
for(i=0;i<=100;i++)
{
if(c[i]==0)break;
else if(c[i]<='Z'&&c[i]>='A')c[i]=c[i]-'A'+10;
else if(c[i]<='z'&&c[i]>='a')c[i]=c[i]-'a'+10;
else if(c[i]<='9'&&c[i]>='0')c[i]=c[i]-'0';
}x=i;
for(i=0;i<=x-1;i++)
{
p=1;
for(j=1;j<=x-i-1;j++)
{
p=p*a;
}
n=n+p*c[i];
}
i=0;
while((n/b)!=0)
{
i++;
d[i]=n%b;
n=n/b;
}
d[i+1]=n%b;
i++;
for(j=1;j<=i;j++)
{
if(d[j]>=10){d[j]=d[j]-10+'A';}
else d[j]=d[j]+'0';
}
for(j=i;j>=1;j--)
{
printf("%c",d[j]);
}
} |
55 | 27381 |
int main(){
int i,j;
int a,b;
long mid=0;
char out[100];
cin>>a;
cin.get();
char tempC;
int temp;
while((tempC = cin.get()) != ' '){
if(tempC>='0' && tempC<='9')
temp = tempC-'0';
else if(tempC>='a' && tempC<='z')
temp = tempC-'a'+10;
else if(tempC>='A' && tempC<='Z')
temp = tempC-'A'+10;
mid *= a;
mid += temp;
}
cin>>b;
i = 0;
while(mid > 0){
temp = mid%b;
if(temp >9){
tempC = temp-10+'A';
}
else{
tempC = temp+'0';
}
out[i]=tempC;
++i;
mid /= b;
}
if(i==0)
cout<<"0"<<endl;
else{
for(j = i-1;j>=0;--j){
cout<<out[j];
}
cout<<endl;
}
cin>>a;
return 0;
}
|
55 | 27382 | long f1(char n[500], int a, int l)
{
long m;
int i, j, k, c[500] = {0};
m = 0;
k = 0;
for (i = l - 1; i >= 0; i--)
if (n[i] <= '9' && n[i] >= '0')
c[i] = n[i] - '0';
else
if (n[i] <= 'Z' && n[i] >= 'A')
c[i] = n[i] - 'A' + 10;
else
if (n[i] <= 'z' && n[i] >= 'a')
c[i] = n[i] - 'a' + 10;
for (i = l - 1; i >= 0; i--)
{
k = c[i];
for (j = 1; j < l - i; j++)
k = k * a;
m = m + k;
}
return m;
}
void f2(long m, int b)
{
int a[500] = {0}, i = 0, j;
char c[500];
do
{
i++;
a[i] = m % b;
m = m / b;
}while(m != 0);
for (j = 1; j <= i; j++)
if (a[j] <= 9 && a[j] >= 0)
c[j] = '0' + a[j];
else
c[j] = a[j] + 'A' - 10;
for (j = i ; j > 0; j--)
cout << c[j];
}
int main()
{
int a, b, l;
long m;
char n[500];
cin >> a >> n >> b;
l = strlen(n);
m = f1(n, a, l);
f2(m, b);
return 0;
}
|
55 | 27383 |
int main()
{
int a,b;
char c[PI];
scanf("%d %s %d",&a,c,&b);
int len;
len=strlen(c);
int i;
for (i=0;i<len;i++)
{
if (c[i]>='a'&&c[i]<='z')
{
c[i]=c[i]-32;
}
}
long int sum=0;
i=0;
int tmp;
int j=len;
while (i<len)
{
if (c[i]>=65&&c[i]<=90)
{
tmp=(c[i]-55)*(long int)pow(a,j-1);
}
if (c[i]>=48&&c[i]<=57)
{
tmp=(c[i]-48)*(long int)pow(a,j-1);
}
sum+=tmp;
j--;
i++;
}
char d[PI];
i=0;
if (sum==0)
printf("0");
while (sum!=0)
{
d[i]=sum%b;
sum=sum/b;
i++;
}
for (j=i-1;j>=0;j--)
{
if (d[j]>=0&&d[j]<=9)
{
printf("%c",d[j]+48);
}
if (d[j]>=10&&d[j]<=35)
{
printf("%c",d[j]+55);
}
}
return 0;
} |
55 | 27384 | int main(){
int a,b,l,i,j,k=0,d[255];
char c[255];
long num=0;
scanf("%d%s%d",&a,c,&b);
l=strlen(c);
for(i=0;i<l;i++){
if(c[i]>='0' && c[i]<='9') d[i]=c[i]-'0';
else if(c[i]>='a' && c[i]<='z') d[i]=c[i]-'a'+10;
else d[i]=c[i]-'A'+10;
// printf("%d ",d[i]);
}
for(j=0;j<l;j++){
num+=d[j]*pow(a,i-1);
i--;
// printf("%ld ",num);
}
// printf("%d ",num);
if(num==0)printf("0\n");
else{
while(num>0){
d[k]=num%b;
if(d[k]>=0 && d[k]<=9) c[k]=d[k]+'0';
else if(d[k]>=10 && d[k]<='z'-'a'+10) c[k]=d[k]-10+'A';
num=num/b;
k++;
}
k--;
while(k>0){
printf("%c",c[k]);
k--;
}
printf("%c\n",c[k]);
}
return 0;
} |
55 | 27385 |
int main()
{
char input[100],output[100];
int number[100],remainder[100],sum=0,a,b,i,t,l,g=1;
scanf("%d %s %d",&a,input,&b);
l=strlen(input);
for(i=0;i<l;i++)
{
if(input[i]>='A' && input[i]<='Z')
number[i]=input[i]-'A'+10;
if(input[i]>='a' && input[i]<='z')
number[i]=input[i]-'a'+10;
if(input[i]>='0' && input[i]<='9')
number[i]=input[i]-'0';
}
for (i=0;i<l;i++)
{
g=1;
for (t=0;t<i;t++)
{
g*=a;
}
sum=sum+number[l-1-i]*g;
}
for(i=0;i<100;i++)
{
remainder[i]=sum%b;
if(sum/b==0)
break;
sum=sum/b;
}
t=i+1;
for(i=t-1;i>=0; i--)
{
if(remainder[i]>=0 && remainder[i]<=9)
output[t-i-1]= remainder[i]+'0';
if(remainder[i]>=10 && remainder[i]<=35)
output[t-i-1]= remainder[i]+'A'-10;
}
output[t]=0;
printf("%s\n",output);
return 0;
}
|
55 | 27386 | int main ()
{
int number = 0;
int inum[1000] ;
int b, e;
int p = 0;
char cnum[1000];
cin >> b >> cnum >> e;
int len = strlen (cnum);
int i;
for (i = len - 1; i >= 0; i--)
{
if ( cnum [i] >= '0' && cnum[i] <= '9')
inum[p++] = cnum[i] - '0';
else if (cnum[i] >= 'a' && cnum[i] <= 'z')
inum[p++] = cnum[i] - 'a' + 10;
else inum[p++] = cnum[i] - 'A' + 10;
}
for (i = p - 1; i > 0; i--)
{
number = (number + inum[i]) * b;
}
int temp;
number += inum[0];
if (number == 0)
cout << "0" << endl;
for (i = 0; number > 0; i++)
{
temp = number % e;
number = number / e;
if (temp <= 9 && temp >= 0)
cnum[i] = temp + '0';
else
cnum[i] = temp + 'a' - 42;
}
for (p = i - 1; p >= 0; p--)
cout << cnum[p];
cout << endl;
return 0;
}
|
55 | 27387 | void main()
{
int x,y;
scanf("%d",&x);
char a[100];
scanf("%s",a);
scanf("%d",&y);
int i,n=0;
for(i=0;i<strlen(a);i++)
{
if(a[i]>='0'&&a[i]<='9')
n=n*x+a[i]-'0';
else if(a[i]>='A'&&a[i]<='Z')
n=n*x+a[i]-'A'+10;
else if(a[i]>='a'&&a[i]<='z')
n=n*x+a[i]-'a'+10;
}
int b[100];
int j=0,k;
if(n==0)
printf("0");
else while(n>0)
{
b[j]=n%y;
j++;
n=n/y;
}
for(k=j-1;k>=0;k--)
{
if(b[k]<10)
printf("%d",b[k]);
if(b[k]>=10)
printf("%c",b[k]+55);
}
}
|
55 | 27388 |
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 | 27389 | 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 | 27390 | int i;
int zh(char c[],int i)
{
if ((c[i] >= 48) && (c[i] <= 57))
return c[i]-48;
if ((c[i] >= 65) && (c[i] <= 90))
return c[i]-55;
if ((c[i] >= 97) && (c[i] <= 122))
return c[i]-87;
}
char ch(int a)
{
if (a <= 9)
return a+48;
if( a > 9)
return a+55;
}
int main()
{
int a, b, i, j, k, l, s = 0;
char c[99], d[99];
for (k = 0; k<= 99; k++)
{
c[k] = ' ';
d[k] = ' ';
}
cin >> a >> c >> b;
for (i = 0; c[i]!='\0'; i++)
{
s = a * s + zh(c,i);
}
for (j = 0; j <= 99; j++)
{
d[j] = ch ( s % b );
s = s / b;
if (s == 0)
break;
}
for (l = 30; l >= 0; l--)
if (d[l] != ' ')
cout << d[l];
return 0;
} |
55 | 27391 |
int main()
{
int num=0,j,i,a,b,x;
char m[50],n[50];
cin>>a;
cin.get();
cin>>m;
cin>>b;
for(i=0;m[i]!='\0';i++)
{if(m[i]>=65&&m[i]<=90) m[i]=m[i]+32;} //??????????
for(i=0;m[i]!='\0'; i++)
{
if(m[i]>=48&&m[i]<=57) x=m[i]-48;
else x=m[i]-97+10;
num=num*a+x; //?a??????10????num???
}
if(num==0) cout<<num<<endl;
for(i=0;num!=0;i++)//??????b????n????
{
n[i]=num%b;
if(n[i]>=9) n[i]=n[i]+55;
else n[i]=n[i]+48;
num=num/b;
}
for(j=i-1;j>=0;j--) cout<<n[j];
cout<<endl;
return 0;
}
|
55 | 27392 | void main()
{
int a,b,i,m,n,t,sum=0;
char str[100]={'0'},s[100]={'0'},c[100]={'0'};
scanf("%d %s %d",&a,str,&b);
n=strlen(str);
for (i=0;i<n;i++)
{
if (str[i]>=48 && str[i]<=57)
sum=sum*a+(int)str[i]-48;
else
{ if (str[i]>=65 && str[i]<=90)
sum=sum*a+(int)str[i]-55;
else
{ if (str[i]>=97 && str[i]<=122)
sum=sum*a+(int)str[i]-87;
}
}
}
for (i=0;sum!=0;i++)
{ t=sum%b;
sum=sum/b;
if (t<=9)
s[i]=(char)(t+48);
else
s[i]=(char)(t+55);
}
m=strlen(s);
for (i=0;i<m;i++)
{ c[i]=s[m-1-i];}
for (i=0;i<m;i++)
{ printf("%c",c[i]);}
printf("\n");
} |
55 | 27393 | int main()
{
int a,b,n,c=0,d,j,i=0,m,s[100];
char num1[100]={0},num2[100]={0};
scanf("%d",&a);
scanf("%s",num1);
scanf("%d",&b);
n=strlen(num1);
for(i=0;i<n;i++)
{
if(num1[i]>='a'&&num1[i]<='z')
{
num1[i]=num1[i]-32;
}
}
for(i=0;i<n;i++)
{
d=1;
if(num1[i]>='0' &&num1[i]<='9')
{
for(j=1;j<n-i;j++)
{
d=d*a;
}
c=c+(num1[i]-'0')*d;
}
else if(num1[i]>='A'&&num1[i]<='Z')
{
for(j=1;j<n-i;j++)
{
d=d*a;
}
c=c+(num1[i]-'A'+10)*d;
}
}
m=0;
if(c!=0){
while(c!=0)
{
s[m]=c%b;
c=(c-s[m])/b;
m++;
}
for(i=0;i<m;i++)
{
if(s[i]>=0&&s[i]<=9)
{
num2[m-i-1]=s[i]+'0';
}
else
{
num2[m-i-1]=s[i]-10+'A';
}
}
for(i=0;i<m;i++)
{
printf("%c",num2[i]);
}
printf("\n");
}
else if(c==0)
{
printf("%d\n",c);
}
return 0;
} |
55 | 27394 | int main()
{
int i,j,a,n,b;
char s[100];
char str[]="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int c[100];
scanf("%d%s%d",&a,s,&b);
n=strlen(s);
for(i=0;i<n;i++){
if(s[i]>='a'&&s[i]<='z')
c[i]=s[i]-'a'+10;
if(s[i]>='A'&&s[i]<='Z')
c[i]=s[i]-'A'+10;
if(s[i]>='0'&&s[i]<='9')
c[i]=s[i]-'0';
}
int k=0;
for(i=0;i<n;i++){
k=k*a;
k+=c[i];
}
j=0;
if(k==0)
printf("0");
else{
while(k!=0){
s[j]=str[k%b];
k=k/b;
j++;
}
}
for(i=j-1;i>=0;i--){
printf("%c",s[i]);
}
} |
55 | 27395 | main()
{
int a,b,flag;
char n[100],m[100];
char c;
long i,s=0,k,x,y,t,u;
scanf("%d%s%d",&a,n,&b);
for(i=0;n[i]!='\0';i++) {}
k=i-1;
for(i=0;i<=k;i++)
{
c=n[i];
if(c>='a' && c<='z') x=c-87;
if(c>='A' && c<='Z') x=c-55;
if(c>='0' && c<='9') x=c-48;
if(c=='0') flag=0;
s=s+x*(long)pow(a,k-i);
}
t=s;
for(i=0;t>0;i++)
u=t%b,t=(t-u)/b;
k=i-1;
for(i=0;s>0;i++)
{
y=s%b;
if(y>9) c=y+55;
else c=y+48;
m[k-i]=c;
s=(s-y)/b;
}
for(i=0;i<=k;i++) printf("%c",m[i]);
if(flag==0) printf("0");
printf("\n");
} |
55 | 27396 | 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 | 27397 | int main()
{
int a[100],b[100],in,out,sum=0,num,nnn,i;
char c;
scanf("%d",&in);
getchar();
for(i=0;i<100;i++)
{
scanf("%c",&c);
if(c<='9' && c>='0')
a[i]=c-'0';
if(c<='z' && c>='a')
a[i]=c-'a'+10;
if(c<='Z' && c>='A')
a[i]=c-'A'+10;
if(c==' ')
{
num=i;
break;
}
}
scanf("%d",&out);
for(i=0;i<num;i++)
{
sum+=a[i]*pow(in,num-i-1);
}
for(i=0;i<100;i++)
{
b[i]=sum%out;
sum=(sum-b[i])/out;
if(sum==0)
{
nnn=i+1;
break;
}
}
for(i=nnn-1;i>=0;i--)
{
if(b[i]<=9 && b[i]>=0)
c=b[i]+'0';
if(b[i]>9)
c=b[i]-10+'A';
printf("%c",c);
}
return 0;
}
|
55 | 27398 | int main()
{
int a,b,i,j,la,lb,decimal,number=0,t;
char str1[1000],str2[1000]={'\0'};
cin>>a;
cin.get();
cin.getline(str1,1000,' ');
cin>>b;
la=strlen(str1);
for(i=0;i<la;i++)
{
if (str1[i] >= '0' && str1[i] <= '9')
decimal = str1[i] - '0';
else if(str1[i]>='A'&&str1[i]<='Z')
decimal = str1[i] - 'A' + 10;
else
decimal=str1[i]-'a'+10;
number = number * a + decimal;
}
i=0;
do
{
str2[i]=number%b;
if(str2[i]>9)
str2[i]=str2[i]-10+'A';
else str2[i]=str2[i]+'0';
number=number/b;
i++;
}
while(number!=0);
t=i;
for(j=t-1;j>=0;j--)
{
cout<<str2[j];
}
return 0;
} |
55 | 27399 | main()
{
int i,j,k,m,n;
int n1,n2;
int a[1000];
unsigned long int sum=0,t=1;
char s[500];
scanf("%d %s %d",&n1,s,&n2);
n=strlen(s);
for(i=n-1;i>=0;i--)
{
if(s[i]<='Z'&&s[i]>='A')
s[i]=s[i]-'A'+10;
if(s[i]<='z'&&s[i]>='a')
s[i]=s[i]-'a'+10;
if(s[i]>='0'&&s[i]<='9')
s[i]=s[i]-'0';
sum=sum+s[i]*t;
if(i==0)
break;
t=t*n1; }
if(sum==0)
printf("0");
else{
i=0;
while(sum!=0)
{
k=sum%n2;
a[i]=k;
i++;
sum=sum/n2;
}
i=i-1;
for(j=i;j>=0;j--)
{
if(a[j]>=10)
printf("%c",a[j]+'A'-10);
else
printf("%d",a[j]);
}}
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.