Merge branch 'opencodeiiita:main' into main

Author: Rushalverma

.DS_Store

@@ -0,0 +1 @@
+.vscode/ 

.gitignore

@@ -0,0 +1,29 @@
+// link  :  https://codeforces.com/problemset/submission/1560/355483452
+
+#include <bits/stdc++.h>
+using namespace std;
+
+void solve(){
+    int x, y, pos;
+    cin >> x >> y >> pos;
+
+    int cs = 2 * abs(x - y);
+
+    int opp = pos + cs / 2;
+
+    if (pos > cs || y > cs || x > cs) {
+        cout << -1 << endl;
+        return;
+    }
+
+    if (opp > cs)
+        opp -= cs;
+
+    cout << opp << endl;
+}
+
+int main(){
+    int t;
+    cin >> t;
+    while (t--) solve();
+}

Problems/.DS_Store

@@ -0,0 +1,61 @@
+// link : https://codeforces.com/problemset/submission/1225/355484586
+
+
+#include <bits/stdc++.h>
+using namespace std;
+
+void solve() {
+    int n, k;
+    if (!(cin >> n >> k)) return;
+
+    vector<int> a(n);
+    for (int &x : a) cin >> x;
+
+    map<vector<pair<int, int>>, long long> mp;
+    long long res = 0;
+
+    for (int x : a) {
+        int t = x;
+        vector<pair<int, int>> current_factors, required_factors;
+
+        for (int p = 2; p * p <= t; p++) {
+            if (t % p == 0) {
+                int count = 0;
+                while (t % p == 0) {
+                    t /= p;
+                    count++;
+                }
+                count %= k;
+                if (count > 0) {
+                    current_factors.push_back({p, count});
+                    required_factors.push_back({p, k - count});
+                }
+            }
+        }
+
+        if (t > 1) {
+            int count = 1 % k;
+            if (count > 0) {
+                current_factors.push_back({t, count});
+                required_factors.push_back({t, k - count});
+            }
+        }
+
+        if (mp.count(required_factors)) {
+            res += mp[required_factors];
+        }
+        
+        mp[current_factors]++;
+    }
+
+    cout << res << endl;
+}
+
+int main() {
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    solve();
+
+    return 0;
+}

Problems/Mathematics/.DS_Store

@@ -0,0 +1,53 @@
+#include <bits/stdc++.h>
+using namespace std;
+/*
+Logic:
+The main key in solving the problem is that a,b will be enought to know that the size of the area.
+Another observation would be that 1 is always facing the element  more than the element which faces 
+at the last element or the size of the circle.
+Once, you get the size of the array, we just have to check if the any of the elements are larger than 
+the size of the array. 
+On deeper checks like- a=3, b=2,c=1;
+we can observe how this isn't true but how does the conditon fulfill the case?
+--> the max check covers all small checks, like the circle don being possible
+in cases like a=1,b=6, c=100
+--> the circle condition is also checked by the max case. 
+
+So, after the checking, we need to see the answer, that can be easily given as the
+difference is same for all pairs of elements  modular nature of the circle( cool words that make sense)
+ 
+Time complexity-->
+
+The time complexity is O(1)
+The space complexity is O(1)
+
+Submission link- https://codeforces.com/contest/1560/submission/355188467
+*/
+//Soln->
+int main() {
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int t;
+    cin >> t;
+
+    while (t--) {
+        int a,b,c;
+        cin>>a;
+        cin>>b;
+        cin>>c;
+        int x=abs(b-a);
+    if(max({a,b,c})>(2*x))
+    cout<<-1<<endl;
+    else
+    {
+        if(c>x)
+        cout<<c-x<<endl;
+        else
+        cout<<c+x<<endl;
+    }
+    
+    }
+    return 0;
+}
+    

Problems/Mathematics/Day-01/.DS_Store

@@ -0,0 +1,32 @@
+/*
+DAY 1
+Q1 Who's Opposite?
+.*/
+
+typedef long long ll;
+#include <bits/stdc++.h>
+using namespace std;
+
+int main() {
+    int t;
+    cin>>t;
+    while(t--){
+       ll a, b, c;
+        cin >> a >> b >> c;
+
+        ll diff = abs(a - b);
+        ll n = 2 * diff;
+
+        if (diff==0 || max({a,b,c})> n){
+            cout << -1 << endl;
+        } else {
+            ll d = c + diff;
+            if (d > n) d -= n;
+            cout << d << endl;
+    }
+    }
+  return 0;
+}
+/*
+My submission : https://codeforces.com/contest/1560/submission/355307599
+*/