[2019牛客国庆集训派对day5 A]Simple Arithmetic

a/b向下取整，特判9223372036854775808超long long

#include <iostream>
#include <queue>
#include <cstring>
#include <cmath>
#include <algorithm>
 
using namespace std;
 
typedef long long LL;
 
int main() {
	LL a,b;
	while(cin >> a) {
		cin >> b;
        if(a==-9223372036854775808 && b==-1) {
            puts("9223372036854775808");
            continue;
        }
        LL tp = a/b;
		if(a%b!=0 && ((a<0)^(b<0))) tp--;
		printf("%lld\n",tp );
	}
    return 0;
}

链接：https://ac.nowcoder.com/acm/contest/1110/A
来源：牛客网
 

题目描述

Given a and b which both fit in 64-bit signed integers, find ⌊ab⌋\lfloor \frac{a}{b} \rfloor⌊ba​⌋ where ⌊x⌋\lfloor x \rfloor⌊x⌋ denotes the largest integer which is not larger than x.

输入描述:

The input contains zero or more test cases and is terminated by end-of-file.
Each test case contains two integers a, b.
* −263≤a,b<263-2^{63} \leq a, b < 2^{63}−263≤a,b<263
* b≠0b \neq 0b​=0
* The number of tests cases does not exceed 10410^4104.

输出描述:

For each case, output an integer which denotes the result.

示例1

输入

复制

3 2
3 -2
-9223372036854775808 1
-9223372036854775808 -1

输出

复制

1
-2
-9223372036854775808
9223372036854775808