We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
2 parents be24881 + a31f63c commit 9984f59Copy full SHA for 9984f59
1 file changed
Problems/Mathematics/Day-02/sol/Naman Pal/day002sol01
@@ -0,0 +1,22 @@
1
+#include <bits/stdc++.h>
2
+using namespace std;
3
+
4
5
+int main() {
6
+ int t;
7
+ cin>>t;
8
+ while(t--) {
9
+ long long n;
10
+ cin>>n;
11
+ int a[n];
12
+ for(long long i=0; i<n; i++) cin>>a[i];
13
+ sort(a, a+n);
14
+ long long minn=0,maxx=0;
15
+ for(long long i=0; i<n;i++) {
16
+ if(a[i]==a[0]) minn++;
17
+ if(a[i]==a[n-1]) maxx++;
18
+ }
19
+ if(a[0]==a[n-1]) cout<<n*(n-1)<<endl;
20
+ else cout<<minn*maxx*2<<endl;
21
22
+}
0 commit comments