20位数字转成62进制

1.代码：

#include <stdio.h>
#include <string.h>
int qy(char *str1){
    char a[3000];
    int k = 62;
    int b[3000];
    int l;
    int i;
    sprintf(a, "%s",str1);
    l=strlen(a);
    for(i=0;i<l;i++)
    {
        b[i]=a[i]-'0';
    }
    for(i=0;i<l;i++)
    {
        b[i+1]=(b[i]*10+b[i+1])%k;
    }
    return b[l-1];

}
#define MAXSIZE 1025
void Div(char *str1, char *str2, char *str3)
{
int i1, i2, i, j, jj, tag, carry, cf, c[MAXSIZE];
int len1 = strlen(str1), len2 = strlen(str2), lend;
char d[MAXSIZE];
memset(c, 0, sizeof(c));
memcpy(d, str1, len2);
lend = len2; j = 0;
for( i1=len2-1; i1 < len1; ++i1 )
{
if( lend < len2 )
{
d[lend] = str1[i1+1]; c[j] = 0;
++j; ++lend;
}
else
if( lend == len2 )
{
jj = 1;
for( i=0; i < lend; ++i )
{
if( d[i] > str2[i] ) break;
else if( d[i] < str2[i] )
{
jj = 0; break;
}
}
if( jj == 0 )
{
d[lend] = str1[i1+1]; c[j] = 0;
++j; ++lend;
continue;
}
}
if( jj==1 || lend > len2 )
{
cf = jj=0;
while( d[jj] <= '0' && jj < lend ) ++jj;
if( lend-jj > len2 ) cf = 1;
else
if( lend-jj < len2 ) cf = 0;
else
{
i2 = 0; cf = 1;
for( i=jj; i < lend; ++i )
{
if( d[i] < str2[i2] )
{
cf = 0; break;
}
else if( d[i] > str2[i2] )
{
break;
}
++i2;
}
}//else
while( cf )
{
i2 = len2-1; cf = 0;
for( i=lend-1; i >= lend-len2; --i )
{
d[i] = d[i]-str2[i2]+'0';
if( d[i] < '0' )
{
d[i] = d[i]+10; carry = 1;
--d[i-1];
}
else carry = 0;
--i2;
}
++c[j]; jj=0;
while( d[jj] <= '0' && jj < lend ) ++jj;
if( lend-jj > len2 ) cf = 1;
else
if( lend-jj < len2 ) cf = 0;
else
{
i2 = 0; cf = 1;
for( i=jj; i < lend; ++i )
{
if( d[i] < str2[i2] )
{
cf = 0; break;
}
else if( d[i] > str2[i2] )
{
break;
}
++i2;
}
}//else
}//while
jj = 0;
while( d[jj] <= '0' && jj < lend ) ++jj;
for( i=0;i < lend-jj; ++i ) d[i] = d[i+jj];
d[i] = str1[i1+1]; lend = i+1;
++j;
}//else
}//for
i = tag = 0;
while( c[i] == 0 ) ++i;
for( ; i < j; ++i, ++tag ) str3[tag] = c[i]+'0';
str3[tag] = '\0';
}
char* strrev(char *str)
{
    char *p1, *p2;
    if (! str || ! *str)
        return str;
    for (p1 = str, p2 = str + strlen(str) - 1; p2 > p1; ++p1, --p2)
    {
        *p1 ^= *p2;
        *p2 ^= *p1;
        *p1 ^= *p2;
    }
    return str;
}
void tranfer(char a[110],char result[110])
{
    char digit[100] = "0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
    char b[110],c[110];
    //char a[110]="10000001611885831402";
    int k = 62;
    char arr[100]; 
    int rem;

    memset(c, '\0', sizeof(c));
    memset(arr, '\0', sizeof(arr));
    sprintf(b, "%d",k);
    int i=0;
    while(i<62){
       rem = qy(a);
       Div( a, b, c );
       memset(a, '\0', sizeof(a));
       strcpy(a,c);
       arr[i] =  digit[rem];
       i++;
       if(strcmp(c,"") == 0){
          break;
       }
    }
    sprintf(result,"%s\n", strrev(arr) );
    
}

int main()
{
    char a[110]="10000001611885831402";
    char result[110];
    tranfer(a,result);
    printf("%s\n", result);

    return 0;
}

 

2.编译：gcc -m32 -o cc test.c

3.运行结果：

[root@srv140 cxm]# ./cc

bUI72cdCzGi