Merge pull request #345 from InsanelySlowBurn/main

Day 2 Q1

Author: Dheeraj-06

Problems/Mathematics/Day-01/sol/Aditi_Deshmukh/Solution1.cpp

@@ -0,0 +1,37 @@
+//We need to find what numbered person is oppisite to the person numbered 'c'
+//On the basis of 'a' and 'b' being opposites
+//Time and space complexity are both O(1)
+
+
+#include <bits/stdc++.h>
+using namespace std;
+
+int main() {
+	int t;
+	cin>>t;
+	while(t--){
+	    int a,b,c;
+	    cin>>a>>b>>c;
+	    //eg: 1,4,5
+
+	    int n=abs(a-b)*2;
+	    //n=6
+
+	    if(c>n){
+	        //5>6 is false
+		//c>n then c would be out of the possible numbers
+		cout<<"-1"<<endl;
+	        continue;
+	    }
+	   
+	    if(c>(n/2)){
+		//5>3 implies the number opposite to it is in the lower half
+	        cout<<c-(n/2)<<endl;
+	    }
+	    else{
+	        cout<<c+(n/2)<<endl;
+	    }
+
+}
+
+

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

@@ -0,0 +1,48 @@
+//We have to find how many pairs have the maximum absolute difference 
+//only the highest and the lowest number in the array will have max difference
+//so we need to find how many times the highest and lwest element appears and calc their permutations
+//time and space complexity is O(n)
+#include <bits/stdc++.h>
+using namespace std;
+
+int main() {
+	int t;
+	cin>>t;
+	while(t--){
+		long long int n;
+	    	cin>>n;
+	    	int a[n];
+	    	for(int i=0;i<n;i++){
+			cin>>a[i];
+	    	}
+	    	long long int j=1,k=1,min=a[0],max=a[0];
+	    	//j is no of min elements
+	    	//k is no of max elements
+
+	    	for(int i=1;i<n;i++){
+	        	if(min<a[i]){
+	            		j=1;
+	            		min=a[i];
+	        	}
+	        	else if(min==a[i]){
+	        		j++;
+	        	}
+	        
+	        if(max>a[i]){
+	            	k=1;
+	            	max=a[i];
+	        }
+	        else if(max==a[i]){
+	            	k++;
+	        }
+	    }
+	    
+		if(min==max)
+			//if all elements are same, permutation formula becomes n*(n-1)
+		    	cout<<n*(n-1)<<endl;
+		else
+	    		cout<<j*k*2<<endl;
+	}
+
+}
+//https://codeforces.com/problemset/submission/1771/355657715