Merge branch 'opencodeiiita:main' into main

Author: AmanMehta22

.DS_Store

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

.gitignore

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

Problems/Mathematics/.DS_Store

@@ -0,0 +1,38 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+const ll MOD = 998244353;
+
+void solve() {
+    int a, b, c;
+    cin >> a >> b >> c;
+
+    int diff = abs(a-b);
+    if (a > 2*diff || b > 2*diff || c > 2*diff) {
+        cout << -1 << endl;
+        return;
+    }
+
+    int ans = c + diff;
+    if (ans > 2*diff) {
+        ans -= 2*diff;
+    }
+
+    cout << ans << endl;
+
+}
+
+int main() {
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+    
+    int t = 1;
+    cin >> t;
+    
+    while (t--) {
+        solve();
+    }
+    
+    return 0;
+}

Problems/Mathematics/Day-01/.DS_Store

@@ -0,0 +1,77 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+static const int maxi = 100000;
+int spf[maxi + 1];
+int k;
+
+/*sieve*/
+void buildSPF() {
+    for (int i = 1; i <= maxi; i++)
+        spf[i] = i;
+
+    for (int i = 2; i * i <= maxi; i++) {
+        if (spf[i] == i) {
+            for (int j = i * i; j <= maxi; j += i) {
+                if (spf[j] == j)
+                    spf[j] = i;
+            }
+        }
+    }
+}
+
+/*factorise*/
+vector<pair<int,int>> getSignature(int x) {
+    map<int,int> factors;
+
+    while (x > 1) {
+        int p = spf[x];
+        factors[p]++;
+        x /= p;
+    }
+
+    vector<pair<int,int>> sig;
+    for (auto &it : factors) {
+        int exp = it.second % k;
+        if (exp != 0)
+            sig.push_back({it.first, exp});
+    }
+    return sig;
+}
+
+/*how many needed*/
+vector<pair<int,int>> getComplement(const vector<pair<int,int>> &sig) {
+    vector<pair<int,int>> comp;
+    for (auto &p : sig) {
+        comp.push_back({p.first, (k - p.second) % k});
+    }
+    return comp;
+}
+
+int main() {
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int n;
+    cin >> n >> k;
+
+    vector<int> a(n);
+    for (int i = 0; i < n; i++)
+        cin >> a[i];
+
+    buildSPF();
+
+    map<vector<pair<int,int>>, long long> freq;
+    long long ans = 0;
+
+    for (int i = 0; i < n; i++) {
+        vector<pair<int,int>> sig = getSignature(a[i]);
+        vector<pair<int,int>> need = getComplement(sig);
+        ans += freq[need];
+        freq[sig]++;
+    }
+    cout << ans << "\n";
+    return 0;
+}
+//https://codeforces.com/problemset/submission/1225/355302622
+//time  complexity O(nlognlog(10^5))