ACdream 1079 郭式树

http://acdreamoj.sinaapp.com/problem.php?id=1079

注意好  I64d 和 long long  特判  最大值就行；

#include<iostream>
#include<stdio.h>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;

long long a,b,c,d;

long long abs( long long a,long long b )
{
    d = a-b;
    return d>0? d:-d;
}

int main( )
{
    int T;
      scanf("%d",&T);
      while( T-- )
      {
         scanf("%lld %lld",&a,&b);
         if( a == -4611686018427387904 && b == 4611686018427387904 )
               printf("9223372036854775808\n");
         else if ( a ==  4611686018427387904 && b == -4611686018427387904 )
               printf("9223372036854775808\n");
         else
         {
               c = abs(a-b);
               printf("%lld\n",c);
         }
      }
    return 0;
}