Merge branch 'main' into main

Author: Dheeraj-06

Problems/Mathematics/Day-01/sol/Pritha/solution.cpp

@@ -0,0 +1,30 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main(int argc, char const *argv[])
+{
+    int t;
+    cin >> t;
+    while (t--)
+    {
+        long long int a, b, c;
+        cin >> a >> b >> c;
+        if ((c <= abs(b - a) * 2) && (abs(b - a) >= min(a, b)))
+        {
+            if (c + abs(b - a) <= abs(b - a) * 2)
+            {
+                cout << c + abs(b - a) << endl;
+            }
+            else
+            {
+                cout << c - abs(b - a) << endl;
+            }
+        }
+        else
+        {
+            cout << -1 << endl;
+        }
+    }
+
+    return 0;
+}

Problems/Mathematics/Day-01/sol/amansharma264/solution2.cpp

@@ -0,0 +1,143 @@
+/*
+====================================================
+PROBLEM STATEMENT:
+====================================================
+You are given an integer n and an integer k (k ≥ 2),
+along with an array of n positive integers.
+
+Your task is to count the number of unordered pairs
+(i, j) such that:
+- 1 ≤ i < j ≤ n
+- ai × aj is a perfect k-th power
+
+A number is a perfect k-th power if it can be written
+as x^k for some integer x.
+
+----------------------------------------------------
+PROBLEM LINK:
+https://codeforces.com/problemset/problem/1225/D
+====================================================
+*/
+
+/*
+====================================================
+APPROACH:
+====================================================
+Key Idea:
+For a product ai × aj to be a perfect k-th power,
+the total exponent of every prime factor in the
+product must be divisible by k.
+
+Steps:
+1. For each number ai, perform prime factorization.
+2. Reduce each prime’s exponent modulo k.
+3. Store the resulting factorization as "cur".
+4. Compute the complementary factorization "need"
+   such that:
+       cur × need → all exponents divisible by k
+5. Use a map to count how many times "need"
+   has appeared before.
+6. Add that count to the answer.
+7. Insert "cur" into the map.
+
+----------------------------------------------------
+WHY THIS WORKS:
+- Pairing numbers whose prime exponents complement
+  each other modulo k ensures the product becomes
+  a perfect k-th power.
+====================================================
+*/
+
+/*
+====================================================
+TIME & SPACE COMPLEXITY:
+====================================================
+Time Complexity:
+O(n * sqrt(ai))   (prime factorization per element)
+
+Space Complexity:
+O(n)              (map storage)
+====================================================
+*/
+
+/*
+====================================================
+EXAMPLE:
+====================================================
+Input:
+6 3
+1 3 9 8 24 1
+
+Output:
+5
+
+Explanation:
+There are 5 unordered pairs whose product is a
+perfect cube.
+====================================================
+*/
+
+/*
+====================================================
+SUBMISSION LINK:
+====================================================
+(Add your Codeforces submission link here after AC)
+====================================================
+*/
+
+#include <bits/stdc++.h>
+using namespace std;
+
+#define fastio() ios::sync_with_stdio(false); cin.tie(nullptr);
+
+int main() {
+    fastio();
+
+    int n, k;
+    cin >> n >> k;
+
+    vector<int> a(n);
+    for (int i = 0; i < n; i++) {
+        cin >> a[i];
+    }
+
+    map<vector<pair<int,int>>, long long> mp;
+    long long ans = 0;
+
+    for (int x : a) {
+        vector<pair<int,int>> cur, need;
+
+        int temp = x;
+        for (int p = 2; p * p <= temp; p++) {
+            if (temp % p == 0) {
+                int cnt = 0;
+                while (temp % p == 0) {
+                    temp /= p;
+                    cnt++;
+                }
+                cnt %= k;
+                if (cnt) {
+                    cur.push_back({p, cnt});
+                    need.push_back({p, (k - cnt) % k});
+                }
+            }
+        }
+
+        if (temp > 1) {
+            int cnt = 1 % k;
+            if (cnt) {
+                cur.push_back({temp, cnt});
+                need.push_back({temp, (k - cnt) % k});
+            }
+        }
+
+        sort(cur.begin(), cur.end());
+        sort(need.begin(), need.end());
+
+        ans += mp[need];
+        mp[cur]++;
+    }
+
+    cout << ans << '\n';
+    return 0;
+}

Problems/Mathematics/Day-02/sol/Avaneesh Verma/soln001.cpp

@@ -0,0 +1,40 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int t;
+    cin >> t;
+    vector<int> results(t);
+
+    for(int i = 0; i < t; i++){
+        int n;
+        cin >> n;
+
+        vector<int> arr(n);
+        for (int j = 0; j < n; j++){
+            cin >> arr[j];
+        }
+
+        int max = 0;
+        for(int x = 0; x < n; x++){
+            for(int y = 0; y < n; y++){
+             if(abs(arr[x]-arr[y])>=max){
+                max=abs(arr[x]-arr[y]);
+             }
+            }
+        }
+        int count = 0;
+        for(int x = 0; x < n; x++){
+            for(int y = 0; y < n; y++){
+                if(abs(arr[x] - arr[y]) == max){
+                    count++;
+                }
+            }
+        }
+        results[i] = count;
+    }
+    for(int i = 0; i < t; i++){
+        cout << results[i] << endl;
+    }
+    return 0;
+}

Problems/Mathematics/Day-02/sol/Kushagra Raghuvanshi/Solution2.cpp

@@ -0,0 +1,37 @@
+//https://codeforces.com/problemset/submission/1771/355389933
+
+#include <bits/stdc++.h>
+using namespace std;
+
+int main() {
+    int t;
+    cin >> t;
+
+    while (t--) {
+        int n;
+        cin >> n;
+
+        long long a[n];
+        for (int i = 0; i < n; i++)
+            cin >> a[i];
+
+        long long mn = a[0], mx = a[0];
+        for (int i = 1; i < n; i++) {
+            mn = min(mn, a[i]);
+            mx = max(mx, a[i]);
+        }
+
+        long long cmin = 0, cmax = 0;
+        for (int i = 0; i < n; i++) {
+            if (a[i] == mn) cmin++;
+            if (a[i] == mx) cmax++;
+        }
+
+        if (mn == mx)
+            cout << n * (n - 1) << "\n";
+        else
+            cout << 2 * cmin * cmax << "\n";
+    }
+
+    return 0;
+}           

contributers.md

@@ -73,5 +73,7 @@
 |Aman Sharma |          | amansharma264  |Sir M Visvesvaraya Institute of Technology                                  |
 | Aaryan Degama  |  Aaryan-Degama  |  IIIT Allahabad                                                                  |
 | Sachin Benakannavar | sachinbenakannavar696 | IIIT Allahabad |
+| Aaryan Degama  |  Aaryan-Degama  |  IIIT Allahabad        
+|Aditi Deshmukh         | InsanelySlowBurn          | IIIT Allahabad                                                          |
 <!-- ADD ABOVE THIS -->
 <!-- example | Korvac | Betty | Reyansh College | -->