Merge pull request #56 from VaradSinghal/varad_singhal

Solved day001

Author: zonedoutdg

Problems/Mathematics/Day-01/sol/VaradSinghal/solution.py

@@ -0,0 +1,21 @@
+def solve():
+    t = int(input())
+    for _ in range(t):
+        a, b, c = map(int, input().split())
+        
+        d = abs(a - b)
+        n = 2 * d
+        
+      
+        if n == 0 or max(a, b, c) > n:
+            print(-1)
+            continue
+        
+        half = n // 2
+    
+        if c + half <= n:
+            print(c + half)
+        else:
+            print(c - half)
+
+solve()

Problems/Mathematics/Day-01/sol/VaradSinghal/solution1.py

@@ -0,0 +1,21 @@
+def solve():
+    t = int(input())
+    for _ in range(t):
+        a, b, c = map(int, input().split())
+        
+        d = abs(a - b)
+        n = 2 * d
+        
+        if n == 0 or max(a, b, c) > n:
+            print(-1)
+            continue
+        
+        half = n // 2
+ 
+        if c + half <= n:
+            print(c + half)
+        else:
+            print(c - half)
+
+# Run
+solve()