GEOPROB  One Geometry Problem
This is a problem of Euclidean Geometry. See the figure below.
Your task is as follows: given the lengths of segments b, c, and d, calculate the length of segment a.
Input
The input begins with the number t of test cases in a single line (t<=300). In each of the next t lines there are three integers b, c and d (0 <= b, c and d <= 10^{200} ; b,d < c) separated by a space.
Output
For every test case print the length of the segment a, one number per line.
Example
Input: 2 3 8 5 10 18 12 Output: 8 14
hide comments
exesharkx:
20190412 11:58:05
C++ boost Library Last edit: 20190412 11:58:17 

gooooooogol:
20181224 16:04:08
my penis tiny Last edit: 20210115 15:50:28 

imkiller:
20180603 19:25:07
java bigInteger success.. got error in python 

shreeshiv:
20170726 15:33:08
infant do in python, boys do in java ,legends do in c++,c 

rayhan50001:
20170226 16:51:16
BigInteger Java ... ac in one go. 

fmakruf:
20170119 11:41:06
got ac in one go with python :) 

aditya_rev:
20161109 17:56:05
big number is big problem in c ;(( 

Maciej Misiak:
20161011 23:21:32
Some condition is missing for the task. There is more than one proper answer, e.g. for 3 8 5 right answer could be 16 as well (distance between b and c == 1). Should one find shortest a or what? 

poda_venna:
20160827 22:00:34
6 line python woooot 

shashisuman:
20160703 12:44:16
BigInteger pooooooooooooooooooooo 
Added by:  Frank Rafael Arteaga 
Date:  20080730 
Time limit:  1s 
Source limit:  4000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  ADA95 ASM32 BASH BF C CSHARP CPP C99 CLPS LISP sbcl LISP clisp D FORTRAN HASK ICON ICK JAVA LUA NEM NICE OCAML PASGPC PASFPC PERL PHP PIKE PRLGswi PYTHON RUBY SCM qobi SCM guile ST TEXT WHITESPACE 
Resource:  My own Resource 