Acdream 1061 郭式树

Acdream 1061 郭式树

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
#define ULL unsigned long long 
#define LL long long
int main(){
    int T;scanf("%d",&T);
    LL A,B;
    ULL ans;
    //ULL aa=9223372036854775807;
    //cout<<aa;
    while(T--){
        scanf("%lld%lld",&A,&B);
        if((A>=0&&B>=0)||(A<=0&&B<=0)){
            ans=(A>B?A-B:B-A);
        }
        else if((A==4611686018427387904&&B==-4611686018427387904)||(B==4611686018427387904&&A==-4611686018427387904)){
            printf("9223372036854775808\n");
            continue;
        }
        else{
            ans=(ULL)(A>B?A-B:B-A);
        }
        printf("%lld\n",ans);
    }
    return 0;
}