joj 2259 进制转换（含负进制）

N-Converter

http://acm.jlu.edu.cn/joj/showproblem.php?pid=2259&off=2200

#include<iostream>
#include<cstdio>
using namespace std;

int change(int n)
{
    if(n<0)
    n=-n;
    return n;
}

void work(int n,int r)
{
    int m;
    if(change(r)>1&&!(n<0&&r>0))
    {
        int result[100];
        int *p=result;
        if(n!=0)
        {
            while(n!=0)
            {
                m=n/r;
                *p=n-m*r;
                if(*p<0&&r<0)
                {
                    *p=*p+change(r);
                    m++;
                }
                p++;
                n=m;
            }
        }
        for(m=p-result-1;m>=0;m--)
        {
            if(result[m]>9)
            printf("%c",55+result[m]);
            else printf("%d",result[m]);
        }
    }
    else printf("0");
    printf("/n");
}

int main()
{
    int n,b;
    while(scanf("%d%d",&n,&b)!=-1)
    {
        work(n,b);
    }
    return 0;
}