C++ 实现10进制转N进制，N进制转10进制

//一直除以iBase，取余数，直到商为0，把所有余数倒序排列就是出参

int Base10ToBaseN(unsigned int uiSrc,int iBase,char *pOutStr)
{
    unsigned char ABCchane[37] = {'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'};
    unsigned int divide_num,left_num;
    divide_num = uiSrc;
    unsigned char pResult[100]={0};
    int i = 0,j = 0;

    while(1)
    {
        left_num = divide_num % iBase;
        divide_num = divide_num/iBase;
        if(left_num > 9){
            //pResult[i] = ABCchane[left_num-10];
			pResult[i] = left_num - 10 + 'A';
        }else
        {
            pResult[i] = left_num + '0';
        }

        if(divide_num == 0)
        {
            break;
        }
        i++;
    }
    for(j = 0;j<=i;j++)
    {
        *(pOutStr+j) = pResult[i-j];
    }
    return 0;
}

int BaseNToBase10(const char *plnStr,const int iBase)
{
    int i,j,x;
    int sum = 0;
    int count;
    for(i = 0;i = 65)
        {
            count = plnStr[i] - 'A' +10;
        }
        else{
            count = (plnStr[i] - '0');
        }
        x = strlen(plnStr)-i-1;
        while(x > 0)
        {
            x--;
            count = count * iBase;
        }
        sum += count;
    }
    return sum;
}