zoj 2982 Weird Numbers

zoj 2982 Weird Numbers,第1张

zoj 2982 Weird Numbers
#include<iostream>#include<string.h>#include<stdio.h>#include<algorithm> using namespace std;enum {    SIZ = 104,    TO  = 0,    FRO = 1,};int base, type, len;char input[SIZ];char output[SIZ];void convTo() {    int sign = 1;    int src = atoi(input), rem;    int pos = src >= 0?1:-1;    if (pos < 0){        src = -src;    }    len = 0;    while(src){        rem = (base + src % base)%base;        if (sign * pos < 0 && rem){ rem = base - rem; src += rem;        } else { src -= rem;        }        output[len++] = '0' + rem;        src /= base;        sign = -sign;    }    if (len == 0){        output[len++] = '0';    }    output[len] = 0;    reverse(output, output + len);    printf("%sn", output);}void convFrom() {    int d = 0;    char *p = input;    while(*p){        d *= -base;        d += *p - '0';        ++p;    }    printf("%dn", d);}void fun(){    if (type == TO){        convTo();    } else {        convFrom();    }}void parsebase(){    char *p = index(input, '-');    *p = 0;    base = atoi(p+1);    if (strcmp(input, "to") == 0) {        type = TO;    } else {        type = FRO;    }}int main(){    scanf("%s ", input);    while(strcmp(input, "end") != 0){        parsebase();        scanf("%s ", input);        fun();        scanf("%s ", input);    }    return 0;}

欢迎分享,转载请注明来源:内存溢出

原文地址: http://outofmemory.cn/zaji/4929215.html

(0)
打赏 微信扫一扫 微信扫一扫 支付宝扫一扫 支付宝扫一扫
上一篇 2022-11-12
下一篇 2022-11-12

发表评论

登录后才能评论

评论列表(0条)

保存