Merge branch 'opencodeiiita:main' into Arnav

Author: arnavsingh010

.DS_Store

@@ -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,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
+*/

Problems/Mathematics/Day-01/.DS_Store

@@ -0,0 +1,64 @@
+/*
+DAY 1
+Q2 Power Products
+.*/
+
+#include <bits/stdc++.h>
+using namespace std;
+
+// Function to factorize a number and return prime exponents modulo k
+map<int, int> factorizeMod(long long x, int k) {
+    map<int, int> factors;
+    for (long long p = 2; p * p <= x; ++p) {
+        int count = 0;
+        while (x % p == 0) {
+            x /= p;
+            count++;
+        }
+        if (count % k != 0) {
+            factors[p] = count % k; // only store modulo k
+        }
+    }
+    if (x > 1) factors[x] = 1 % k; // remaining prime factor
+    return factors;
+}
+
+// Function to compute the complement signature modulo k
+map<int, int> complementSignature(const map<int, int>& sig, int k) {
+    map<int, int> comp;
+    for (auto &[prime, exp] : sig) {
+        comp[prime] = (k - exp) % k;
+    }
+    return comp;
+}
+
+int main() {
+
+    int n, k;
+    cin >> n >> k;
+    vector<long long> a(n);
+    for (int i = 0; i < n; ++i) cin >> a[i];
+
+    // Map to count how many times each signature has occurred
+    map<map<int,int>, long long> signatureCount;
+    long long totalPairs = 0;
+
+    for (int i = 0; i < n; ++i) {
+        map<int,int> sig = factorizeMod(a[i], k);
+        map<int,int> comp = complementSignature(sig, k);
+
+        // Add pairs that match the complement
+        totalPairs += signatureCount[comp];
+
+        // Increment count of current signature
+        signatureCount[sig]++;
+    }
+
+    cout << totalPairs << "\n";
+    return 0;
+}
+
+
+/*
+My submission : https://codeforces.com/contest/1225/submission/355325134
+*/