UPDATED File strcutre

Author: MANISH-BEESA

Problems/Mathematics/Day-01/sol/Hardik Singh Rana/Solution1.cpp

@@ -0,0 +1,44 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+#define ll long long
+#define pb push_back
+#define f(i,a,b) for (ll i = a; i < b; i++)
+#define fb(i,a,b) for (ll i = a; i >= b; i--)
+#define all(v) (v).begin(), (v).end()
+
+typedef vector<int> vi;
+typedef vector<ll> vl;
+typedef pair<int,int> pii;
+typedef pair<ll,ll> pll;
+
+#define fastio ios::sync_with_stdio(false); cin.tie(NULL);
+
+ll binexp(ll a, ll b) {
+    ll res = 1;
+    while (b > 0) {
+        if (b & 1) res = res * a;
+        a = a * a;
+        b >>= 1;
+    }
+    return res;
+}
+
+void solve() {
+    int a,b,c;
+    cin>>a>>b>>c;
+    if(c>2*abs(a-b) or a>2*abs(a-b) or b>2*(abs(a-b))){
+        cout<<-1<<endl;
+    }
+    else{
+        if(c>abs(a-b)) cout<<c-abs(a-b)<<endl;
+        else cout<<c+abs(a-b)<<endl;
+    }
+}
+
+int main() {
+    fastio;
+    int t = 1;
+    cin >> t;
+    while (t--) solve();
+}

Problems/Mathematics/Day-01/sol/Saurav_Gitte/.vscode/settings.json

@@ -0,0 +1,5 @@
+{
+    "files.associations": {
+        "iostream": "cpp"
+    }
+}

Problems/Mathematics/Day-01/sol/Saurav_Gitte/Solution1.cpp

@@ -0,0 +1,71 @@
+/*
+Problem Statement:
+There are n people standing in a circle (n is even). Each person looks at the person
+standing exactly opposite them. Given that person a looks at person b, determine
+the person that person c is looking at.
+
+---------------------------------------
+Approach:
+If 'a' looks at 'b', then the distance between a and b must be exactly n/2.
+Let dist = |a - b|. Then n = 2 * dist.
+Once n is known, the person opposite to c is:
+- c + dist, if it does not exceed n
+- otherwise, c - dist
+
+If c is greater than n, then the configuration is invalid.
+
+----------------------------------------
+
+Time Complexity: O(1)
+
+Space Complexity: O(1)
+
+----------------------------------------
+Example:
+Input:
+a = 1, b = 3, c = 2
+
+Process : 
+1. Calculate dist = |1 - 3| = 2
+2. Calculate n = 2 * dist = 4  
+3. Since c = 2, calculate opposite:
+   - c + dist = 2 + 2 = 4 (which is <= n)
+   - So, the person opposite to c is 4.
+
+Output:
+4
+
+--------------------------------
+*/
+
+#include <bits/stdc++.h>
+using namespace std;
+
+int main() {
+    int t;
+    cin >> t;
+    while (t--) {
+        int a, b, c;
+        cin >> a >> b >> c;
+
+
+        int d = abs(a - b);
+        int n = 2 * d;
+        // 2*10^8 fits in int.
+
+        // Invalid configuration, Answer does not exist
+        if (d == 0 || c > n) {
+            cout << -1 << "\n";
+            continue;
+        }
+
+        int ans;
+        if (c + d <= n)
+            ans = c + d;
+        else
+            ans = c - d;
+
+        cout << ans << "\n";
+    }
+    return 0;
+}

contributers.md

@@ -1,25 +1,12 @@
+| Name                | GitHub ID            | College Name                                                      |
+|---------------------|----------------------|-------------------------------------------------------------------|
+| Pradip Maity        | @codeboy-pro         | Haldia Institute Of Technology                                    |
+| Asra Tabassum       | Tabassumasra05       | IIIT Allahabad                                                    |
+| Suyash              | Skr-suyash           | IIIT Allahabad                                                    |
+| Arnav Singh         | arnavsingh010        | IIIT Allahabad                                                    |
+| Vishva Modh         | ViMo018              | IIIT Allahabad                                                    |
+| Chanderkant Jhorar  | novus547             | IIIT Allahabad                                                    |
+| Aditya Shirsatrao   | adityashirsatrao007  | N. K. Orchid College Of Engineering & Technology, Solapur         |
 
-| Name                    | GitHub ID              | College Name                    |
-|-------------------------|------------------------|---------------------------------|
-| Pradip Maity            | @codeboy-pro           | Haldia Institute Of Technology  |
-| Asra Tabassum           | Tabassumasra05         | IIIT Allahabad                  |
-| Aaroh Parwekar          | aaroh-dell             | Bharati Vidyapeeth              |
-| Suyash                  | Skr-suyash             | IIIT Allahabad                  |
-| Mannat Jain             | mannatjain11465-netizen| IIIT Allahabad                  |
-| Prashant Kumar Dwivedi  | dwivediprashant        | LNCT Bhopal                     |
-| Arnav Singh             | arnavsingh010          | IIIT Allahabad                  |
-| Mohan Kumar             | aricthecoder           | IIIT Allahabad                  |
-| Vishva Modh             | ViMo018                | IIIT Allahabad                  |
-| Varad Singhal           | VaradSinghal           | SRMIST                          |
-| Hardik Singh Rana       | hardik-rana02          | IIIT Allahabad                  |
-| OMDEEP                  | omicoded19             | IIITA                           | 
-| BEESA MANISH            | MANISH-BEESA           | MLRIT                           |
-| Himansh Arora           | Humanshere             |  IIIT Allahabad                 | 
-| Kushagra Raghuvanshi    | Taskmaster-afk         | IIIT Allahabad                  |
-| Kamakshi Gupta          | 29kamakshigupta        | IIIT Allahabad                  |
-| Pranshu Sethi           | iampranshusethi        | IIIT Allahabad                  |
-| Abhay Pratap Singh      | d2-e2-v2               | IIIT Allahabad                  |  
-| Saurav Gitte            | SauravGitte            | IIIT Allahabad                  |
- <!-- ADD ABOVE THIS -->
+<!-- ADD ABOVE THIS -->
 <!-- example | Korvac | Betty | Reyansh College | -->
-