#Lutece2358. a?b problem 1

a?b problem 1

Migrated from Lutece 2358 a?b problem 1

All parts of this problem, including description, images, samples, data and checker, might be broken. If you find bugs in this problem, please contact the admins.

Description

forgottencsc在测他的高精度无符号整数板子。

TT组数据,每组数据形如aopba \quad op \quad b

其中op{+,,,/}op \in \{+,-,*,/\},除法为向0取整。

请输出对应的运算结果。

Samples

8
114514 + 1919
114514 - 1919
114514 * 1919
114514 / 1919
114514191981011451419198101145141919810 + 893364893364893364893364893364893364
114514191981011451419198101145141919810 - 893364893364893364893364893364893364
114514191981011451419198101145141919810 * 893364893364893364893364893364893364
114514191981011451419198101145141919810 / 893364
116433
112595
219752366
59
115407556874376344784091466038506813174
113620827087646558054304736251777026446
102302958907883222168882661314089880036718020113095798810138317706889140840
128183128020618081117213253662719

Constraints

对于25%的数据:

0a+b2101030 \leq \sum{|a|} + \sum{|b|} \leq 2 * 10^{10^3}

对于50%的数据:

0a+b2101040 \leq \sum{|a|} + \sum{|b|} \leq 2 * 10^{10^4}

对于75%的数据:

0a+b2101050 \leq \sum{|a|} + \sum{|b|} \leq 2 * 10^{10^5}

对于100%的数据:

T10T \geq 10

0a+b2101060 \leq \sum{|a|} + \sum{|b|} \leq 2 * 10^{10^6}

保证运算结果非负

Note

数据随机

数据是用Boost.Multiprecision造的

欢迎提供Hack

Resources

forgottencsc