Merge branch 'opencodeiiita:main' into main

Author: Aiyaan-Mahajan

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;
+}