Merge pull request ashutosh97#136 from Adityajain732/master

Mislove Has Lost an Array

Author: ashutosh97

Mislove Has Lost an Array/Question.txt

@@ -0,0 +1,17 @@
+Mislove had an array a1, a2, ⋯, an of n positive integers, but he has lost it. He only remembers the following facts about it:
+
+1)The number of different numbers in the array is not less than l and is not greater than r.
+2)For each array's element ai either ai=1 or ai is even and there is a number ai/2 in the array.
+
+For example, if n=5, l=2, r=3 then an array could be [1,2,2,4,4] or [1,1,1,1,2]; but it couldn't be [1,2,2,4,8] because this array contains 4 different numbers; it couldn't be [1,2,2,3,3] because 3 is odd and isn't equal to 1; and it couldn't be [1,1,2,2,16] because there is a number 16 in the array but there isn't a number 16/2=8.
+
+According to these facts, he is asking you to count the minimal and the maximal possible sums of all elements in an array. 
+
+Input-1
+4 2 2
+Output
+5 7
+Input-2
+5 1 5
+Output
+5 31

Mislove Has Lost an Array/Solution.cpp

@@ -0,0 +1,26 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main()
+{
+    long long int i,mini=1,mine=0,maxi=1,maxo=0,n,s,e;
+    cin>>n>>s>>e;
+    
+    for(i=1;i<=s-1;i++)
+    {
+        mini=2*mini;
+        mine+=mini;
+    }
+mine+=n-s+1;
+ 
+for(i=1;i<=e-1;i++)
+{
+    maxi=2*maxi;
+    maxo+=maxi;
+}
+maxo+=1;
+
+ 
+maxo+=(n-e)*(maxi);
+cout<<mine<<" "<<maxo;
+    return 0;
+}