【玲珑学院 1056 1056 - A plus B】+ 八进制

最新推荐文章于 2024-08-25 21:35:04 发布

楚江枫

最新推荐文章于 2024-08-25 21:35:04 发布

阅读量424

点赞数

本文链接：https://blog.csdn.net/WYK1823376647/article/details/53353902

版权

玲珑杯专栏收录该内容

10 篇文章 0 订阅

订阅专栏

该博客介绍了一道编程题目，要求在八进制数下计算a加b的结果。题目中给出了时间限制和内存限制，并提供了样例输入和输出。解决方法包括将八进制转换为10进制进行计算，再转回八进制表示。

摘要由CSDN通过智能技术生成

1056 - A plus B

Time Limit：1s Memory Limit：64MByte

Submissions：841Solved：197
DESCRIPTION

Two octal number integers a, b are given, and you need calculate the result a - b in octal notation.
If the result is negative, you should use the negative sign instead of complement notation.

INPUT
The first line is an integer T(1 <= T <= 1000), indicating the number of test cases.
For each case, the first and only line contains two octal integers a, b.
(0 <= a, b < 2^32)
OUTPUT
Print the result, one per line, in octal notation.
SAMPLE INPUT
1
76 7
SAMPLE OUTPUT
67

自己把八进制转换成 10 进制算最后再转换回去～～大佬们都用8进制直接过～～

#include<cstdio>
typedef long long LL;
LL so(LL x){
    LL cut = 0,sum = 1;
    while(x){
        LL a = x % 10;
        x /= 10;
        cut += sum * a;
        sum *= 8;
    }
    return cut;
}
LL co(LL x){
    LL cut = 0,sum = 1;
    while(x){
        LL a = x % 8;
        x /= 8;
        cut += sum * a;
        sum *= 10;
    }
    return cut;
}
int main()
{
    LL T,a,b;
    scanf("%lld",&T);
    while(T--){
        scanf("%lld %lld",&a,&b);
        if(a >= b)
            printf("%lld\n",co(so(a) - so(b)));
        else
            printf("-%lld\n",co(so(b) - so(a)));
    }
    return 0;
}