A plus B（这题有点坑）

最新推荐文章于 2022-11-19 23:02:34 发布

起风了_唯有努力生存

最新推荐文章于 2022-11-19 23:02:34 发布

阅读量1k

点赞数

分类专栏： ACM竞赛【强行模拟，最为致命】 ACM的进程

本文链接：https://blog.csdn.net/duan_1998/article/details/53982363

版权

ACM的进程同时被 3 个专栏收录

293 篇文章 6 订阅

订阅专栏

ACM竞赛

292 篇文章 1 订阅

订阅专栏

【强行模拟，最为致命】

28 篇文章 0 订阅

订阅专栏

1056 - A plus B

Time Limit：1s Memory Limit：64MByte

Submissions：990Solved：240

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

     176 7 
   

SAMPLE OUTPUT

67

SOLUTION

“玲珑杯”ACM比赛 Round #5

输入数据会有点大，所以单纯用%o来输入的话，就会WA，所以代码如下：

#include<stdio.h>
#include<math.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{

    int T;
    scanf("%d",&T);
    while(T--)
    {
        long  a,b;
        scanf("%llo%llo",&a,&b);
        if(a>b)
        printf("%llo\n",a-b);
        else printf("-%llo\n",b-a);
    }
    return 0;
}