zoj 1334
2011-09-11 21:14
274 查看
代码如下:
#include <stdio.h> #include <math.h> #include <string.h> char zimu[]="0123456789ABCDEF"; int main() { char str[10]; int re[10]; int a,b,length,i,sum,j; memset(re,0,10); memset(str,0,10); while(scanf("%s%d%d",str,&a,&b)!=EOF) { sum=0; length=strlen(str); for (i=length-1;i>=0;i--) { if (str[i]>='A'&&str[i]<='F') { sum=sum+(str[i]-'A'+10)*(int)pow(a,length-1-i); } else { sum=sum+(str[i]-'0')*(int)pow(a,length-1-i); } } i=0; while(sum>0) { re[i]=sum%b; sum=sum/b; i++; } if (i>7) { printf(" ERROR"); } else { for (j=i;j<7;j++) { printf(" "); } for (j=i-1;j>=0;j--) { printf("%c",zimu[re[j]]); } } printf("\n"); memset(re,0,10); memset(str,0,10); } return 0; }
相关文章推荐
- ZOJ 1334 任意进制转换
- ZOJ Problem Set - 1334 Basically Speaking ac代码及总结
- ZOJ-1334
- poj 1543 & HDU 1334 & ZOJ 1331 Perfect Cubes(数学 暴力大法好)
- 【ACM打卡】ZOJ 1334
- zoj 1334
- ZOJ 1334 Basically Speaking
- HDU 1335 || ZOJ 1334 Basically Speaking
- zoj 1334 Basically Speaking
- zoj 1334 Basically Speaking(进制转换)
- zoj 1334 Basically Speaking
- zoj 1334 进制转换类问题
- POJ1546 & HDU 1335 & ZOJ 1334 Basically Speaking(进制转换)
- poj 1222 & zoj 1354 EXTENDED LIGHTS OUT (枚举)
- zoj 3765 Lights(Splay)
- ZOJ 3870 Team Formation(异或)
- ZOJ 2112 Dynamic Rankings 动态区间第k大 分块
- ZOJ 3511 Cake Robbery
- ZOJ 3213
- 数学题ZOJ3870 Team Formation(2015浙江省赛)