一、P进制数x(a1 a2 a3 a4 an)->10进制数y
实现原理:y=a1P^(n-1) + a2P^(n-2)+…+a(n-1)*P+an
int y=0,product=1;
while(x != 0){
y = y + (x%10) * product
x = x/10;
product = product * P;
}
二、10进制数y>Q进制数z
除基取余法
int z[40],num=0;
do{
z[num++]=y%Q;
y=y/Q;
}while(y!=0);