Merge pull request #279 from arnavsingh010/Arnav

solved Day-02 Q1

Author: Dheeraj-06

Problems/Mathematics/Day-02/sol/Arnav_Singh/.cph/.Solution1.cpp_8a03896c340660fc53d23e6afdd07dd2.prob

@@ -0,0 +1 @@
+{"name":"Local: Solution1","url":"\\\\wsl.localhost\\Ubuntu\\home\\arnav\\cp\\CP-Chronicles\\Problems\\Mathematics\\Day-02\\sol\\Arnav_Singh\\Solution1.cpp","tests":[{"id":1766899575930,"input":"2\n5\n6 2 3 8 1","output":""}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"\\\\wsl.localhost\\Ubuntu\\home\\arnav\\cp\\CP-Chronicles\\Problems\\Mathematics\\Day-02\\sol\\Arnav_Singh\\Solution1.cpp","group":"local","local":true}

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

@@ -0,0 +1,44 @@
+#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];
+        }
+        sort(a,a+n);
+        long long cnt_s=0;
+        for (int i = 0; i < n; ++i) {
+            if(a[i]==a[0]){
+                cnt_s++;
+            }
+            else{
+                break;
+            }
+        }
+        long long cnt_l=0;
+        for (int i = n-1; i >=0 ; --i) {
+            if(a[i]==a[n-1]){
+                cnt_l++;
+            }
+            else{
+                break;
+            }
+        }
+        if(cnt_s==n){
+            cout << 1LL*(n)*(n-1) <<'\n';
+        }
+        else{
+            cout <<2LL*(cnt_s)*(cnt_l)<<'\n';
+        }
+    }
+    
+    return 0;
+}
+//time complexity O(nlogn)
+//https://codeforces.com/problemset/submission/1771/355443489