Merge pull request #140 from iit2025280-sys/main

solved solution1.cpp

Author: zonedoutdg

Problems/Mathematics/Day-01/sol/Paarth_arora/solution1.cpp

@@ -0,0 +1,25 @@
+//https://codeforces.com/submissions/paarth_arora link for submissions
+#include <bits/stdc++.h>
+using namespace std;
+int main() {
+     int t;
+    cin >> t;
+    while(t--) {
+        long long  a,b,c;
+        cin>>a>>b>>c;
+        if((abs(b-a))*2<max(a,max(b,c))){
+            cout << -1 <<'\n';
+        }
+        
+        else if(c+(abs(b-a))>(abs(b-a)*2)){
+            cout<<(c+(abs(b-a)))%(abs(b-a)*2)<<endl;
+        }
+        else{
+            cout<<c+(abs(b-a))<<endl;
+        }
+    }
+
+    return 0;
+}
+//time complexity-o(1)
+//space complexity-o(1)