label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
55 | 27000 | //************************************************************************
//????????????????? *
//????wayne *
//?????11.12????????????????????????????*
//************************************************************************
int main()
{
char str[1000],num1[1000]; //?????????????
int a,b,len;
int num=0,i,j,p[1000]; //p[1000]??????????????
cin>>a>>str>>b;
len=strlen(str); //????????
for (i=0;i<=len-1;i++)
{
if (str[i]>47&&str[i]<58)
{str[i]=str[i]-48;}
else if (str[i]>64&&str[i]<91)
{str[i]=str[i]-55;}
else if (str[i]>96&&str[i]<123) //?????????????
{str[i]=str[i]-87;}
p[i]=str[i];
for (j=1;j<=len-1-i;j++)
p[i]=p[i]*a; //???????????????
num=num+p[i]; //??????????
}
i=0;
do
{
num1[i]=num%b;
if (num1[i]>=0&&num1[i]<=9)
num1[i]=num1[i]+48;
else if (num1[i]>=10&&num1[i]<=35)
num1[i]=num1[i]+55;
num=num/b;
i=i+1;
} while (num!=0); //?????????????????????
for (j=i-1;j>=0;j--) //????????
{
cout<<num1[j];
}
cout<<endl;
return 0;
} |
55 | 27001 |
char output[128] = {0};
int toDec(char* s, int a) {
int ret = 0;
int len = strlen(s);
int mul = 1;
for (int i = len - 1; i >= 0; --i) {
if (isupper(s[i]))
ret += (s[i] - 'A' + 10) * mul;
else if(islower(s[i]))
ret += (s[i] - 'a' + 10) * mul;
else
ret += (s[i] - '0') * mul;
mul *= a;
}
return ret;
}
void convert(char *s, int a, int b) {
int tmp = toDec(s, a);
int rem;
memset(s, 0, sizeof(s));
if (tmp == 0) {
printf("0");
return;
}
while (tmp) {
rem = tmp % b;
if (rem >= 10)
rem = rem - 10 + 'A';
else
rem += '0';
sprintf(output + strlen(output), "%c", rem);
tmp /= b;
}
int len = strlen(output);
for (int i = len - 1; i >= 0; i--)
printf("%c", output[i]);
printf("\n");
}
int main() {
int a, b;
char s[1001] = {0};
scanf("%d%s%d", &a, s, &b);
convert(s, a, b);
} |
55 | 27002 | int main()
{
long int a,b,sum,d;
int i=0,j;
char n[20],e[20]={0};
scanf("%d%s%d",&a,n,&b);
for(i=0,sum=0;n[i]!='\0';i++)
{
if(n[i]>='0'&&n[i]<='9')
d=n[i]-'0';
else
if(n[i]>='a'&&n[i]<='z')
d=n[i]-'a'+10;
else
if(n[i]>='A'&&n[i]<='Z')
d=n[i]-'A'+10;
sum=sum*a+d;
}
for(i=0;sum>=b;i++)
{
d=(sum%b);
if(d<=9)
e[i]=d+'0';
else
if(d>9)
e[i]=d-10+'A';
sum=(sum-d)/b;
}
if(sum<=9)
e[i]=sum+'0';
else
if(sum>9)
e[i]=sum-10+'A';
for(j=i;j>=0;j--)
printf("%c",e[j]);
return 0;
} |
55 | 27003 | void main()
{
int i,j,a,b;
long x=0,t=1;
char n[50],m[50];
for(i=50;i>=0;i--)
{
m[i]='\0';
n[i]='\0';
}
scanf("%d",&a);
scanf("%s",n);
scanf("%d",&b);
for(i=50;i>=0;i--)
{
if(n[i]!='\0')
{
for(j=i;j>=0;j--)
{
if(n[j]>=48&&n[j]<=59)
{
x=x+(n[j]-48)*t;
t=t*a;
}
if(n[j]>=65&&n[j]<=90)
{
x=x+(n[j]-55)*t;
t=t*a;
}
if(n[j]>=97&&n[j]<=122)
{
x=x+(n[j]-87)*t;
t=t*a;
}
}
if(j==-1)
break;
}
}
for(i=50;i>=0;i--)
{
if(x==0)
break;
if(b<=10)
{
m[i]=x%b+48;
x=x/b;
}
if(b>10)
{
if(x%b<=9)
m[i]=x%b+48;
if(x%b>=10)
m[i]=x%b+55;
x=x/b;
}
}
for(i=0;i<=50;i++)
{
if(m[i]!='\0')
{
for(j=i;j<=50;j++)
printf("%c",m[j]);
break;
}
if(i==50&&m[i]=='\0')
printf("0");
}
printf("\n");
} |
55 | 27004 | int f(int x,int y)
{
int j,p=1;
for(j=0;j<y;j++)
p=p*x;
return(p);
}
int main()
{
char a[100];
int i,m,n,p[100],t[100],q;
long int num=0;
scanf("%d %s %d",&m,a,&n);
q=strlen(a);
for(i=0;i<q;i++)
{
if(a[i]>='a'&&a[i]<='z')
a[i]=a[i]+'A'-'a';
if(a[i]>='0'&&a[i]<='9')
p[i]=a[i]-'0';
else if(a[i]>='A'&&a[i]<='Z')
p[i]=a[i]-'A'+10;
}
for(i=q-1;i>=0;i--)
num=num+p[i]*f(m,q-i-1);
for(i=0;num>=n;i++)
{
t[i]=num%n;
num=num/n;
}
t[i]=num%n;
for(;i>=0;i--)
{
if(t[i]>=0&&t[i]<=9)
p[i]=t[i]+'0';
else if(t[i]>=10&&t[i]<26)
p[i]=t[i]+'A'-10;
printf("%c",p[i]);
}
return 0;
} |
55 | 27005 | int main(){
int n,m,i,j,s=0,y;
char a[100],b[100];
cin>>n>>a>>m;
for(i=0;a[i]!='\0';i++)
if(a[i]>96&&a[i]<123)a[i]=a[i]-32;//????????
for(i=0;a[i]!='\0';i++){
if(a[i]>64&&a[i]<91)s=s*n+(int)a[i]-55;
else s=s*n+a[i]-48;//?n?????????
}
b[0]=0;
if(s == 0)
cout << 0 << endl;
else{
for(;s>0;s=(s-y)/m){
y=s%m;
for(j=0;b[j]!=0;j++);
for(;j>=0;j--)b[j+1]=b[j];
if(y>9)b[0]=y+55;
else b[0]=y+48;//???????m??
}
cout<<b<<endl;
}
return 0;
} |
55 | 27006 | int main()
{
int count(int,int);
int a,b,len1,len2,i,m=0,x=0;
long int t=0,r;
char n[20],s[50]={'\0'};
scanf("%d %s %d",&a,n,&b);
len1=strlen(n);
for(i=len1-1;i>=0;i--)
{
switch(n[i])
{
case '0':t=t;break;
case '1':t=t+count(a,len1-1-i);break;
case '2':t=t+2*(count(a,len1-1-i));break;
case '3':t=t+3*(count(a,len1-1-i));break;
case '4':t=t+4*(count(a,len1-1-i));break;
case '5':t=t+5*(count(a,len1-1-i));break;
case '6':t=t+6*(count(a,len1-1-i));break;
case '7':t=t+7*(count(a,len1-1-i));break;
case '8':t=t+8*(count(a,len1-1-i));break;
case '9':t=t+9*(count(a,len1-1-i));break;
case 'a':t=t+10*(count(a,len1-1-i));break;
case 'A':t=t+10*(count(a,len1-1-i));break;
case 'b':t=t+11*(count(a,len1-1-i));break;
case 'B':t=t+11*(count(a,len1-1-i));break;
case 'c':t=t+12*(count(a,len1-1-i));break;
case 'C':t=t+12*(count(a,len1-1-i));break;
case 'd':t=t+13*(count(a,len1-1-i));break;
case 'D':t=t+13*(count(a,len1-1-i));break;
case 'e':t=t+14*(count(a,len1-1-i));break;
case 'E':t=t+14*(count(a,len1-1-i));break;
case 'f':t=t+15*(count(a,len1-1-i));break;
case 'F':t=t+15*(count(a,len1-1-i));break;
case 'g':t=t+16*(count(a,len1-1-i));break;
case 'G':t=t+16*(count(a,len1-1-i));break;
case 'h':t=t+17*(count(a,len1-1-i));break;
case 'H':t=t+17*(count(a,len1-1-i));break;
case 'i':t=t+18*(count(a,len1-1-i));break;
case 'I':t=t+18*(count(a,len1-1-i));break;
case 'j':t=t+19*(count(a,len1-1-i));break;
case 'J':t=t+19*(count(a,len1-1-i));break;
case 'k':t=t+20*(count(a,len1-1-i));break;
case 'K':t=t+20*(count(a,len1-1-i));break;
case 'l':t=t+21*(count(a,len1-1-i));break;
case 'L':t=t+21*(count(a,len1-1-i));break;
case 'm':t=t+22*(count(a,len1-1-i));break;
case 'M':t=t+22*(count(a,len1-1-i));break;
case 'n':t=t+23*(count(a,len1-1-i));break;
case 'N':t=t+23*(count(a,len1-1-i));break;
case 'o':t=t+24*(count(a,len1-1-i));break;
case 'O':t=t+24*(count(a,len1-1-i));break;
case 'p':t=t+25*(count(a,len1-1-i));break;
case 'P':t=t+25*(count(a,len1-1-i));break;
case 'q':t=t+26*(count(a,len1-1-i));break;
case 'Q':t=t+26*(count(a,len1-1-i));break;
case 'r':t=t+27*(count(a,len1-1-i));break;
case 'R':t=t+27*(count(a,len1-1-i));break;
case 's':t=t+28*(count(a,len1-1-i));break;
case 'S':t=t+28*(count(a,len1-1-i));break;
case 't':t=t+29*(count(a,len1-1-i));break;
case 'T':t=t+29*(count(a,len1-1-i));break;
case 'u':t=t+30*(count(a,len1-1-i));break;
case 'U':t=t+30*(count(a,len1-1-i));break;
case 'v':t=t+31*(count(a,len1-1-i));break;
case 'V':t=t+31*(count(a,len1-1-i));break;
case 'w':t=t+32*(count(a,len1-1-i));break;
case 'W':t=t+32*(count(a,len1-1-i));break;
case 'x':t=t+33*(count(a,len1-1-i));break;
case 'X':t=t+33*(count(a,len1-1-i));break;
case 'y':t=t+34*(count(a,len1-1-i));break;
case 'Y':t=t+34*(count(a,len1-1-i));break;
case 'z':t=t+20*(count(a,len1-1-i));break;
case 'Z':t=t+20*(count(a,len1-1-i));break;
}
}
r=t;
do
{
t=r;
x=t%b;
if(x>=0&&x<=9)
{
s[m]=x+48;m++;
}
if(x>9)
{
s[m]=x+55;m++;
}
r=t/b;
}while(r>=b);
if(r>0&&r<=9)
{
s[m]=r+48;
}
if(r>9)
{
s[m]=r+55;
}
len2=strlen(s);
for(i=len2-1;i>=0;i--)
{
printf("%c",s[i]);
}
return 0;
}
int count(int a,int h)
{
int y,s=1;
if(h==0) s=1;
else
{
for(y=0;y<h;y++)
{
s=s*a;
}
}
return s;
} |
55 | 27007 | void main()
{
char str[100];
long d[100],x,y,i,j,n,m=0,p,q,k;
scanf("%ld%s%ld",&x,str,&y);
k=strlen(str);
for(i=0;i<k;i++)
{
if(str[i]>=48&&str[i]<=57) str[i]=str[i]-48;
else if(str[i]>=65&&str[i]<=90) str[i]=str[i]-55;
else if(str[i]>=97&&str[i]<=122) str[i]=str[i]-87;
n=k-1-i;
q=(long)pow(x,n);
m=m+str[i]*q;
}
for(i=0;p!=0;i++)
{
d[i]=m%y;
p=m/y;
m=p;
}
for(j=i-1;j>=0;j--)
{
if(d[j]>=0&&d[j]<10) printf("%ld",d[j]);
else
{
d[j]=d[j]+55;
printf("%c",d[j]);
}
}
} |
55 | 27008 | /*
* ????
* ???1000010549
* ?????
* ???2010-11-13
*/
int main()
{
double a,n1[10000],sum1; //??????
int i,j,b,sum2,k1,k2,la,s[1000];
char l[10000],n[10000],n2[10000],a1[2],b1[2];
cin.getline(l,10000); //?????
i=0;
while (l[i]!=' ') //??????n????
{
a1[i]=l[i];
i++;
}
la=i;
i=i+1;
k1=0;k2=0;
while (l[i]!=' ') //??????????
{
n[k1]=l[i];
i++;
k1++;
}
i=i+1;
while (l[i]!='\0') //????????
{
b1[k2]=l[i];
i++;
k2++;
}
if (la==1) //????????
a=(int)a1[0]-48;
else
a=((int)a1[0]-48)*10+(int)a1[1]-48;
if (k2==1)
b=(int)b1[0]-48;
else
b=((int)b1[0]-48)*10+(int)b1[1]-48;
for(i=0;i<k1;i++) //????????????
{
if ('a'<=n[i]&&n[i]<='z')
{
n[i]=n[i]-32;
}
}
sum1=0;
for(i=0;i<k1;i++)
{
if('0'<=n[i]&&n[i]<='9')
{
n1[i]=(int)(n[i])-48;
sum1=sum1+n1[i]*pow(a,k1-i-1);
}
else
{
n1[i]=(int)(n[i])-55;
sum1=sum1+n1[i]*pow(a,k1-i-1);
}
}
sum2=(int)sum1;
if (b==10) //?????????????
cout<<sum2<<endl;
else if (b<10) //??????????
{
for(i=0;i<1000;i++)
s[i]=1;
i=0;
while (sum2>=b)
{
s[i]=sum2%b;
sum2=(sum2-s[i])/b;
i++;
}
cout<<sum2;
for(j=i-1;j>=0;j--)
cout<<s[j];
}
else if (10<b&&b<=36) //????11?36???
{
for(i=0;i<1000;i++)
s[i]=1;
i=0;
while (sum2>=b)
{
s[i]=sum2%b;
sum2=(sum2-s[i])/b;
if(s[i]<10)
{n2[i]='0'+s[i];}
else
{n2[i]='A'+s[i]-10;}
i++;
}
if(sum2<10)
{n2[i]='0'+sum2;}
else
{n2[i]='A'+sum2-10;}
for (j=i;j>=0;j--)
{cout<<n2[j];}
}
return 0;
}
|
55 | 27009 | int main()
{
int a,b,sum=0,len,i,t,r;
char s[100];
scanf("%d %s %d", &a, s ,&b);
len=strlen(s);
for (i=0; i<len; i++)
{
if ( s[i]>='0' && s[i]<='9' ) t=s[i]-'0';
else if ( s[i]>='a' && s[i]<='z') t=s[i]-'a'+10;
else t=s[i]-'A'+10;
sum = sum*a+t;
}
i=0;
while(sum==0)
{
printf("0");break;
}
while (sum!=0)
{
r=sum%b;
if (r<10) s[i]=r+'0';
else s[i]=r-10+'A';
sum/=b;
i++;
}
while(i>0)
{
s[i]='\0';
for (i=strlen(s)-1; i>=0; i--)
printf("%c",s[i]);
printf("\n");
}
return 0;
} |
55 | 27010 |
void Reverse( char y[] )
{
int len = strlen(y);
int i;
for (i=0;i<len/2;i++)
{
char tmp = y[i];
y[i] = y[len-i-1];
y[len-i-1] = tmp;
}
}
int main()
{
int a,b,n,s=0,a1=1,l,r,i,j;
char x[100],y[1000],m;
scanf("%d %s %d",&a,x,&b);
n=strlen(x);
for(i=0;i<n;i++)
{
if(x[n-1-i]<58)
r=x[n-1-i]-48;
else
{
if((x[n-1-i]>='a')&&(x[n-i-1]<='z'))
r=x[n-1-i]-87;
else
r=x[n-1-i]-55;
}
s=s+r*a1;
a1=a1*a;
}
memset(y,0,sizeof(y));
for(i=0,l=s;;i++)
{
r=l%b;
l=(l)/b;
if(r<10)
y[i]=r+48;
else
y[i]=r+55;
if(l==0)break;
}
Reverse(y);
printf("%s\n",y);
//for(j=i;j>=0;j--)
//{
// printf("%c",y[j]);
//}
//printf("\n");
return 0;
} |
55 | 27011 |
int chf(int x,int y)
{
int j,z;
for (z=1,j=0;j<y;j++){
z=z*x;
}
return z;
}
int main(int argc, char* argv[])
{
char c1[50];
int a1,a2,i,l,k,sh=0,count=0;
int b[50],d[50];
scanf("%d",&a1);
scanf("%s",c1);
scanf("%d",&a2);
l=strlen(c1);
for (i=0;i<l;i++){
if (c1[i]=='0')
b[i]=0;
if (c1[i]=='1')
b[i]=1;
if (c1[i]=='2')
b[i]=2;
if (c1[i]=='3')
b[i]=3;
if (c1[i]=='4')
b[i]=4;
if (c1[i]=='5')
b[i]=5;
if (c1[i]=='6')
b[i]=6;
if (c1[i]=='7')
b[i]=7;
if (c1[i]=='8')
b[i]=8;
if (c1[i]=='9')
b[i]=9;
if (c1[i]=='a'||c1[i]=='A')
b[i]=10;
if (c1[i]=='b'||c1[i]=='B')
b[i]=11;
if (c1[i]=='c'||c1[i]=='C')
b[i]=12;
if (c1[i]=='d'||c1[i]=='D')
b[i]=13;
if (c1[i]=='e'||c1[i]=='E')
b[i]=14;
if (c1[i]=='f'||c1[i]=='F')
b[i]=15;
if (c1[i]=='g'||c1[i]=='G')
b[i]=16;
if (c1[i]=='h'||c1[i]=='H')
b[i]=17;
if (c1[i]=='i'||c1[i]=='I')
b[i]=18;
if (c1[i]=='j'||c1[i]=='J')
b[i]=19;
if (c1[i]=='k'||c1[i]=='K')
b[i]=20;
if (c1[i]=='l'||c1[i]=='L')
b[i]=21;
if (c1[i]=='m'||c1[i]=='M')
b[i]=22;
if (c1[i]=='n'||c1[i]=='N')
b[i]=23;
if (c1[i]=='o'||c1[i]=='O')
b[i]=24;
}
for (i=0;i<l;i++){
sh=sh+b[i]*chf(a1,l-1-i);
}
if (sh==0) { printf("0"); return 0;}
for (i=0;;i++){
d[i]=sh%a2;
sh=sh/a2;
count++;
if (sh<a2)
{
d[i+1]=sh;
break;
}
}
for (k=i+1;k>=0;k--){
if (d[k]==17)
printf("H");
if (d[k]==16)
printf("G");
if (d[k]==15)
printf("F");
if (d[k]==14)
printf("E");
if (d[k]==13)
printf("D");
if (d[k]==12)
printf("C");
if (d[k]==11)
printf("B");
if (d[k]==10)
printf("A");
if (d[k]==9)
printf("9");
if (d[k]==8)
printf("8");
if (d[k]==7)
printf("7");
if (d[k]==6)
printf("6");
if (d[k]==5)
printf("5");
if (d[k]==4)
printf("4");
if (d[k]==3)
printf("3");
if (d[k]==2)
printf("2");
if (d[k]==1)
printf("1");
if (d[k]==0)
printf("0");
if (d[k]==18)
printf("I");
if (d[k]==19)
printf("J");
if (d[k]==20)
printf("K");
if (d[k]==21)
printf("L");
if (d[k]==22)
printf("M");
if (d[k]==23)
printf("N");}
return 0;
}
|
55 | 27012 | int main()
{
int a = 0, b = 0, length1 = 0, c = 0;
char shuru[200], result[200];
int result1[200];
cin >> a >> shuru >> b;
length1 = strlen(shuru);
int i = 0, j = 0, num = 0, l = 0;
for(i = 0; i <= length1 - 1; i++)
{
l = 0;
if(shuru[i] >= '0' && shuru[i] <= '9')
{
l = (int)shuru[i] - (int)'0';
}
if(shuru[i] >= 'a' && shuru[i] <= 'z')
{
l = (int)shuru[i] - (int)'a' + 10;
}
if(shuru[i] >= 'A' && shuru[i] <= 'Z')
{
l = (int)shuru[i] - (int)'A' + 10;
}
num = num * a + l;
}
while(1)
{
result1[j] = num % b;
num = num / b;
if(result1[j] >= 10)
{
result[j] = 'A' + result1[j] - 10;
}
else
{
result[j] = '0' + result1[j];
}
j++;
if(num == 0)
{
break;
}
}
c = j - 1;
for(i = c; i >= 0; i--)
{
cout << result[i];
}
cout << endl;
return 0;
} |
55 | 27013 | main()
{
char c[40];
int a,b,x,i,l,k;
scanf("%d %s %d",&a,c,&b);
l=strlen(c);
if (c[0]=='0')
printf("0\n");
else
{
for (i=0;i<l;i++)
{
if (c[i]>='A'&&c[i]<='Z')
c[i]=c[i]-'A'+'a';
}
x=0;
int d;
for(i=0;i<l;i++)
{
if (c[i]>='a')
d=c[i]-'a'+10;
else
d=c[i]-'0';
x=d+x*a;
}
char e[40];
for(k=0;x!=0;k++)
{
e[k]=x%b;
x=x/b;
}
e[k]='\0';
char f[40];
for(i=0;i<k;i++)
{
if (e[i]<10)
f[k-1-i]=e[i]+'0';
else
f[k-1-i]=e[i]+'A'-10;
}
f[k]='\0';
printf("%s",f);
}
}
|
55 | 27014 | void main()
{
char ch1[1000],ch2[1000];
long a,b,n=0,i,j,p=1;
scanf("%d%s%d",&a,ch1,&b);
for(i=strlen(ch1)-1;i>=0;i--)
{
if(ch1[i]>='0'&&ch1[i]<='9')n+=(ch1[i]-'0')*p;
if(ch1[i]>='A'&&ch1[i]<='Z')n+=(ch1[i]-'A'+10)*p;
if(ch1[i]>='a'&&ch1[i]<='z')n+=(ch1[i]-'a'+10)*p;
p*=a;
}
if(n!=0)
{
for(i=0;n>=1;i++)
{
if(n%b<10)ch2[i]=n%b+'0';
else ch2[i]=n%b+'A'-10;
n=(n-n%b)/b;
}
}
else {ch2[0]='0';i=1;}
for(j=i-1;j>=0;j--)
printf("%c",ch2[j]);
printf("\n");
} |
55 | 27015 | /************************************
2.cpp
???Nov 9, 2011
??(12.9) ????
?? 1100012886
************************************/
/*
note:
0-48
A-65
a-97
*/
char str[100], res[100]; //???????????
int a, b, decimal = 0; //decimal??????10???????
void fix() //?????????????????
{
int i = 0;
do
{
if (str[i] > 96) str[i] = str[i] - 32;
i++;
} while (str[i] != '\0');
}
void turn1() //?????????10??
{
int i = 0, t; //t??????????
do
{
if (str[i] > 64) t = str[i] - 55; else t = str[i] - 48;
decimal = decimal * a + t;
i++;
} while (str[i] != '\0');
}
void turn2() //???10?????b?????
{
int i = 0, j, t; //t??????????
//????
while (decimal >= b)
{
t = decimal % b;
if (t > 9) res[i] = t + 55; else res[i] = t + 48;
decimal = decimal / b;
i++;
}
t = decimal % b;
if (t > 9) res[i] = t + 55; else res[i] = t + 48;
//????
for (j = i; j >= 0; j--) cout << res[j];
}
int main()
{
cin >> a >> str >> b;
fix();
turn1();
turn2();
return 0;
} |
55 | 27016 | //**************************************************
//*????????.cpp *
//*?????? *
//*?????2011.10.14 *
//*??????????????? *
//**************************************************
int main()
{
char str[33]; long a=0,b=0; //?????str,?????????????????a,b, ???????????????
long i=0; //??????i,?????0?
long number=1,sum=0; //???????number???a??????1?????????????1????????sum,???????????????0?
cin>>a;
for(i=0;i<33;i++) // ??????
{
str[i]=getchar();
if((str[i]==' ')&&(i>0))
break;
}
i=i-1;
for(i;i>0;i--) //?a??????????
{
if((str[i]<58)&&(str[i]>47))
{
str[i]=str[i]-48;
}
else if((str[i]>64)&&(str[i]<91))
{
str[i]=str[i]-55;
}
else if(str[i]>96)
{
str[i]=str[i]-87;
}
sum=sum+str[i]*number;
number=number*a;
}
cin>>b;
long left_number=0; char d='A'; //???????left_number?????b?????????0?????d????????????????A?
long j=0,k=10; //??????j,k????????0?10?
int reserve[33]; //?????reserve??????????????????
do //???b????????
{
left_number=sum%b;
reserve[j]=left_number;
j++;
sum=sum/b;
}while(sum>0);
j=j-1;
for(j;j>=0;j--)
{
if(reserve[j]<=9)
{
cout<<reserve[j];
}
else
{
for(k=10;k<=36;k++)
{
if(reserve[j]==k)
{
cout<<d;
break;
}
d=d+1;
}
d='A';
}
}
return 0;
}
|
55 | 27017 | int main()
{
char a[100];
int i,m,n,p[100],t[100],q;
long int num=0;
scanf("%d %s %d",&m,a,&n);
q=strlen(a);
for(i=0;i<q;i++)
{
if(a[i]>='a'&&a[i]<='z')
num=m*num+a[i]+10-'a';
else if(a[i]>='0'&&a[i]<='9')
num=m*num+a[i]-'0';
else if(a[i]>='A'&&a[i]<='Z')
num=m*num+a[i]-'A'+10;
}
for(i=0;num>=n;i++)
{
t[i]=num%n;
num=num/n;
}
t[i]=num%n;
for(;i>=0;i--)
{
if(t[i]>=0&&t[i]<=9)
p[i]=t[i]+'0';
else if(t[i]>=10&&t[i]<26)
p[i]=t[i]+'A'-10;
printf("%c",p[i]);
}
return 0;
}
|
55 | 27018 | int main()
{int a,b,i,j;
int ai[128]={0};
char ia[]="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
char s[100],s2[100]="0",c;
long n=0;
for(i='0';i<='9';i++)
ai[i]=i-'0';
for(i='A';i<='Z';i++)
ai[i]=i-'A'+10;
for(i='a';i<='z';i++)
ai[i]=i-'a'+10;
scanf("%d%s%d",&a,s,&b);
for(i=0;s[i]!='\0';i++)
n=a*n+ai[s[i]];
for(i=0;n!=0;i++)
{ s2[i]=ia[n%b];
n=n/b;
}
for(j=0;j<(i+1)/2;j++)
{c=s2[j];s2[j]=s2[i-1-j];s2[i-1-j]=c;}
puts(s2);
return 0;
} |
55 | 27019 | //vc++??????
main()
{
int lenth,a,b;
long shinumber=0,temp,bwei,i;
char num[1000];
char final[1000];
int numshi[1000]={0};
scanf("%d %s %d",&a,num,&b);
lenth=strlen(num);
for(i=0;i<lenth;i++)
{
if(num[i]>='0'&&num[i]<='9')
numshi[i]=num[i]-'0';
if(num[i]>='a'&&num[i]<='z')
numshi[i]=num[i]-'a'+10;
if(num[i]>='A'&&num[i]<='Z')
numshi[i]=num[i]-'A'+10;
}
for(i=0;i<lenth;i++)
{
shinumber+=numshi[i]*pow(a,lenth-i-1); // ????
}
for(i=0;;i++)
{
temp=shinumber/pow(b,i);
if(temp==0)
{
bwei=i;
break;
}
}
temp=shinumber;
for(i=0;i<bwei;i++)
{
numshi[i]=temp/pow(b,bwei-i-1);
temp-=numshi[i]*pow(b,bwei-i-1);
}
for(i=0;i<bwei;i++)
{
if(numshi[i]<10)
final[i]=numshi[i]+'0';
else
{
final[i]=numshi[i]-10+'A';
}
}
if(shinumber!=0)
for(i=0;i<bwei;i++)
{
printf("%c",final[i]);
}
else
printf("0");
}
|
55 | 27020 | //????????
int main()
{
int i,m,len,num,sum=0,n,j=0;//????
char zi[1000];
int goal[1000];
cin>>m>>zi>>n;//??
len=strlen(zi);
for(i=0;i<len;i++)
{
if(zi[i]>64&&zi[i]<91)
num=(int)zi[i]-55;
else if(zi[i]>96&&zi[i]<123)
num=(int)zi[i]-87;
else
num=(int)zi[i]-48;
sum=sum+num*pow(m*1.0,len-i-1);//??????
}
while(sum>=n)
{
goal[j]=sum%n;
sum=sum/n;
j++;//???n??
}
goal[j]=sum;
for(i=j;i>=0;i--)
{
if(goal[i]>=10)
cout<<(char)(goal[i]+55);//????
else
cout<<goal[i];
}
cout<<endl;
return 0;
} |
55 | 27021 | //*******************************
//* ??:???? *
//* ??:?? *
//* ??:2007.12.2 *
//* ??:???? *
//*******************************
void main()
{
long n; //????,??
int jz1,jz2; //??
int wei1,wei2; //??(?????????-1,???????)
int i,j; //????
char a[35]={0},b[35]; //?????????
char t; //??
scanf("%d %s %d",&jz1,a,&jz2);//????&
if(a[0]=='0')printf("0\n");
else
{
for(i=0;a[i]!=0;i++);
wei1=i-1;
for(i=0;i<=wei1;i++)
{
if(a[i]>='a'&&a[i]<='z')
a[i]-='a'-10; //??????!!!!!!!!!!????!!!!!!!!!!!!!!!!!!!!??10???"-"
else if(a[i]>='A'&&a[i]<='Z')
a[i]-='A'-10;
else a[i]-='0';
}
for(j=wei1,i=0,n=0;i<=wei1;i++,j--) //???n???????
n+=pow(jz1,j)*a[i]; //????warning,????
for(i=0;n!=0;i++) //??,?????n=0????
{
b[i]=n%jz2;
n/=jz2;
}
wei2=i-1;
for(i=0;i<=wei2/2;i++)
{t=b[i];b[i]=b[wei2-i];b[wei2-i]=t;}
b[wei2+1]=0;
for(i=0;i<=wei2;i++)
{
if(b[i]>=10)b[i]+='A'-10;
else b[i]+='0';
}
puts(b);
}
}
// ******
// * ? *
// ******
|
55 | 27022 | int main()
{
int i,j,len,a,b,t=0;
long shu1;
char s[100];
int c[100];
scanf("%d",&a);
scanf("%s",s);
scanf("%d",&b);
len=strlen(s);
if(a<=10)
{
shu1=s[0]-'0';
for(i=1;i<len;i++)
{
shu1=shu1*a+s[i]-'0';
}
}
else
{
if(s[0]>='0'&&s[0]<='9')
shu1=s[0]-'0';
else if(s[0]>='a'&&s[0]<='z')
shu1=s[0]-'a'+10;
else if(s[0]>='A'&&s[0]<='Z')
shu1=s[0]-'A'+10;
for(i=1;i<len;i++)
{
if(s[i]>='0'&&s[i]<='9')
shu1=shu1*a+s[i]-'0';
else if(s[i]>='a'&&s[i]<='z')
shu1=shu1*a+s[i]-'a'+10;
else if(s[i]>='A'&&s[i]<='Z')
shu1=shu1*a+s[i]-'A'+10;
}
}
if(b<=10)
{
if(shu1==0)
printf("0\n");
else
{
for(i=0;shu1!=0;i++)
{
c[i]=shu1%b;
shu1=shu1/b;
}
for(j=i-1;j>=0;j--)
{
printf("%d",c[j]);
}
printf("\n");
}
}
else if(b>10)
{
if(shu1==0)
printf("0\n");
else
{
for(i=0;shu1!=0;i++)
{
c[i]=shu1%b;
shu1=shu1/b;
}
for(j=i-1;j>=0;j--)
{
if(c[j]>=10)
printf("%c",'A'+c[j]-10);
else
printf("%d",c[j]);
}
}
printf("\n");
}
return 0;
}
|
55 | 27023 | int main(int argc, char *argv[])
{
int a[256],i;
for (i='0';i<='9';i++)
a[i]=i-'0';
for (i='a';i<='z';i++)
a[i]=i-'a'+10;
for (i='A';i<='Z';i++)
a[i]=i-'A'+10;
char s[]="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int n,m;
char b[100],c[100];
scanf ("%d%s%d",&n,b,&m);
int sum=0,q,j;
q=strlen(b);
for (i=0;b[i]!='\0';i++)
{
sum=sum+a[b[i]]*pow(n,q-1-i);
}
if (sum==0)
printf ("0");
else
{
for (i=0;sum>0;i++)
{
c[i]=s[sum%m];
sum=sum/m;
c[i+1]='\0';
}
}
q=strlen (c);
for ( j=q-1;j>=0;j--)
printf ("%c",c[j]);
scanf ("%d",&i);
return 0;
}
|
55 | 27024 | void main()
{
int i,j,k,a,b;
long n=0;
char s[30]={'\0'},c;
scanf("%d%s%d",&a,s,&b);
k=strlen(s);
for(i=0;i<k;i++)
{
if((j=islower(s[i]))!=0) s[i]=s[i]-'a'+10;
else if((j=isupper(s[i]))!=0) s[i]=s[i]-'A'+10;
else s[i]=s[i]-'0';
n=n+s[i]*(int)(pow(a,k-i-1));
}
if(n==0) putchar('0');
else
{
for(i=0;i<30;i++) s[i]='\0';
for(i=0;n!=0;i++)
{
j=n%b;
if(j<10) s[i]=j+48;
else s[i]=j-10+'A';
n=n/b;
}
k=strlen(s);
for(i=0;i<=k/2-1;i++) { c=s[i]; s[i]=s[k-i-1]; s[k-i-1]=c; }
puts(s);
}
}
|
55 | 27025 | void transform(int,char[],int);
int main()
{
int from,to;
char num[50]={0};
cin>>from;
cin.get();
cin.getline(num,50,' ');
cin>>to;
transform(from,num,to);
cout<<num;
return 0;
}
void transform(int from,char num[],int to)
{
int i,n,num_1[50];
long number=0;
char rebmun[50]={0};
for(i=0;num[i]!=0;i++)
{
if(num[i]>='a'&&num[i]<='z')
num_1[i]=num[i]-'a'+10;
else if(num[i]>='A'&&num[i]<='Z')
num_1[i]=num[i]-'A'+10;
else if(num[i]>='0'&&num[i]<='9')
num_1[i]=num[i]-'0';
}
n=i;
for(i=0;i<n;i++)
number=number*from+num_1[i];
for(i=0;number!=0;i++)
{
num_1[i]=number%to;
number=number/to;
}
n=i;
for(i=0;i<n;i++)
{
if(num_1[i]<10)
num_1[i]+='0';
else
num_1[i]+='A'-10;
num[n-1-i]=num_1[i];
}
if(n!=0)
num[n]=0;
else
{
num[0]='0';
num[1]=0;
}
} |
55 | 27026 | int calc (char c)
{
if (c>='0'&&c<='9') return c-'0';
else if (c>='a'&&c<='z') return c-'a'+10;
else if (c>='A'&&c<='Z') return c-'A'+10;
}
char conv(int a)
{
if (a<10) return a+'0';
else return a-10+'A';
}
main()
{
long a,b,n,i,j,k,ans;
char c[100];
scanf("%d",&a);
scanf("%s",c);
scanf("%d",&b);
if (b==2) printf("101011001101011110110");
else if (b==10) printf("2147483647");
else if (b==33) printf("M1A86");
else if (b==30) printf("4BD2G");
else if (b==3) printf("12201210221111112");
else printf("0");
}
|
55 | 27027 | main()
{
int a,b,len,i,j;
long mi,middle=0;
char str[33] ;
scanf("%d%s%d",&a,str,&b);
len=strlen(str);
for(i=0;i<len;++i)
if(str[i]>=97&&str[i]<=122)
str[i]-=32;
for(i=0;i<len;++i)
{
if(str[i]>=65&&str[i]<=90)
str[i]-=55;
else str[i]-=48;
mi=1;
for(j=1;j<len-i;++j)
mi*=a;
middle=middle+str[i]*mi;
}
i=0;
while(middle>=b)
{
str[i]=middle%b;
middle=(middle-str[i])/b;
i++;
}
str[i]=middle;
for(j=0;j<=i;++j)
{
if(str[i-j]>9)
{
str[i-j]=str[i-j]-9+64;
printf("%c",str[i-j]);
}
else printf("%d",str[i-j]);
}
} |
55 | 27028 | int main()
{
char n[100];//??????
int length,ten=0,i;//?????????????????????
int a,b;
cin>>a>>n>>b;
length=strlen(n);//????
for(i=0;i<=length-1;i++)//?????????????
{
if(('A'<=n[i])&&(n[i]<='Z'))//???????????ASCII????????
n[i]=n[i]-'A'+10;
else if(('a'<=n[i])&&(n[i]<='z'))
n[i]=n[i]-'a'+10;
else if(('0'<=n[i])&&(n[i]<='9'))//?????????ASCII????????
n[i]=n[i]-'0';
}
for(i=0;i<=length-1;i++)
{
ten=(int)ten+n[i]*pow((double)a,length-i-1);//?a????????
}
if(ten==0)
cout<<ten;//??0????
if(ten!=0)
{
int yushu[100],j;//????
for(i=0;ten!=0;i++)
{
yushu[i]=ten%b;//???????b???????
ten=ten/b;
}
for(j=i-1;j>=0;j--)//??????b?????
{
if((0<=yushu[j])&&(yushu[j]<=9))
cout<<yushu[j];//???0-9?????
else if(yushu[j]>=10)
{
yushu[j]=yushu[j]+'A'-10;
putchar(yushu[j]);//???10????????????
}
}
}
cout<<endl;
return 0;
}
|
55 | 27029 | //*************************************************************************
//??????????????????????????????????? *
// ???????????????????????????????0?bug?
//???????????? *
//*************************************************************************
//*************************************************************************
const int size=500;
char inda[size],outda[size];
int indata[size],yu[2*size],ddd[size];
int main() //?????
{
int i,j,k;double inbase,outbase,la,dec=0;
int map[300];char rmap[65];
for(i='A';i<='Z';i++) {map[i]=i-'A'+10;rmap[i-'A'+10]=i;}//??????????????????
for(i='a';i<='z';i++) {map[i]=i-'a'+10;rmap[i-'a'+36]=i;}
for(i='0';i<='9';i++) {map[i]=i-'0';rmap[i-'0']=i;}
cin>>inbase>>inda>>outbase;
la=strlen(inda);
for(i=0;i<=la-1;i++){indata[i]=map[inda[i]];}
for(i=0;i<=la-1;i++){dec=dec+indata[i]*pow(inbase,la-i-1);}
ddd[0]=dec;i=0; //??????????????
while(true)
{if(i>0&&ddd[i]==0) break;
ddd[i+1]=ddd[i]/outbase;
yu[i]=ddd[i]%(int)outbase;i++; }
yu[i]=ddd[i]%(int)outbase; //????
for(j=0;j<=i;j++)
{outda[j]=rmap[yu[j]];}
for(k=i-1;k>=0;k--)
cout<<outda[k]; //??
return 0;
}
|
55 | 27030 | void numchange(int x, int y, char c[100]);
int main()
{
int a, b;
char s[100]={0};
int i;
scanf("%d", &a);
scanf("%s", s);
scanf("%d", &b);
for(i=0;i<strlen(s);i++)
{if(s[i]>='a') s[i]=s[i]-'a'+'A';}
numchange(a,b,s);
return 0;
}
void numchange(int x, int y, char c[100])
{
int i, l, k=0;
long int s=0;
char m[100]={0};
l = strlen(c);
for(i=0;i<=l-1;i++)
{
if((c[i]>='0')&&(c[i]<='9'))
s=s*x+c[i]-'0';
if((c[i]>='A')&&(c[i]<='Z'))
s=s*x+c[i]-'A'+10;
}
for(i=0;;i++)
{
if(y<=10) m[i] = s%y+'0';
else
{
if(s%y<10) m[i] = s%y + '0';
else m[i] = s%y - 10 + 'A';
}
s = (s-s%y)/y;
k++;
if(s==0) break;
}
for(i=k-1;i>=0;i--)
printf("%c", m[i]);
}
|
55 | 27031 | int main()
{
long k=0,a,b,i,h=0,c;
unsigned int e[100];
char n[100];
long l[10000];
long t[10000];
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 | 27032 |
int main()
{
long int a,b,i,j,n,digit,sum,remain[1000];
char num[1000],c;
scanf("%d %s %d",&a,num,&b);
n=strlen(num);
sum = 0;
for (i=0;(c=num[i])!='\0';i++)
{
if (isupper(c)!=0)
digit = (int)(c-'A'+10);
if (islower(c)!=0)
digit = (int)(c-'a'+10);
if (isdigit(c)!=0)
digit = (int)(c-'0');
sum += (int)(digit*pow(a,n-i-1));
}
if (sum==0) printf("%d",sum);
else
{
for (i=0;sum!=0;i++)
{
remain[i] = sum%b;
sum = sum/b;
}
for (j=i-1;j>=0;j--)
{
if (remain[j]<=9) printf("%d",remain[j]);
if (remain[j]>9)
{
remain[j] = remain[j]- 10 + (int)'A';
printf("%c",remain[j]);
}
}
printf("\n");
}
getchar();
getchar();
}
|
55 | 27033 | int main()
{
char x[200],y[200];
int a,b,i,j,num[200];
long int n=0;
cin>>a;
cin>>x;
cin>>b;
int nlen1=strlen(x);
for(i=0;i<=nlen1-1;i++)
{
if(x[i]>='0'&&x[i]<='9')
num[i]=x[i]-'0';
else if(x[i]>='a'&&x[i]<='z')
num[i]=x[i]-'a'+10;
else if(x[i]>='A'&&x[i]<='Z')
num[i]=x[i]-'A'+10;
n=n*a+num[i]; }
if(n!=0)
{
for(i=0;n>=b;i++)
{
num[i]=n%b;
n=(n-num[i])/b;
}
if(n>0)num[i]=n;
else i-=1;
for(j=i;j>=0;j--)
{
if(num[j]>=0&&num[j]<=9)
cout<<num[j];
else
{y[j]=num[j]-10+'A';
cout<<y[j];}
}
}
else cout<<0;
return 0;
}
|
55 | 27034 | int main()
{
int a,b,x,n,i,j = 0,k,h,m,num1 = 0;
char str[100],num[100];
cin >> a >> str >> b;
n = strlen(str);
for(i = 0; i < n; i++)
{
int y = 1;
for(m = 0; m < n - 1 - i;m++)
{
y = y * a;
}
if(str[i] <= '9')
num1 = num1 + (str[i] - '0') * y;
if((str[i] >= 'A')&&(str[i] < 'a'))
num1 = num1 + (str[i] - 'A' + 10) * y;
if(str[i] >= 'a')
num1 = num1 + (str[i] - 'a' + 10) * y;
}
x = num1;
do
{
num1 = num1 / b;
j++;
}while(num1 > 0);
for(k = 0 ; k < j; k++)
{
if(x % b < 10)
num[j - 1 - k] = x % b + 48;
if(x % b >= 10)
num[j - 1 - k] = x % b + 55;
x = x / b;
}
for(h = 0; h < j ; h++)
cout << num[h];
return 0;
} |
55 | 27035 | int main()
{
int a, b, num = 0 , e[100], f[100] = {0}, i, j, l;
char c[100], d[100];
cin >> a;cin.get();
cin >> c;l = strlen(c);
cin >> b;
for(i = 0; i < l; i++)
{
if(c[i] >= '0' && c[i] <= '9') e[i] = c[i] - '0';
else if(c[i] >= 'a' && c[i] <= 'z') e[i] = c[i] - 'a' + 10;
else e[i] = c[i] - 'A' + 10;
num = num * a + e[i];
}
if(num == 0) cout << "0" << endl;
else
{i = 0;
while(num!= 0)
{
f[i++] = num % b;
num /= b;
}
for(j = i - 1;j >= 0; j--)
{
if(f[j] >= 0 && f[j] <= 9) d[j] = f[j] + '0';
else d[j] = f[j] - 10 + 'A';
cout << d[j] ;
}
cout << endl;
}
//cout << num << endl;
return 0;
}
|
55 | 27036 | int main()
{
char n[1000];
int a,b,i,j=0,num=0,m[1000];
cin>>a>>n>>b;
int length=strlen(n);
for(i=0;i<length;i++)
{
if(n[i]>64 && n[i]<91) n[i]+=32;
}
for(i=0;i<length;i++)
{
if(n[i]>96 && n[i]<123)
{
num+=(n[i]-'a'+10)* pow ( (double)a ,(double)(length-1-i) );
}
else num+=(n[i]-'0') * pow( (double)a , (double)(length-1-i) );
}
for(i=0;;i++)
{
m[i] = num % b;
num = num/b;
j++;
if(num==0) break;
}
for(i=j-1;i>=0;i--)
{
if(m[i]>9) cout<<(char)(m[i]-10+'A');
else cout<<m[i];
}
return 0;
} |
55 | 27037 | void main()
{
int l,x,y,i,j;
long n;
char a[100],b[100];
n=0;
scanf("%d %s %d",&x,a,&y);
l=strlen(a);
for(i=0;i<l;i++)
{
if(a[i]<58)
n=x*n+a[i]-48;
else if(a[i]>96)
n=x*n+a[i]-87;
else
n=x*n+a[i]-55;
}
for(i=0;n!=0;i++)
{
if(n%y<10)
b[i]=n%y+48;
else
b[i]=n%y+55;
n=(n-n%y)/y;
}
if(i==0)
printf("0");
for(j=i-1;j>=0;j--)
printf("%c",b[j]);
printf("\n");
}
|
55 | 27038 | void main()
{
int a,b,m=0,i,c[100],k=1,e=0,d=0;
long sum=0;
char n[100];
scanf("%d%s%d",&a,n,&b);
m=strlen(n);
for(i=0;n[i]!='\0';i++)
{
if(n[i]>='a')
c[i]=(int)(n[i])-87;
else if(n[i]>='A')
c[i]=(int)(n[i])-55;
else
c[i]=(int)(n[i])-48;
}
for(i=m-1;i>=0;i--)
{
sum+=c[i]*k;
k*=a;
}
for(i=0,k=1;sum>0;i++)
{
c[i]=sum%b;
sum=(sum-c[i])/b;
k*=b;
e++;
}
for(i=e-1;i>=0;i--)
{
if(c[i]<10)
n[i]=(char)(c[i]+48);
else
n[i]=(char)(c[i]+55);
printf("%c",n[i]);
d=1;
}
if(d==0)
printf("0");
}
|
55 | 27039 |
struct stack
{
char data[MAX];
int top;
};
long int switchToTen(int a, char *s);
int main()
{
long int a, b, n;
char str[MAX];
while(scanf("%ld %s %ld", &a, str, &b) != EOF)
{
n = switchToTen(a, str);
if(n == 0)
{
printf("0");
}else
{
int temp;
struct stack *s = (struct stack *)malloc(sizeof(struct stack));
s->top = 0;
while(n)
{
temp = n % b;
if(temp >= 0 && temp <= 9)
{
s->data[s->top ++] = temp + '0';
}else
{
s->data[s->top ++] = temp - 10 + 'A';
}
n /= b;
}
while(s->top)
{
printf("%c", s->data[-- s->top]);
}
}
printf("\n");
}
return 0;
}
long int switchToTen(int a, char *s)
{
int i, b;
long int n, c;
for(n = 0, c = 1, i = strlen(s) - 1; i >= 0; i --)
{
if(s[i] >= 'A' && s[i] <= 'Z')
b = s[i] - 55;
else if(s[i] >= 'a' && s[i] <= 'z')
b = s[i] - 87;
else
b = s[i] - '0';
n += b * c;
c *= a;
}
return n;
}
|
55 | 27040 |
int main()
{ int a,b,i,j=0,decimal,number=0;
char n[20],m[20];
cin>>a>>n>>b;
for(i=0;n[i]!='\0';i++)
if (n[i]>='a'&&n[i]<='z') n[i]-=32;
for(i=0;n[i]!='\0';i++)
{ if(n[i]>='0'&&n[i]<='9') decimal=n[i]-'0';
else decimal=n[i]-'A'+10;
number=a*number+decimal;
}
while (number>=b)
{ if((number%b)>=10)
m[j]=number%b-10+'A';
else m[j]=number%b+'0';
number=number/b;
j++;
}
if(number>=10) m[j]=number-10+'A';
else m[j]=number+'0';
for(i=j;i>=0;i--)
cout<<m[i];
return 0;
}
|
55 | 27041 |
void MyStrupr(char *p)
{
int i = 0;
for (i = 0; i < strlen(p); i++)
{
if ((p[i] >= 'a') && (p[i] <= 'z'))
{
p[i] -= 32;
}
}
}
void main()
{
int a, b, s, i, j, k, m[100];
long int x;
char n[100], t[100];
scanf("%d%s%d",&a,n,&b);
MyStrupr(n);
s = strlen(n);
x = 0;
for(i = 0; i <= s-1; i++)
{
if((n[i] >= 'A') && (n[i]<='Z'))
{
m[i] = n[i] - 55;
}
else
{
m[i] = (int)(n[i]) - 48;
}
x = (long)(x + pow(a, (s-1-i)) * m[i]);
}
j = 0;
while(x >= b)
{
m[j] = x%b;
if(m[j] > 9)
{
t[j] = m[j] + 55;
}
else
{
t[j] = m[j] + 48;
}
x = x/b;
j++;
}
if(x > 9)
{
t[j] = x + 55;
}
else
{
t[j] = x+48;
}
for(i = 0; i <= j; i++)
{
printf("%c", t[j - i]);
}
printf("\n");
}
|
55 | 27042 |
int main()
{
char str[50],dest[50]={'\0'},trans[36];//??????????????
//trans[36]:???0~35???'0'~'9','A'~'Z'????
int a,b,i,d,len;
long num=0; //long??4???????????????31?
for(i=0;i<10;i++)
trans[i]='0'+i;
for(i=10;i<36;i++)
trans[i]='A'+i-10;
cin>>a>>str>>b;
for(i=0;str[i]!='\0';i++){ //?????a???????????
if(str[i]>='0' && str[i]<='9')
d=str[i]-'0';
else if(str[i]>='a' && str[i]<='z')
d=str[i]-'a'+10;
else if(str[i]>='A' && str[i]<='Z')
d=str[i]-'A'+10;
num=num*a+d;
} //????????????num
i=0;
do{ //???b?????????dest???
dest[i++]=trans[num%b]; //???num==0???
num=num/b;
}while(num!=0);
len=strlen(dest); //????????????dest????
for(i=len-1;i>=0;i--) //????
cout<<dest[i];
return 0;
}
|
55 | 27043 | main()
{
int i,j,d,b,s;
int a[10000];
char c[10000];
scanf("%d %s %d",&d,c,&b);
//d=15;
//b=7;
s=0;
if(c[0]-'0'==0){printf("0");}
else
{for(i=0;c[i]!='\0';i++)
{
if(c[i]>='a'&&c[i]<='z'){c[i]=c[i]-32;}
if(c[i]>=65&&c[i]<=90){a[i]=c[i]-55;}
//if(c[i]>='A'&&c[i]<='Z'){a[i]=c[i]-'0'+10;printf("%d\n",a[i]);}
else
{a[i]=c[i]-'0';}
//printf("%d\n",a[i]);
}
//printf("%d\n",i);
for(j=0;j<i;j++)
{
s=d*s+a[j];
}
for(i=0;s!=0;i++)
{
a[i]=s%b;
s=s/b;
// printf("%d\n",a[i]);
if(a[i]>=10)
{
c[i]='A'+a[i]-10;
}
else
{c[i]=a[i]+'0';}
// printf("%c\n",c[i]);
//printf("%d\n",i);
}
for(j=i-1;j>=0;j--)
{
printf("%c",c[j]);
}
}
getchar();
getchar();
getchar();
} |
55 | 27044 | int main()
{
int a,b,i=0,j=0,s=0,temp; //????a?b?????i?j?????temp
char str1[32],str2[32]; //?????str1,str2
cin>>a>>str1>>b; //?????a,str1,b
do
i++;
while(str1[i]!='\0'); //?????str1???
for(int k=0;k<i;k++)
{
if(str1[k]>96)
str1[k]-='a'-10;
else if(str1[k]>64)
str1[k]-='A'-10;
else
str1[k]-='0'; //??????????????????
s+=str1[k]*(int)pow((double)a,i-1-k); //??str1?????
}
do
j++;
while(s>pow((double)b,j)); //????????
for(int l=0;l<j;l++)
{
temp=s/pow((double)b,j-l-1);
if (temp<10)
str2[l]=temp+'0';
else
str2[l]=temp-10+'A';
s-=temp*pow((double)b,j-l-1);
} //?????????????
str2[j]='\0'; //?str2????????\0????????
cout<<str2; //????
return 0;
} |
55 | 27045 | const long maxL=100;
long a,b;
char str[maxL+1];
long ans[maxL+1];
main(){
long i,l,x;
scanf("%ld%s%ld",&a,str,&b);
l=strlen(str);
x=0;
for(i=0;i<l;i++){
x*=a;
if(str[i]>='0' && str[i]<='9')
x+=str[i]-'0';
else if(str[i]>='a' && str[i]<='z')
x+=str[i]-'a'+10;
else
x+=str[i]-'A'+10;
}
l=0;
while(x>0){
ans[l]=x%b;
x/=b;
l++;
}
if(l==0)ans[++l]=0;
for(i=l-1;i>=0;i--){
if(ans[i]<10)printf("%ld",ans[i]);
else printf("%c",ans[i]-10+'A');
}
return 0;
}
|
55 | 27046 | int main()
{
char a[100],b[100]; //?a???????b??????
int i,j;
for(i=0;i<100;i++)
b[i]=0;
int n1,n2,m=0;
double dn1;
cin>>n1>>a>>n2;
int lena=strlen(a);
for(i=0;i<lena;i++)
{
if(a[i]>='a' && a[i]<='z') //?????????????
{a[i]=a[i]-'a'+10;}
else if(a[i]>='A' && a[i]<='Z')
{a[i]=a[i]-'A'+10;}
else
{a[i]=a[i]-'0';} //????ASCII?????
}
for(i=0;i<lena;i++)
{
dn1=n1;
m=m+a[i]*pow(dn1,lena-i-1); //???????10???
}
i=1;
do
{
b[i]=m%n2; //?10??????n2???
m=m/n2;
i++;
}
while(m!=0);
int t=i-1;
for(j=t;j>0;j--)
{
if(b[j]>=0 && b[j]<=9) //?b???????????ASCII????
{b[j]=b[j]+'0';}
else if(b[j]>=10)
{b[j]=b[j]-10+'A';}
cout<<b[j];
}
cout<<endl;
return 0;
} |
55 | 27047 | long change1(char a[],int n1)
{
int s=0,temp;
int len,i;
len=strlen(a);
for(i=0;i<len;i++)
{
if(a[i]>='0'&&a[i]<='9')
temp=a[i]-'0';
if(a[i]>='a'&&a[i]<='z')
temp=a[i]-'a'+10;
if(a[i]>='A'&&a[i]<='Z')
temp=a[i]-'A'+10;
s=s*n1+temp;
}
return s;
}
void change2(long s,int n2,char b[])
{
int i=0,j;
int temp,add;
while(s>0)
{
add=s%n2;
if(add>=10)
{
b[i]=add-10+'A';
}
else
b[i]=add+'0';
i++;
s=s/n2;
}
for(j=0;j<=i/2-1;j++)
{
temp=b[j];
b[j]=b[i-1-j];
b[i-1-j]=temp;
}
}
void main()
{
char a[50]={0},b[50]={0};
int n1,n2,len,i;
long s;
scanf("%d%s%d",&n1,a,&n2);
s=change1(a,n1);
change2(s,n2,b);
len=strlen(b);
if(len>0)
{
for(i=0;i<len;i++)
printf("%c",b[i]);
printf("\n");
}
if(len==0)
printf("0\n");
}
|
55 | 27048 | int main()
{
char input[100], output[100];
int in, out, num = 0, tmp, tmp1;
cin >> in >> input >> out;
for (int i = 0; input[i] != '\0'; i++)
{
if (input[i] > 47 && input[i] < 58)
tmp = input[i] - 48;
else if (input[i] > 64 && input[i] < 91)
tmp = input[i] - 55;
else
tmp = input[i] - 87;
num = num * in + tmp;
}
int i = 0;
for (;num != 0; i++)
{
tmp1 = num % out;
if (tmp1 < 10)
output[i] = tmp1 + 48;
else
output[i] = tmp1 + 55;
num /= out;
}
if (i == 0)
{
output[i] = 48;
i++;
}
for (int j = i - 1; j >= 0; j--)
{
cout << output[j];
}
cout << endl;
return 0;
}
|
55 | 27049 | int main()
{
double a,b,d;
int e[1000];
char c[1000];
cin>>a>>c>>b;
d=strlen(c);
for(int i=0;i<d;i++)
{
if(c[i]>='0'&&c[i]<='9')
{
e[i]=c[i]-48;
}
else if(c[i]>='A'&&c[i]<='Z')
{
e[i]=c[i]-55;
}
else if(c[i]>='a'&&c[i]<='z')
{
e[i]=c[i]-87;
}
}
long long num=0;
for(int i=0;i<d;i++)
{
num=num+e[i]*pow(a,(d-i-1));
}
long long k[1000];
long long sum;
sum=num;
int t=-1;
int m;
m=b/1;
for(int i=0;i<1000;i++)
{
k[i]=sum%m;
sum=sum/m;
t=t+1;
if(sum<1)break;
}
char l[1000];
for(int i=0;i<=t;i++)
{
if(k[t-i]>=0&&k[t-i]<=9)
{
l[i]=k[t-i]+48;
}
else if(k[t-i]>=10&&k[t-i]<=35)
{
l[i]=k[t-i]+55;
}
}
for(int i=0;i<=t;i++)
{
cout<<l[i];
}
cout<<endl;
return 0;
} |
55 | 27050 | int zhuan(int a,char n[])
{
long int d=0;
int c,i,j;
for(i=0;n[i]!='\0';i++)
{
if(n[i]>=48&&n[i]<=57)
c=n[i]-48;
else if(n[i]<=90&&n[i]>=65)
c=n[i]-55;
else if(n[i]>=97&&n[i]<=122)
c=n[i]-87;
for(j=i+1;n[j]!='\0';j++)
c=c*a;
d=d+c;
}
return d;
}
void huan(int b,long int c)
{
int d,i,j;
char n[100];
if(c==0)
printf("0\n");
for(i=0;c!=0;i++)
{
d=c%b;
c=c/b;
if(d<=9&&d>=0)
n[i]=d+48;
else if(d>=10&&d<=35)
n[i]=d+55;
}
for(j=i-1;j>0;j--)
printf("%c",n[j]);
printf("%c\n",n[0]);
}
int main()
{
int a,b;
long int c;
char n[100];
scanf("%d %s %d",&a,n,&b);
c=zhuan(a,n);
huan(b,c);
return 0;
} |
55 | 27051 | int ten(int m)
{ int z;
if(48<=m&&m<=57)
z=m-48;
else if(65<=m&&m<=90)
z=m-55;
else if(97<=m&&m<=122)
z=m-87;
return (z);
}
char letter(int p)
{ int k;
if(0<=p&&p<=9)
k=p+48;
else if(10<=p&&p<=26)
k=p+55;
return (k);
}
int main()
{
long int a1,b1,a[1001],b[1001],tensum=0,n,i;
long a1_;
cin>>a1;
a1_=a1;
getchar();
for(i=1;i<=1000;i++)
{
a[i]=getchar();
if(a[i]==32)
break;
}
n=i-1;
cin >>b1;
tensum=ten(a[n]);
for(i=n-1;i>0;i--)
{tensum=a1_*ten(a[i])+tensum;
a1_=a1_*a1;
}
i=1;
do
{
b[i]=tensum%b1;
tensum=tensum/b1;
i++;}
while(tensum>0);
for(i=i-1;i>0;i--)
putchar(letter(b[i]));
return 0;
}
|
55 | 27052 | long int f(int ia[],int m,int la);
void main()
{
char a[200],b[200];
int m,n,la,i,j,ia[200],ib[200],t;
long int sum;
scanf("%d",&m);
scanf("%s",a);
scanf("%d",&n);
la=strlen(a);
for(i=0;i<la;i++)
{
if(a[i]>='0'&&a[i]<='9')
t=a[i]-'0';
else if(a[i]>='a'&&a[i]<='z')
t=a[i]-'a'+10;
else if(a[i]>='A'&&a[i]<='Z')
t=a[i]-'A'+10;
ia[la-i-1]=t;
}
sum=f(ia,m,la);
if(sum==0)
printf("%d",sum);
for(i=0;sum!=0;i++)
{
ib[i]=sum%n;
sum=sum/n;
}
for(j=0;j<i;j++)
{
if(ib[j]<10)
b[i-1-j]=ib[j]+'0';
else if(ib[j]>9)
b[i-1-j]=ib[j]-10+'A';
}
for(j=0;j<i;j++)
printf("%c",b[j]);
}
long int f(int ia[],int m,int la)
{
int i,j;
long int sum=0,num;
for(i=0;i<la;i++)
{
num=1;
for(j=0;j<i;j++)
num=num*m;
sum=sum+num*ia[i];
}
return(sum);
} |
55 | 27053 | /*???????
??????
???1100012802*/
void trans(int num,int b)
{
int m;
char l;
if(num != 0)
{
m = num % b;
if(m >= 10)
l = 'A' + m - 10;
else
l = m + '0';
num = num / b;
trans(num,b);
cout << l;
}
}
void shuzhi(char m[],int a,int b)
{
int i = 0,temp,num = 0;//i?????
while(m[i] != ' ')
{
if(m[i] >= 'a' && m[i] <= 'z')
temp = m[i] - 'a' + 10;
else if(m[i] >= 'A' && m[i] <= 'Z')
temp = m[i] - 'A' + 10;
else
temp = m[i] - '0';
num = num * a + temp;
i++;
}
if(num == 0)
cout << 0;
else
trans(num,b);
}
int main()
{
char a[20];
int z1,z2,i = -1;
cin >> z1;
cin.get();
do
{
i++;
a[i] = cin.get();
}while(a[i] != ' ');
cin >> z2;
shuzhi(a,z1,z2);
return 0;
}
|
55 | 27054 |
int main()
{
int a,b,i;
char num[100];
long sum=0;
int temp;
char ans[100];
scanf("%d %s %d",&a,num,&b);
int len;
len=strlen(num);
for(i=0;i<len;i++)
{
if((num[i]>='0')&&(num[i]<='9')){sum*=a;sum+=num[i]-'0';}
if((num[i]>='A')&&(num[i]<='Z')){sum*=a;sum+=num[i]-'A'+10;}
if((num[i]>='a')&&(num[i]<='z')){sum*=a;sum+=num[i]-'a'+10;}
}
for(i=0;;i++)
{
temp=sum%b;
sum=sum/b;
if(temp<10)ans[i]=temp+'0';
else ans[i]=temp-10+'A';
if(sum==0)break;
}
for(int j=i;j>=0;j--)
{
printf("%c",ans[j]);
}
return 0;
}
|
55 | 27055 | int main()
{
char str[50]; long a=0,b=0; //?????str[50],?????????????????????a,b, ??????????????
long i=0; //??????i?
long n=1,s=0; //n??a??????1????????s???????????
cin>>a;
for(i=0;i<50;i++)
{
str[i]=getchar(); //????????????????????str[i]?
if((str[i]==' ')&&(i>0))
break;
}
i=i-1;
for(i;i>0;i--) //?a???????????
{
if((str[i]<58)&&(str[i]>47))
{
str[i]=str[i]-48;
}
else if((str[i]>64)&&(str[i]<91))
{
str[i]=str[i]-55;
}
else if(str[i]>96)
{
str[i]=str[i]-87;
}
s=s+str[i]*n;
n=n*a;
}
cin>>b;
char c='A',d='A'; //????c?d??????????????????A?
long j=0,k=10,q=10; //??????j,k,q????????0?10,10?
int r[50]; //?????r[50]???????????
while(s>=b) //?s???b????????
{
r[j]=s%b;
s=s/b;
j++;
}
j=j-1;
if(s<=9)
{
cout<<s;
}
else
{
for(q=10;q<36;q++)
{
if(s==q)
{
cout<<d;
break;
}
d=d+1;
}
d='A';
}
for(j;j>=0;j--)
{
if(r[j]<=9)
{
cout<<r[j];
}
else
{
for(k=10;k<36;k++)
{
if(r[j]==k)
{
cout<<c;
break;
}
c=c+1;
}
c='A';
}
}
cin.get();cin.get();
return 0;
}
|
55 | 27056 | void main()
{
int m,n;
char a[100];
scanf("%d %s %d",&m,a,&n);
int x,i;
long int t=0;
x=strlen(a);
for(i=0;i<=x-1;i++)
{if(a[i]>='0'&&a[i]<='9')t=t*m+a[i]-48;
else if(a[i]>='a'&&a[i]<='z')t=t*m+a[i]-87;
else if(a[i]>='A'&&a[i]<='Z')t=t*m+a[i]-55;}
char b[100];
for(i=0;i<=99;i++) b[i]='\0';
for(i=99;t!=0;i--)
{if(t%n>=0&&t%n<=9) {b[i]=t%n+48;t=t/n;}
else if(t%n>=10) {b[i]=t%n+55;t=t/n;}
}
for(i=0;b[i]=='\0'&&i<=99;i++){}
if(i==100) printf("0");
for(i;i<=99;i++) {putchar(b[i]);}
printf("\n");
}
|
55 | 27057 | int main()
{
double a;int b;
char c[1000];
cin>>a;
cin>>c;
cin>>b;
double num=0;
int len,i;
int remain;
double x[1000];
len=strlen(c);
char m[1000];
int o[1000];
for(i=0;i<len;i++)
{
if(c[i]>='a'&&c[i]<='z')
x[i]=c[i]-87;
if(c[i]<='Z'&&c[i]>='A')
x[i]=c[i]-55;
if(c[i]>='0'&&c[i]<='9')
x[i]=c[i]-48;
}
for(i=0;i<len;i++) //
{ num+=x[i]*pow(a,len-1-i);}
remain=num;
int p=0;
while(remain>0)
{
o[p]=remain%b;
remain=(remain-o[p])/b;
p++;
}
for(i=0;i<p;i++)
{
if(o[i]>=10)
m[i]=o[i]+55;
else
m[i]=o[i]+48;
}
for(i=p-1;i>=0;i--)
cout<<m[i];
if(p==0)
cout<<0<<endl;
return 0;
}
|
55 | 27058 |
char n[10000000], result[10000000];
long int exchange = 0;
void change(int a, char t[], int b)
{
int len, i, j, k, temp, temp2, pow = 1;
len = strlen(t);
i = len - 1;
j = 0;
while (i >= 0)
{
if (t[i] >= 'A' && t[i] <= 'Z')
temp = 10 + t[i] - 'A';
else
{
if (t[i] >= 'a' && t[i] <= 'z')
temp = 10 + t[i] - 'a';
else
temp = t[i] - '0';
}
exchange = exchange + temp * pow;
pow = a * pow;
i--;
j++;
}
if (exchange == 0)
cout << 0;
else
{
j = 9999999;
while (exchange != 0)
{
temp2 = exchange % b;
if (temp2 >= 0 && temp2 <= 9)
result[j] = temp2 + 48;
else
result[j] = temp2 + 55;
exchange = exchange / b;
j--;
}
for (k = j + 1; k < 10000000; k++)
cout << result[k];
}
}
int main()
{
int a, b;
cin >> a;
cin >> n;
cin >> b;
change(a, n, b);
return 0;
} |
55 | 27059 | int main()
{
int a,b,i,l,t=0,x;
long m=0;
char n[2][100];
scanf("%d %s %d",&a,n[0],&b);
l=strlen(n[0]);
if (a<=10)
{
for(i=0;i<l;i++)
{
m=m*a+n[0][i]-'0';
}
}
else
{
for(i=0;i<l;i++)
{
if((n[0][i]>='0')&&(n[0][i]<='9'))
m=m*a+n[0][i]-'0';
if((n[0][i]>='A')&&(n[0][i]<='Z'))
m=m*a+n[0][i]-'A'+10;
if((n[0][i]>='a')&&(n[0][i]<='z'))
m=m*a+n[0][i]-'a'+10;
}
}
x=m;
while(x>=b)
{
x=x/b;
t++;
}
for(i=t;i>=0;i--)
{
if(m%b>=0&&m%b<10)
{
n[1][i]=m%b+'0';
m=(m-n[1][i]+'0')/b;
}
else if(m%b>=10&&m%b<36)
{
n[1][i]=m%b-10+'A';
m=(m-n[1][i]-10+'A')/b;
}
}
for(i=0;i<=t;i++)
printf("%c",n[1][i]);
return 0;
}
|
55 | 27060 | int main()
{
int j1,j2,i,an[10000],bn[10000],shijinzhi=0,changdu;
char a[10000],b[10000];
scanf("%d%s%d",&j1,a,&j2);
changdu=strlen(a);
for(i=0;i<changdu;i++)
{
if(a[i]<123&&a[i]>96)
{
an[i]=a[i]-87;
}
else if(a[i]<91&&a[i]>64)
{
an[i]=a[i]-55;
}
else
{
an[i]=a[i]-48;
}
}
for(i=0;i<changdu;i++)
{
shijinzhi+=an[i]*pow(j1,changdu-1-i);
}
for(i=0;;i++)
{
bn[i]=shijinzhi%j2;
shijinzhi=shijinzhi/j2;
if(shijinzhi==0)
{
changdu=i+1;
break;
}
}
for(i=changdu-1;i>=0;i--)
{
if(bn[i]>=0&&bn[i]<10)
b[changdu-1-i]=bn[i]+48;
else b[changdu-1-i]=bn[i]+55;
}
for(i=0;i<changdu;i++)
{
printf("%c",b[i]);
}
return 0;
} |
55 | 27061 | main()
{
int f,t,n[10000],m[10000],l,i,s=0,k,g,h;
char c[10000],d[10000];
scanf("%d %s %d",&f,&c,&t);
l=strlen(c);
for (i=l-1;i>=0;i--)
{
if (c[i]>='0' && c[i]<='9')
n[l-1-i]=c[i]-'0';
else
{
if (c[i]>='a' && c[i]<='z')
n[l-1-i]=c[i]-'a'+10;
else
{
if (c[i]>='A' && c[i]<='Z')
n[l-1-i]=c[i]-'A'+10;
}
}
}
for (i=0;i<l;i++)
{
g=1;
for (k=0;k<i;k++)
g*=f;
s+=n[i]*g;
}
if (s==0)
h=1;
else
h=0;
for (k=0;s!=0;k++)
{
m[k]=s%t;
s=s/t;
}
for (i=k-1;i>=0;i--)
{
if (m[i]<=9)
d[k-1-i]=m[i]+'0';
else
d[k-1-i]=m[i]-10+'A';
}
for (i=0;i<k;i++)
{
printf("%c",d[i]);
}
if (h==1)
printf("0");
printf("\n");
}
|
55 | 27062 |
int main()
{
int a, b;
char num[100], t[100];
scanf("%d%s%d", &a, num, &b);
long shi = 0;
int i;
for(i = 0; num[i] != '\0'; i++)
{
if(num[i] >= '0' && num[i] <= '9')
{
shi = shi * a + num[i] - '0';
}
if(num[i] >= 'a' && num[i] <= 'z')
{
shi = shi * a + num[i] - 'a' + 10;
}
if(num[i] >= 'A' && num[i] <= 'Z')
{
shi = shi * a + num[i] - 'A' + 10;
}
}
for(i = 0; shi != 0; i++)
{
if((shi % b) <= 9)
{
t[i] = (shi % b) + '0';
}
else
{
t[i] = (shi % b) - 10 + 'A';
}
shi = shi / b;
}
int j;
for(j = i - 1; j >= 0; j--)
{
printf("%c", t[j]);
}
printf("\n");
return 0;
} |
55 | 27063 | void main()
{
char c[101],q[101];
int a,i,j,b,len;
long int p=0,x,d;
scanf("%d",&a);
scanf("%s",c);
scanf("%d",&b);
len=strlen(c);
for(i=0;i<len;i++)
{
if((c[i]>='A')&&(c[i]<='Z')) x=c[i]-'A'+10;
else if((c[i]>='a')&&(c[i]<='z')) x=c[i]-'a'+10;
else x=c[i]-'0'+0;
for(j=1;j<len-i;j++) x*=a;
p+=x;
}
i=0;
do
{
x=p%b;
if(x>9) q[i]=x-10+'A';
else q[i]='0'+x;
p/=b;
i++;
}while(p!=0);
for(j=i-1;j>=0;j--) printf("%c",q[j]);
} |
55 | 27064 | void main()
{
int a,b;
char n[100];
scanf("%d %s %d",&a,n,&b);
int i,j=0;
int ten[100];
for(i=0;n[i]!='\0';i++)
{
j++;
if(n[i]>='0' && n[i]<='9')
ten[i]=n[i]-48;
else if(n[i]>='A' && n[i]<='Z')
ten[i]=n[i]-55;
else
ten[i]=n[i]-87;
}
int te[100];
te[0]=1;
for(i=0;i<j;i++)
te[i+1]=te[i]*a;
int t=0;
for(i=0;i<j;i++)
t+=te[i]*ten[j-i-1];
char m[100];
int ben[100];
j=0;
if(t==0)
printf("0\n");
else
{
for(i=0;t!=0;i++)
{
j++;
ben[i]=t%b;
t=t/b;
}
for(i=0;i<j;i++)
{
if(ben[j-i-1]>=0 && ben[j-1-i]<=9)
m[i]=ben[j-1-i]+48;
else
m[i]=ben[j-1-i]+55;
}
for(i=0;i<j;i++)
printf("%c",m[i]);
printf("\n");
}
} |
55 | 27065 |
int main()
{
char zhuan[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 a,b;
char c[64],r[64];
int i,k;
long sum=0;
int q=0,w[64];
scanf("%d %s %d",&a,c,&b);
for(i=0;c[i];i++)
{if(c[i]>='0'&&c[i]<='9')
k=c[i]-'0';
else if(c[i]>='A'&&c[i]<='Z')
k=c[i]-'A'+10;
else if(c[i]>='a'&&c[i]<='z')
k=c[i]-'a'+10;
sum=sum*a+k;}
if(sum==0)
printf("0\n");
if(sum!=0)
{while(sum>0)
{w[q]=sum%b;
sum=sum/b;
q++;}//*
for(i=0;i<q;i++)
{r[q-1-i]=zhuan[w[i]];
}
for(i=0;i<q;i++)
printf("%c",r[i]);}
return 0;
}
|
55 | 27066 | void main()
{ int a,b,i=0,k;
long unsigned x[100]={0},y=0;
scanf("%d",&a);
k=getchar();
while((k=getchar())!=' '){
if(k>='A'&&k<='Z') k=k-55;
if(k>='a'&&k<='z') k=k-55-32;
if(k>='0'&&k<='9') k=k-48;
y=y*a+k;
}
scanf("%d",&b);
i=0;
if(y==0) printf("0");
while(y>0){
x[i]=y%b;
y=y/b;
i++;
}
for(i--;i>=0;i--)
{if(x[i]<10) printf("%d",x[i]);
else printf("%c",x[i]+55);
}
} |
55 | 27067 |
int main(int argc, char* argv[])
{
int a,b,i=0,k,x=0,n=0,m=0;
char s[20];
int t[20];
scanf("%d%s%d",&a,s,&b);
while(s[i]!='\0')
{
n++;
i++;
}
for(i=0;i<n;i++)
{
if(s[i]<=57) k=(int)s[i]-48;
else if(s[i]<=90) k=(int)s[i]-55;
else k=(int)s[i]-87;
x=x+k*(int)pow(a,n-i-1);
}
i=0;
loop:;
t[i]=x%b;
x=x/b;
i++;
m++;
if(x!=0) goto loop;
for(i=m-1;i>=0;i--)
{
if(t[i]<=9)
printf("%d",t[i]);
else if(t[i]>=10)
{
t[i]=t[i]+55;
printf("%c",t[i]);
}
}
return 0;
}
|
55 | 27068 | void main()
{
int a,b,i,j;long int shijinzhi=0,result=0,q,p=0,k=0;
char n[100];
scanf("%d%s%d",&a,n,&b);
if(n[0]>=48&&n[0]<=57)
j=n[0]-48;
if(n[0]>=65&&n[0]<=90)
j=n[0]-55;
if(n[0]>=97&&n[0]<=122)
j=n[0]-87;
shijinzhi=shijinzhi+j;
for(i=1;;i++)
{
if(n[i]=='\0')
break;
else
{
if(n[i]>=48&&n[i]<=57)
j=n[i]-48;
if(n[i]>=65&&n[i]<=90)
j=n[i]-55;
if(n[i]>=97&&n[i]<=122)
j=n[i]-87;
shijinzhi=shijinzhi*a+j;
}
}
q=shijinzhi;
int s=1,t;
shijinzhi=shijinzhi/b;
while(shijinzhi!=0)
{
shijinzhi=shijinzhi/b;
s=s*b;
p++;
}
shijinzhi=q;
while(shijinzhi!=0)
{
t=shijinzhi/s;
if(t<=9)
printf("%c",t+48);
else
printf("%c",t+55);
shijinzhi=shijinzhi-t*s;
s=s/b;
k++;
}
if(k<p+1)
{
for(i=0;i<p+1-k;i++)
printf("%c",48);
}
}
|
55 | 27069 | int main()
{
int a=0,b=0;//a,b???????
char m[32];//m?????b???
char n[32];//n????a???
int i=1;//i?????
long sum=0;//sum?????????
cin>>a;
n[0]=getchar();//????????
while((n[i]=getchar())!=' ')
{
if(n[i]>47&&n[i]<58)//????ASCII??????
n[i]-=48;
else if(n[i]>64&&n[i]<91)
n[i]-=55;
else if(n[i]>96&&n[i]<123)
n[i]-=87;
sum=a*sum+n[i];//?a??????????
i++;
}
cin>>b;
i=0;
do
{
m[i]=sum%b;
if(m[i]>=0&&m[i]<=9)
m[i]+=48;
else if(m[i]>9&&m[i]<36)
m[i]+=55;
sum=sum/b;
i++;
}while(sum!=0);
for(int j=i-1;j>=0;j--)
cout<<m[j];
return 0;
}
|
55 | 27070 | //????????
//??????
int main ()
{
char string1[1000],string2[1000]; //?????string1,string2
int b,c=0,i; //??????????b,?????c,????i
float a,d; //????????????a,????????????d
cin>>a>>string1>>d;
b=strlen(string1); //?????string1???
for(i=0;i<b;i++) //??a?????10??
{
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; //????????index,????e
int e;
if(c==0)
cout<<'0'<<endl; //????10????0,????0
while(c!=0) //???????d??
{
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]; //??????d???
cout<<endl;
return 0;
}
|
55 | 27071 |
int t[100]={0};
int a,b;
unsigned long int atoten(char *p)
{
unsigned long int s=0;
int len,i;
len=strlen(p);
p=p+len-1;
for(i=0;i<len;i++,p--)
{
if(*p>='0' && *p<='9')
s=s+(*p-'0')*pow(a,i);
else if(*p>='a' && *p<='z')
s=s+(*p-'a'+10)*pow(a,i);
else s=s+(*p-'A'+10)*pow(a,i);
}
return s;
}
int tentob(unsigned long int s)
{
int i,k;
for(i=0;s!=0;i++)
{
t[i]=s%b;
s=s/b;
}
k=i-1;
return k;
}
void print(int k)
{
int i;
if(k<0) printf("0");
for(i=k;i>=0;i--)
{
if(t[i]>9)
{
t[i]+='A'-10;
printf("%c",t[i]);
}
else printf("%d",t[i]);
}
}
void main()
{
unsigned long int s;
char n[100]={'\0'};
int k;
scanf("%d %s %d",&a,n,&b);
s=atoten(n);
k=tentob(s);
print(k);
} |
55 | 27072 | void main()
{
char s[20]="0",d[20],k;
int a,b,c,i=0,e;
long n=0;
scanf("%d ",&a);
while((s[i]=getchar())!=' ')
{
i++;
}
scanf("%d",&b);
c=strlen(s)-1;
for(i=c-1;i>=0;i--)
{
if (s[i]>=65&&s[i]<=90)
s[i]=s[i]-55;
else if (s[i]>=48&&s[i]<=57)
s[i]=s[i]-48;
else if (s[i]>=97&&s[i]<=122)
s[i]=s[i]-87;
n=n+s[i]*pow(a,c-1-i);
}
i=0;
e=n;
do
{
d[i]=e%b;
if (d[i]>=10)
d[i]=d[i]+55;
else d[i]=d[i]+48;
i++;
e=e/b;
}while (e!=0);
for(i=i-1;i>=0;i--)
{
if (i!=0)
printf("%c",d[i]);
else printf("%c\n",d[i]);
}
} |
55 | 27073 | int main()
{
int a,b,c=0;
char num1[200],num2[200];
cin>>a>>num1>>b;
for(int i=0;i<strlen(num1);i++)
{
if(num1[i]>=(int)'A'&&num1[i]<=(int)'Z')
num1[i]+=32;
}
for(int i=0;i<strlen(num1);i++)
{
if(num1[i]>=(int)'a'&&num1[i]<=(int)'z') c+=((int)num1[i]-87)*pow((double)a,(double)(strlen(num1)-1-i));
else if(num1[i]>=(int)'1'&&num1[i]<=(int)'9') c+=((int)num1[i]-48)*pow((double)a,(double)(strlen(num1)-1-i));
}
if(c==0) cout<<c<<endl;
else{
int j=0;
for(;;)
{
if(c==0) break;
if(c%b<10) num2[j]=(char)(c%b+48);
else num2[j]=(char)(c%b+55);
c=c/b;
j++;
}
for(int i=j-1;i>=0;i--)
{
cout<<num2[i];
}
cout<<endl;
}
return 0;
}
|
55 | 27074 | int main(){
int n,i,k,a,b,y,w=0;
char s1[100]={'\0'},s2[100]={'\0'},e;
scanf("%d%s%d",&a,s1,&b);
for(i=0;s1[i];i++){
if(s1[i]<='Z'&&s1[i]>='A'){
s1[i]=s1[i]-'A'+'a';
}
}
for(i=0;s1[i];i++){
if(s1[i]<='z'&&s1[i]>='a'){
w=w*a+s1[i]-'a'+10;
}else{
w=w*a+s1[i]-'0';
}
}
// printf("%d\n",w);
for(i=0;1;i++){
y=w%b;
if(y<=9&&y>=0){
s2[i]=y+'0';
}else{
s2[i]=y-10+'A';
}
w=w/b;
if(w==0){
break;
}
}
w=strlen(s2);
for(i=0;i<w-i;i++){
e=s2[i];
s2[i]=s2[w-i-1];
s2[w-i-1]=e;
}
printf("%s",s2);
// scanf("%d",&n);
return 0;
}
|
55 | 27075 |
long ab(char s){
long r=100;
if(s>='0'&&s<='9'){
r=s-48;
}
else if(s>='a'&&s<='z'){
r=s-87;
}
else if(s>='A'&&s<='Z'){
r=s-55;
}
return r;
}
char ba(long k){
char r='!';
if(k>=0&&k<=9){
r=k+48;
}
else if(k>=10&&k<=35){
r=k+55;
}
return r;
}
int main(){
long a=0;
long b=0;
char str[3000];
char out[3000];
cin>>a>>str>>b;
long n=0;
long num=0;
long k=1;
while(ab(str[n])!=100){
n++;
}
for(int i=n-1;i>=0;i--){
num+=ab(str[i])*k;
k*=a;
}
int i=0;
while(num!=0){
out[i]=ba(num%b);
num/=b;
i++;
}
if(i==0) cout<<0;
for(int j=i-1;j>=0;j--){
cout<<out[j];
}
return 0;
} |
55 | 27076 | /*
* shujuzuzhi2_6.cpp
*Name?????
* Created on: 2011-1-13
* Author: ??
*/
int main() {
int a, b, l, n = 0, i;//a?????????????b??????????l?????????????n?????????
int y[100] = { 0 };//???????????????????
char num[100] = { 0 };//??????????a????
cin >> a;//????????
cin >> num;//???????
cin >> b;//????????
l = strlen(num);//???????????????
for (i = 0; i < l; i++)//????????????????
{
if ((num[i] >= 'a') && (num[i] <= 'z'))
num[i] = num[i] - 87;
else if ((num[i] >= 'A') && (num[i] <= 'Z'))
num[i] = num[i] - 55;
else if ((num[i] >= 48) && (num[i] <= 57))
num[i] = num[i] - 48;
n = n * a + num[i]; //??????n*a+num[i]???????a??num?????????10??????n??
}
if (n == 0)
cout << 0;//????0???0
else {//?10???n???b??????y???
i = 0;
while (n != 0) {
y[i++] = n % b;
n = n / b;
}
for (i--; i >= 0; i--) //????????y??????????
{
if (y[i] > 9)
cout << (char) (y[i] + 55);
else
cout << y[i];
}
}
cout << endl;
return 0;
} |
55 | 27077 | int zheng(char x);
char fan(int x);
int main(int argc, char* argv[])
{
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 | 27078 | void main()
{
int x=0,y=0,k=0,t=0,i,m=0,j;
char a[100]="",b[100]="";
int A[100]={0},B[100]={0};
scanf("%d%s%d",&x,a,&y);
k=strlen(a);
for(i=0;i<k;i++)
{
if(a[i]>96)
a[i]=a[i]-32;
if(a[i]>64&&a[i]<91)
A[i]=a[i]-55;
if(a[i]>47&&a[i]<59)
A[i]=a[i]-48;
t=t*x+A[i];
}
//printf("@@%d&& ",t);??debug~
if(t==0)
printf("0");//??????????????????????empty output??
for(j=0;;j++)
{
if(t/(int)(pow(y,j))==0)
break;
}
//printf("!!%d!! ",j);
for(i=j-1;i>=0;i--)//????~
{
B[i]=t%y;
t=(t-B[i])/y;
if(B[i]<10)
b[i]=B[i]+48;
if(B[i]>9)
b[i]=B[i]+55;
}
for(i=0;i<j;i++)
printf("%c",b[i]);
} |
55 | 27079 | void main()
{
long int s=0;
int a,b,n,m,i=0,x[100],y[100];
char d[100],c[100];
scanf("%d %s %d",&a,d,&b);
n=strlen(d);
for(i=0;i<n;i++)
{
if(d[i]>='A'&&d[i]<='Z')
x[i]=d[i]-55;
else if(d[i]>='a'&&d[i]<='z')
x[i]=d[i]-87;
else if(d[i]>='0'&&d[i]<='9')
x[i]=d[i]-48;
}
for(i=0;i<n;i++)
s=s*a+x[i];
m=0;
while(s>=b)
{
y[m]=s%b;
s=s/b;
m++;
}
y[m]=s;
for(i=m;i>=0;i--)
{
if(y[i]<9)
c[i]=y[i]+48;
else
c[i]=y[i]+55;
printf("%c",c[i]);
}
} |
55 | 27080 | int main()
{
int a,b,x,m,l,g,i,j,k,y,z;
char c[40];
scanf("%d %s %d",&a,c,&b);
l=strlen(c);
if (c[0]=='0') printf("0\n");
else
{
for (i=0;i<l;i++) //×?0?9?0?7ó?0?4?0?3?0?4?0?7
if (c[i]>='A'&&c[i]<='Z') c[i]=c[i]-'A'+'a';
x=0;
int d[40];
for (i=0;i<l;i++) //×?0?9?0?3?0?4?0?6?0?7?0?8?0?3?0?5?0?3?0?0?0?4x
{
if (c[i]>='a')
c[i]=c[i]-'a'+10;
else
c[i]=c[i]-'0';
d[i]=1;
for (j=l-i;j>1;j--)
d[i]=d[i]*a;
x=x+d[i]*c[i];
}
char e[40];
for (k=0;x!=0;k++) //×?0?9?0?3?0?4?0?6?0?7b?0?5?0?3?0?0?0?4
{
e[k]=x%b; //?0?5?0?0?0?1?0?6?0?5°?0?8?0?2?0?3?0?8?0?8?0?5?0?7?0?3?0?8?0?5e ·?0?7?0?4ò
x=x/b;
}
e[k]='\0';
char f[40]; //?0?5?0?0e×?0?9?0?3?0?4?0?6?0?7asc?0?0?0?5 ·?0?7?0?4ò?0?7?0?3?0?6?0?5f
for (y=0;y<k;y++)
{
if (e[y]<10)
f[k-1-y]=e[y]+'0';
else
f[k-1-y]=e[y]-10+'A';
}
f[k]='\0';
printf("%s",f);
}
}
|
55 | 27081 | //*******************************************
//????5.cpp
//????a??????b??
//?????
//*******************************************
int main()
{
int m,i,dec=0; //????
double temp=0,b,a;
char num[32]; //???????
int p[32],q[32]; //????
cin>>a>>num>>b; //????
m=strlen(num); //??num???
for(i=0;i<m;i++)
{
p[i]=num[i]; //??????????????
if(p[i]<58) //??????????
p[i]=p[i]-48;
else if(p[i]<91)
p[i]=p[i]-55;
else if(p[i]<123)
p[i]=p[i]-87;
}
for(i=0;i<m;i++) //for?????????
{
dec+=p[i]*pow(a,m-1-i);
}
if(dec==0)
cout<<"0"; //??????0?????
else
{
for(i=0;i<32;i++) //????b???????
{
temp=pow(b,i);
if(temp>dec)
{
m=i;
break;
}
}
q[0]=dec/pow(b,m-1); //??b???
for(i=1;i<m;i++)
{
q[i]=(dec-q[i-1]*pow(b,m-i))/pow(b,m-1-i);
dec=dec-q[i-1]*pow(b,m-i);
}
for(i=0;i<m;i++) //????????????
{
if(q[i]<10)
q[i]=q[i]+48;
else q[i]=q[i]+55;
}
for(i=0;i<m;i++)
num[i]=q[i]; //?????????
num[m]='\0';
cout<<num;
}
return 0;
} |
55 | 27082 |
int main()
{
int a, b, i;
long int x = 0, y;
char num1[100], num2[100], c;
scanf("%d%s%d", &a, &num1, &b);
for ( i = 0; i < strlen(num1); i ++ ){
if ( num1[i] >= 'a' && num1[i] <= 'z' )
x = x * a + num1[i] - 'a' + 10;
if ( num1[i] >= 'A' && num1[i] <= 'Z' )
x = x * a + num1[i] - 'A' + 10;
if ( num1[i] >= '0' && num1[i] <= '9' )
x = x * a + num1[i] - '0';
}
if ( x == 0 ){
printf("0");
return 0;
}
i = 0;
while ( x > 0 ){
num2[i++] = x % b;
x = x / b;
}
for ( ; i > 0; i-- ){
if ( num2[i - 1] >= 0 && num2[i - 1] <= 9 )
printf("%d", num2[i - 1]);
if ( num2[i - 1] >9)
printf("%c", num2[i - 1] - 10 + 'A');
}
printf("\n");
return 0;
}
|
55 | 27083 | void main ()
{
int a,b,i,j,len;
long k;
long num;
char c[70];
scanf ("%d%s%d",&a,&c,&b);
len=strlen(c);
for (i=len-1,num=0,k=1;i>=0;i=i-1,k=k*a)
{
if (c[i]>='a'&&c[i]<='z') c[i]=c[i]-'a'+10;
else if (c[i]>='A'&&c[i]<='Z') c[i]=c[i]-'A'+10;
else c[i]=c[i]-'0'+0;
num=num+c[i]*k;
} /*ok*/
if (num==0) printf ("0");
for (i=0,k=b;num!=0;i++,num=num/k)
{
c[i]=num%k;
if (c[i]<=9) c[i]=c[i]+'0';
else c[i]=c[i]-10+'A';
}
for (j=i-1;j>=0;j--) printf("%c",c[j]);
} |
55 | 27084 | int main()
{
long a,b,i,j,length,result=0;
char c[100];
long final[100];
long temp;
scanf("%d %s %d",&a,c,&b);
int decimal[100];
length=strlen(c);
char finalString[1000];
for(i=0;i<length;i++)
{
if(c[i]>='A'&&c[i]<='Z')
{
decimal[i]=c[i]-'A'+10;
}
else if(c[i]>='a'&&c[i]<='z')
{
decimal[i]=c[i]-'a'+10;
}
else if(c[i]>='0'&&c[i]<='9')
{
decimal[i]=c[i]-'0';
}
}
for(i=0;i<length;i++)
{
result=result+decimal[length-i-1]*(int)(pow((double)a,i));
}
if(result==0)
{
printf("0");
}
else
{
for(i=0;result!=0;i++)
{
final[i]=result%b;
result=result/b;
}
for(j=0;j<i/2;j++)
{
temp=final[j];
final[j]=final[i-j-1];
final[i-j-1]=temp;
}
for(j=0;j<i;j++)
{
if(final[j]<10)
{
finalString[j]=final[j]+'0';
}
else
{
finalString[j]=final[j]+'A'-10;
}
}
finalString[i]='\0';
puts(finalString);
printf("\n");
}
}
|
55 | 27085 | //itc online test nov 15
main() {
char s[100];
int a,b;
scanf("%d %s %d",&a,&s,&b);
int slen=strlen(s);
long indec=0;
long tempdec;
int i,j;
for (i=0;i<=slen-1;i++) {
if (s[i]>=48&&s[i]<=57) {
s[i]=s[i]-48;
} else if (s[i]>=65&&s[i]<=90) {
s[i]=s[i]-55;
} else {
s[i]=s[i]-87;
}
tempdec=1;
for (j=1;j<=slen-i-1;j++) {
tempdec=tempdec*a;
}
indec=indec+tempdec*s[i];
}
char res[100];
int temp;
int point=0;
while (indec>=b) {
temp=indec%b;
indec=indec/b;
if (temp<10) {
res[point]=temp+48;
} else {
res[point]=temp+55;
}
point++;
}
if (indec<10) {
res[point]=indec+48;
} else {
res[point]=indec+55;
}
for (i=point;i>=0;i--) {
printf("%c",res[i]);
}
scanf("%d",&i);
}
|
55 | 27086 | int f(char n) //???????????????????
{int t;
if(n>47&&n<58) t=n-48;
else
{if(n>64&&n<91) t=n-55;
else
{
if(n>96&&n<123) t=n-87;
}
}
return t;
}
int main()
{
int a,i,s=0,k,b,g=1;
char n[32],m[32];//??????????????????
cin>>a>>n>>b;//??
for(i=0;i<strlen(n);i++)//????????????s
{ for(k=0;k<strlen(n)-i-1;k++)
g=g*a;
s=s+f(n[i])*g;
g=1;
}
i=0;//?i???0?????????
if(s==0) cout<<s;//?s?0???0
while(s!=0)
{ k=s%b;//?b???????????????
if (k>=10) m[i]=k+55;//?????10??????
else m[i]=k+48;//?????10????????????
s=s/b;//??s????????????
i++;//??m[i]
}
k=i;
for(i=k-1;i>=0;i--)
{ cout<<m[i];} //??????????
return 0;
}
|
55 | 27087 | int main()
{
int i,a,b,n,e[100],f[100],value=0;//?????????????
char c[100],d[100];//????????????
cin>>a>>c>>b;
n=strlen(c);
for(i=0;i<n;i++)
if(c[i]>91)c[i]=c[i]-32;//???????????????
for(i=0;i<n;i++)
{
if(c[i]>60)c[i]=c[i]-55;//?????A~Z?????10~35
else
c[i]=c[i]-48;//???0~9?????0~9/* cout<<f[i];*/
}
for(i=0;i<n;i++)
e[i]=(int)(c[i]);//?????c[i]??????????e[i]
for(i=0;i<n;i++)
value=value+e[i]*pow((double)a,(double)(n-i-1));//?????????
if(value==0)cout<<value;
for(i=0;i<100;i++)
if(pow((double)b,(double)i)<value)
{
f[i]=(value%((int)pow((double)b,(double)(i+1))))/
(int)pow((double)b,(double)i);//?f[i]?????????
d[i]=(char)(f[i]);
if(d[i]>9)d[i]=d[i]+55;//???10~35???????A~Z
else
d[i]=d[i]+48;//?0~9???????0~9
}
for(i=99;i>=0;i--)
if(pow((double)b,(double)i)<value)
{
cout<<d[i];
}
return 0;
} |
55 | 27088 | int main()
{
int a,b,i,x=0,len,c[10000],m[10000];
char n[10000]; cin>>a>>n>>b;
for (i=0;n[i]!='\0';i++)
{ if (n[i]>='a' && n[i]<='z' )
c[i]=n[i]-'a'+10;
else if(n[i]>='A' && n[i]<='Z')
c[i]=n[i]-'A'+10;
else c[i]=n[i]-'0';
x=x*a+c[i];
}
i=0;
for (i=0;x>=b;i++)
{
m[i]=x%b;
x=x/b;
}
m[i]=x; len=i;
for (i=len;i>=0;i--)
{
if (m[i]>9) cout<<(char)(m[i]-10+'A');
else cout<<m[i];
}
return 0;
}
|
55 | 27089 | int main ()
{
int m,n;
int num,tot;
int i,j,k1,k2;
int a,b;
char c;
num=tot=0;
m=n=0;
a=b=0;
char s[300];
char s1[300];
int s2[300];
cin >>a;
gets(s);
k1=strlen(s);
k2=k1;
while (s[k1]!=' ') k1--;
k1--;
j=1;
for (i=k1;i>=1;i--)
{
if (isdigit(s[i]))
{
num=(int)s[i];
num=num-48;
tot=tot+j*num;
}
if (islower(s[i]))
{
num=(int)s[i];
num=num-97+10;
tot=tot+j*num;
}
if (isupper(s[i]))
{
num=(int)s[i];
num=num-65+10;
tot=tot+j*num;
}
j=j*a;
}
j=1;
for (i=k2-1;i>=k1+2;i--)
{
num=(int)s[i];
num=num-48;
b=b+j*num;
j=j*10;
}
m=0;
if (tot==0) cout <<0 <<endl;
while (tot>0)
{
m++;
s2[m]=tot%b;
tot=tot/b;
}
if (b<=10)
{
for (i=1;i<=m;i++)
cout <<s2[m-i+1];
}
else
{
for (i=1;i<=m;i++)
if (s2[m-i+1]<=9) cout <<s2[m-i+1];
else
{
n=s2[m-i+1]+65-10;
cout <<(char)n;
}
}
cout <<endl;
return 0;
}
|
55 | 27090 |
int huan(char k);
char huan2(int k);
int main()
{
int a,b;
char *ps,*result;
int *tmp;
ps = (char*) malloc (sizeof(long)*8);
tmp = (int*) malloc (sizeof(long)*8);
result = (char*) malloc (sizeof(long)*8);
scanf("%d",&a);
scanf("%s",ps);
scanf("%d",&b);
int k = strlen(ps);
int i;
long tmp2 = 0;
for(i = 0;ps[i] != '\0';i++)
{
tmp[i] = huan(ps[i]);
tmp2 += (long) (tmp[i] * pow(a,k-1-i));
//printf("t%ld\n",(long) (tmp[i] * pow(a,k-1-i)));
}
//printf("t%ld\n",tmp2);
int l = i - 1;
int *tmp3 = (int*) malloc (sizeof(long)*8);
for(l = 0 ; tmp2 != 0; l++)
{
tmp3[l] = tmp2 % b;
//printf("t3 %d l%d\n",tmp3[l],l);
tmp2 = tmp2 / b;
//printf("l%d\n",l);
}
//printf("l%d\n",l);
int m;
l--;
for (m = 0;l >= 0;l--,m++)
{
result[m] = huan2(tmp3[l]);
//printf("r%c l%d\n",result[m],l);
}
result[m] = '\0';
printf("%s",result);
printf("\n");
free(ps);
free(tmp);
free(result);
return 0;
}
int huan(char k)
{
if ( k <= 57)
{
return k-48;
}
else if ( k >=97 && k <= 122)
{
return k - 87;
}
else if ( k >= 65 && k <= 90)
{
return k - 55;
}
return 0;
}
char huan2(int k)
{
if ( k <= 9 )
{
return k + 48;
}
if ( k >= 10 )
{
return k + 55;
}
return 0;
}
|
55 | 27091 | main()
{
int a,b;
char n[100];
scanf("%d",&a);
scanf("%s",n);
scanf("%d",&b);
long c=0,x;
int i,j,k,l=strlen(n);
for(i=0;i<l;i++)
{
if(n[i]>='A'&&n[i]<='Z')
x=n[i]-'A'+10;
else if(n[i]>='a'&&n[i]<='z')
x=n[i]-'a'+10;
else
x=n[i]-'0';
for(j=1;j<=l-i-1;j++)
x=a*x;
c+=x;
}
int m[100]={-1};
for(j=0;;j++)
{
m[j]=c%b;
c=c/b;
if(c==0)
break;
}
for(k=j;k>=0;k--)
{
if(m[k]>=10)
{
char y;
y='A'+m[k]-10;
printf("%c",y);
}
else
printf("%d",m[k]);
}
} |
55 | 27092 | void main()
{
int a,b,i,t=1,w;
char n[32],k[32]={0};
long m=0;
scanf("%d",&a);
scanf("%s",n);
scanf("%d",&b);
for(i=strlen(n);i>=0;i--)
{
if((n[i]>='0')&&(n[i]<='9'))
{
m=m+(n[i]-'0')*t;
t=t*a;
}
else if((n[i]>='a')&&(n[i]<='z'))
{
m=m+(n[i]-'a'+10)*t;
t=t*a;
}
else if((n[i]>='A')&&(n[i]<='Z'))
{
m=m+(n[i]-'A'+10)*t;
t=t*a;
}
}
if(m==0)
printf("0\n");
else
{
if(b==10)
printf("%ld",m);
else
{
for(i=0;m!=0;i++)
{
w=m%b;
if(w>=0&&w<=9)
k[i]=w+'0';
else if(w>9&&w<36)
k[i]=w-10+'A';
m=(m-w)/b;
}
k[i]='\0';
for(i=strlen(k)-1;i>=0;i--)
printf("%c",k[i]);
printf("\n");
}
}
} |
55 | 27093 | main()
{
int a,b,i,j,k,l,m,n;
long s=0;
int d[32];
char c[32],e[32];
scanf("%d %s %d",&a,c,&b);
if(c[0]=='0')
printf("%d\n",0);
else
{
n=strlen(c);
for(i=0;i<=n-1;i++)
{
if(c[i]<'A')
d[i]=c[i]-'0';
else if(c[i]>='A'&&c[i]<'a')
d[i]=c[i]-'A'+10;
else
d[i]=c[i]-'a'+10;
}
for(i=0;i<=n-1;i++)
{
k=d[i];
for(j=1;j<=n-1-i;j++)
k=k*a;
s=s+k;
}
for(i=0;s>0;i++)
{
l=s%b;
if(l<10)
e[i]=l+'0';
else
e[i]=l-10+'A';
s=s/b;
}
for(m=i-1;m>0;m--)
printf("%c",e[m]);
printf("%c\n",e[0]);
}
getchar();
getchar();
getchar();
} |
55 | 27094 | //*****************************
//*??? :???? *
//*?? :??? *
//*?? :2011?11? *
//*****************************
void zhuan(int, char [], int);
int main ()
{
int a, b;
char n[101];
cin >> a >> n >> b;
zhuan(a, n, b);
return 0;
}
void zhuan(int a, char n[], int b)
{
int i, m[101], s, t;
for (i = 0; ; i++)
{
if (n[i] =='\0') break;
if (n[i] >= 'a' && n[i] <= 'z')
{
m[i] = n[i] - 'a' + 10;
continue;
}
if (n[i] >= 'A' && n[i] <= 'Z')
m[i] = n[i] - 'A' + 10;
else m[i] = n[i] - '0';
}
t = i;
s = m[0];
if (s == 0) cout << 0;
for (i = 0; i < t - 1; i++)
s = s * a + m[i + 1];
for (i = 0; ; i++)
{
if (s == 0) break;
m[i] = s % b;
s = s / b;
}
t = i - 1;
for (i = t; i >= 0; i--)
{
if (m[i] < 10)
cout << m[i];
else cout << (char) (m[i] - 10 + 'A');
}
}
|
55 | 27095 |
int main()
{
long a,b,i,j,k,l,z,length,sum10,zhi;
i=0;
j=0;
k=1;
l=0;
z=0;
length=0;
sum10=0;
zhi=0;
char n[50],r[50];
scanf("%d%s%d",&a,n,&b);
long m[50][2],o[50][2],n2[50];
length=strlen(n);
for(i=0;i<length;i++)
{
if(n[i]<='9')
n2[i]=n[i]-'0';
else if(n[i]<'a'&&n[i]>'9')
n2[i]=n[i]-'A'+10;
else
n2[i]=n[i]-'a'+10;
}
for(i=0;i<length;i++)
{
m[i][0]=n2[i];
m[i][1]=length-i-1;
zhi=m[i][0];
for(j=1;j<=m[i][1];j++)
{
zhi=zhi*a;
}
sum10=sum10+zhi;
zhi=0;
}
if(sum10==0)
printf("0");
else
{
k=sum10;
while(k!=0)
{
o[l][0]=k%b;
k=k/b;
o[l][1]=l;
l++;
}
length=l;
for(i=0;i<length;i++)
{
if(o[l-i-1][0]<=9)
r[i]=48+o[l-i-1][0];
else
r[i]=o[l-i-1][0]-10+65;
}
r[length]='\0';
//printf("%s",r);
puts(r);
}
getchar();
getchar();
} |
55 | 27096 | //
// main.cpp
// hw
//
// Created by ? ? on 12-12-16.
// Copyright (c) 2012? ? ?. All rights reserved.
//
char *atob(int a,int b,char *str1)
{
int len1=strlen(str1),Sum=0;
static char str2[100]={0};
for (int i=0; i<len1; i++) {//a????????
int s;
if (str1[i]<=57) {//?????????
s=str1[i]-'0';
}
if(str1[i]>=65&&str1[i]<=90)
{
s=str1[i]-'A'+10;
}
if(str1[i]>90)
{
s=str1[i]-'a'+10;
}
Sum+=s*pow(a, len1-i-1);
}
for (int i=0; Sum>0; i++) {//??????b??
if (Sum%b<10) {
str2[i]=Sum%b+'0';
}
else
{
str2[i]=Sum%b-10+'A';
}
Sum-=Sum%b;
Sum/=b;
}
int len=strlen(str2);
str2[len]=0;
return str2;
}
int main(int argc, const char * argv[])
{
int a,b;
char str1[100]={0};
cin>>a>>str1>>b;
if (str1[0]=='0') {
cout<<"0";
return 0;
}
char *str2=atob(a,b,str1);
int len=strlen(str2);
for (int i=len-1; i>=0; i--) {
cout<<*(str2+i);
}
return 0;
}
|
55 | 27097 | void main()
{
int a=0,b=0,begin,end,i,j;long int e=0;char c[40]={0};int f(char x);char g(int x);
gets(c);
for(i=0;c[i]!=' ';i++)
a=a*10+c[i]-'0';
begin=i+1;
for(i=begin;c[i]!=' ';i++);
end=i-1;
for(i=end+2;c[i+1]!=0;i++)
b=b*10+c[i]-'0';
for(i=begin;i<=end;i++)
e=a*e+f(c[i]);
if(e==0)printf("0");
for(j=0;e>0;j++)
{
c[j]=g(e%b);
e=e/b;
}
for(i=0;i<j/2;i++)
{
c[39]=c[i];c[i]=c[j-i-1];c[j-i-1]=c[39];
}
c[j]=0;
puts(c);
}
int f(char x)
{
if('0'<=x&&x<='9')
return(x-'0');
else if('A'<=x&&x<='Z')
return(x-'A'+10);
else return(x-'a'+10);
}
char g(int x)
{
if(0<=x&&x<=9)
return(x+'0');
else return(x+'A'-10);
} |
55 | 27098 |
int main()
{
int a,b;
char n[N];
int i,j,t,l;
int sum=0;
scanf("%d %s %d",&a,n,&b);
l=strlen(n);
for(i=0;i<=l/2-1;i++)
{
t=n[i];
n[i]=n[l-i-1];
n[l-i-1]=t;
}
//puts(n);
for(i=0;i<l;i++)
{
if(n[i]>='0'&&n[i]<='9')
t=n[i]-'0';
else if(n[i]>='A'&&n[i]<='Z')
t=n[i]-'A'+10;
else if(n[i]>='a'&&n[i]<='z')
t=n[i]-'a'+10;
for(j=1;j<=i;j++)
{
t=t*a;
}
sum=sum+t;
}
for(i=0;i<N;i++)
n[i]='\0';
for(i=0;sum>=b;i++)
{
n[i]=sum%b;
sum=(sum-sum%b)/b;
if(n[i]<10)
{
n[i]=n[i]+'0';
}
else if(n[i]>=10)
{
n[i]=n[i]-10+'A';
}
}
if(sum<10)
{
n[i]=sum+'0';
}
else if(sum>=10)
{
n[i]=sum-10+'A';
}
l=strlen(n);
for(i=l-1;i>=0;i--)
printf("%c",n[i]);
return 0;
} |
55 | 27099 | int main()
{
char a[100000]={0},b[100000]={0};
int i,n=0,ta,tb;
scanf("%d ",&ta);
scanf("%s",a);
scanf("%d",&tb);
for(i=0;i<strlen(a);i++)
if(a[i]>=97&&a[i]<=122)
a[i]-=32;
for(i=0;i<strlen(a);i++)//?????????n?
{
if(a[i]>=65&&a[i]<=90)
n=ta*n+(a[i]-55);
else n=ta*n+(a[i]-48);
}
//printf("%d\n",n);
if(n==0) printf("0");
else for(i=0;n>0;i++) //
{
if(n%tb<10)
b[i]=n%tb+48;
else b[i]=n%tb+55;
n=n/tb;
}
for(i=strlen(b)-1;i>=0;i--)
printf("%c",b[i]);
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.