SDUT - 2131 数据结构实验之栈与队列一:进制转换

#include <stdio.h>
#include <string.h>
int a[1005], p = 0;
int main()
{
    int n, i, m;
    scanf("%d %d", &n, &m);
    if(n == 0){printf("0\n"); return 0;}
    while(n)
    {
        a[p++] = n % m;
        n /= m;
    }
    for(i = p - 1; i >= 0; i--)printf("%d", a[i]);
    printf("\n");
    return 0;
}

猜你喜欢

转载自blog.csdn.net/Miracle_QSH/article/details/81806133