Merge branch 'main' into main

Author: Himanshu-1903

Problems/Mathematics/Day-01/q002.md

@@ -0,0 +1,50 @@
+## Problem Description
+
+You are given an integer `n` and an integer `k` (`k ≥ 2`), along with an array of `n` positive integers  
+`a1, a2, ..., an`.
+
+Your task is to count the number of unordered index pairs `(i, j)` such that:
+
+- `1 ≤ i < j ≤ n`
+- The product `ai × aj` is a **perfect k-th power**
+
+A number is called a perfect k-th power if it can be written in the form `x^k` for some integer `x`.
+
+---
+
+## Input Format
+
+- The first line contains two integers `n` and `k`.
+- The second line contains `n` integers `a1, a2, ..., an`.
+
+---
+
+## Output Format
+
+- Print a single integer — the number of valid pairs `(i, j)`.
+
+---
+
+## Constraints
+
+- `2 ≤ n ≤ 100000`
+- `2 ≤ k ≤ 100`
+- `1 ≤ ai ≤ 100000`
+
+---
+
+## Sample Input
+
+```
+6 3
+1 3 9 8 24 1
+```
+---
+
+## Output
+
+```
+5
+```
+
+[PROBLEM LINK]( https://codeforces.com/problemset/problem/1225/D)

Problems/Mathematics/Day-01/sol/Ishan Tripathi/Solution.cpp

@@ -0,0 +1,32 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+
+int main()
+{
+    int t;
+    cin>>t;
+    while(t--)
+    {
+        int a, b, c;
+        cin>>a>>b>>c;
+        int half=abs(b-a);
+        int full=2*half;
+        // cout<<full<<endl;
+        if(a>full || b> full || c > full)
+        {
+            cout<<-1<<endl;
+        }
+        else
+        {
+            int ans=c+half;
+            if(ans>full)
+            {
+                ans-=full;
+            }
+            cout<<ans<<endl;
+        }
+        
+    }
+    
+}

Problems/Mathematics/Day-01/sol/VaradSinghal/solution.py

@@ -0,0 +1,21 @@
+def solve():
+    t = int(input())
+    for _ in range(t):
+        a, b, c = map(int, input().split())
+        
+        d = abs(a - b)
+        n = 2 * d
+        
+      
+        if n == 0 or max(a, b, c) > n:
+            print(-1)
+            continue
+        
+        half = n // 2
+    
+        if c + half <= n:
+            print(c + half)
+        else:
+            print(c - half)
+
+solve()

Problems/Mathematics/Day-01/sol/VaradSinghal/solution1.py

@@ -0,0 +1,21 @@
+def solve():
+    t = int(input())
+    for _ in range(t):
+        a, b, c = map(int, input().split())
+        
+        d = abs(a - b)
+        n = 2 * d
+        
+        if n == 0 or max(a, b, c) > n:
+            print(-1)
+            continue
+        
+        half = n // 2
+ 
+        if c + half <= n:
+            print(c + half)
+        else:
+            print(c - half)
+
+# Run
+solve()

contributers.md

@@ -1,4 +1,3 @@
-
 | Name                   | GitHub ID               | College Name                                                     |
 |------------------------|-------------------------|------------------------------------------------------------------|
 | Pradip Maity           | @codeboy-pro            | Haldia Institute Of Technology                                   |
@@ -26,5 +25,7 @@
 | Ishan Tripathi          | ishantripathi64        | IIIT Allahabad                  |
 | Lavay Garg              | lavaygarg              | IIIT Allahabad                  |
 | Himanshu Vitthalani     | Himanshu-1903          | IIIT Allahabad
+| Abhishek Tripathi      | Astinel-prime           | IIIT Allahabd                                                    |
+| Ibrahim Raza Beg       | PHOX-9                  | IIIT Allahabd                                                    |
 <!-- ADD ABOVE THIS -->
 <!-- example | Korvac | Betty | Reyansh College | -->