Merge branch 'opencodeiiita:main' into main

Author: harjasbb07-eng

Problems/Mathematics/Day-02/BEESA_MANISH/Solution1.cpp

@@ -0,0 +1,42 @@
+
+/*
+TC -O(N)
+SC-O(N)
+*/
+
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+void solve() {
+    int n;
+    cin >> n;
+    vector<int> a(n);
+    int min_val = 1e9, max_val = -1e9;
+    for (int i = 0; i < n; i++) {
+        cin >> a[i];
+        if (a[i] < min_val) min_val = a[i];
+        if (a[i] > max_val) max_val = a[i];
+    }
+    if (min_val == max_val) {
+        cout << 1LL * n * (n - 1) << endl;
+        return;
+    }
+    long long count_min = 0;
+    long long count_max = 0;
+    for (int i = 0; i < n; i++) {
+        if (a[i] == min_val) count_min++;
+        if (a[i] == max_val) count_max++;
+    }
+    cout << 2 * count_min * count_max << endl;
+}
+int main() {
+    int t;
+    cin >> t;
+    while (t--) {
+        solve();
+    }
+    return 0;
+}

Problems/Mathematics/Day-02/BEESA_MANISH/Solution2.cpp

@@ -0,0 +1,59 @@
+/*
+TC - O(N^2)
+SC - O(N^2)
+*/
+
+
+#include <iostream>
+#include <vector>
+#include <algorithm>
+#include <map>
+ 
+using namespace std;
+long long C[1005][1005];
+const int MOD = 1e9 + 7;
+void precompute() {
+    for (int i = 0; i <= 1000; i++) {
+        C[i][0] = 1;
+        for (int j = 1; j <= i; j++) {
+            C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % MOD;
+        }
+    }
+}
+ 
+void solve() {
+    int n, k;
+    cin >> n >> k;
+    vector<int> a(n);
+    map<int, int> total_freq;
+    
+    for (int i = 0; i < n; i++) {
+        cin >> a[i];
+        total_freq[a[i]]++;
+    }
+ 
+    sort(a.rbegin(), a.rend());
+ 
+    int v = a[k - 1]; 
+    int needed_count = 0;
+ 
+    for (int i = 0; i < k; i++) {
+        if (a[i] == v) needed_count++;
+    }
+ 
+    int total_count = total_freq[v];
+ 
+    cout << C[total_count][needed_count] << "\n";
+}
+ 
+int main() {
+ 
+    precompute();
+ 
+    int t;
+    cin >> t;
+    while (t--) {
+        solve();
+    }
+    return 0;
+}

Problems/Mathematics/Day-02/sol/AmanMehta22/solution001.cpp

@@ -0,0 +1,54 @@
+//#include <bits/stdc++.h>
+#include <iostream>
+#include <vector>
+#include <string>
+#include <algorithm>
+#include <map>
+#include <set>
+#include <unordered_map>
+#include <queue>
+#include <stack>
+#include <cmath>
+#include <climits>
+#define int long long
+#define fo(n) for (int i = 0; i < n; i++)
+#define fo1(ii, n) for(int i=ii; i<n; i++)
+#define all(x) x.begin(), x.end()
+#define rall(x) x.rbegin(), x.rend()
+#define pb push_back
+#define fi first
+#define se second
+#define vec(a) vector<int> a
+#define vecn(a,n) vector<int> a(n)
+#define py cout<<"YES"<<endl
+#define pn cout<<"NO"<<endl
+const int MOD = 1e9 + 7;
+const int INF = 1e18;
+using namespace std;
+
+void solve(){
+    int n;
+    cin>>n;
+    vector<int>a(n);
+    fo(n)cin>>a[i];
+    int count=0;
+    int highest=*max_element(a.begin(),a.end());
+    int lowest=*min_element(a.begin(),a.end());
+    int difference=highest-lowest;
+    for(int i=0;i<n;i++){
+        for(int j=i+1;j<n;j++){
+            if(abs(a[i]-a[j])==difference)count++;
+        }
+    }
+    cout<<count*2<<endl;
+}
+
+signed main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(0);
+    int t;
+    cin >> t;
+    while(t--)
+        solve();
+    return 0;
+}

Problems/Mathematics/Day-02/sol/Ayush Mishra/Solution1.cpp

@@ -0,0 +1,44 @@
+// Submission Link
+// https://codeforces.com/contest/1771/submission/355396669
+// Time complexity = O(n) + O(nlogn)
+// Space Comlexity = O(n)
+
+
+
+
+
+#include<bits/stdc++.h>
+using namespace std;
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+        long long int n;
+        cin>>n;
+        vector<long long int>v(n);
+        for(int i=0; i<n; i++){
+            cin>>v[i];
+        }
+        sort(v.begin(),v.end());
+        long long int mini =0;
+        long long int maxi= 0;
+        int i=0;
+        int j = n-1;
+        if(v[0]!=v[n-1]){
+        while(v[i]==v[0] && i<n){
+            mini++;
+            i++;
+        }
+        while(v[j]==v[n-1] && j>=0){
+            maxi++;
+            j--;
+        }
+        cout<<2*maxi*mini<<"\n";
+    }
+    else{
+        cout<<(n*(n-1))<<"\n";
+    }
+
+    }
+    return 0;
+}

Problems/Mathematics/Day-02/sol/Mukut/Solution1.cpp

@@ -0,0 +1,52 @@
+/*
+Problem: counting pairs where absolute difference equals max possible difference in array
+
+My approach:
+basically max diff is always gonna be max_element - min_element
+so we just need pairs where one is max and other is min
+first find both values then count how many times each appears
+if everything is same number then answer is just n*(n-1) (all pairs work)
+otherwise its 2*count_max*count_min (since both (i,j) and (j,i) count as different)
+
+TimeComplexity: O(n) 
+SpaceC: O(n)
+
+CodeForces submission: https://codeforces.com/contest/1771/submission/355388765
+*/
+
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int t;
+    cin >> t;
+    
+    while(t--){
+        int n;
+        cin >> n;
+        vector<int> arr(n);
+        
+        for(int i=0; i<n; i++){
+            cin >> arr[i];
+        }
+        int maxi = arr[0], mini = arr[0];
+        for(int i=1; i<n; i++){
+            if(arr[i] > maxi) maxi = arr[i];
+            if(arr[i] < mini) mini = arr[i];
+        }
+        if(maxi == mini){
+            long long result = (long long)n * (n-1);
+            cout << result << endl;
+            continue;
+        }
+        long long max_count = 0, min_count = 0;
+        for(int i=0; i<n; i++){
+            if(arr[i] == maxi) max_count++;
+            if(arr[i] == mini) min_count++;
+        }
+        long long answer = 2 * max_count * min_count;
+        cout << answer << endl;
+    }
+    
+    return 0;
+}

contributers.md

@@ -58,9 +58,13 @@
 | Apoorv Mittal          | Apoorv012                |  JIIT Noida                                                  |                                               
 |Aman Kumar Mehta       |AmanMehta22                |Amity University Jharkhand                                         |                                                                                             |     
 | Naman Pal              | Naman2251                | IIIT Allahabad
+| Mohammed Tailor       | tailormst                 | Shri Ramdeobaba College of Engineering & Management, Nagpur       |
+|Yuvaraj Ragothaman       | LevelSilence            |IIIT Allahabad|
+| Sudhanshu              | sahsudhanshu            | IIIT Allahabad                                                   |
 | Harjas             |harjasbb07-eng           | IIIT Allahabad
 | Ashutosh Kesarwani     | Lucifer-0612             | HIT Haldia
 | Samarth Patel          | capricemoto              | IIIT Allahbad                                                     |
 | Divakar Bhatt          | wodivakar                | IIIT Allahabad                                                  |
-<!-- ADD ABOVE THIS -->
+| Aiyaan Mahajan        | Aiyaan-Mahajan | NIT Srinagar |
+
 <!-- example | Korvac | Betty | Reyansh College | -->