Merge pull request #316 from avaneeshk2307-wq/patch-5

Create soln001.cpp

Author: Dheeraj-06

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