/* The largest number of vaccines Input : 1st line: N denoting the amount of money 2nd line: Nine space-seperated integers x1,x2.....xn, denoting the cost of each vaccine Output: Print the largest number of stocks that can be formed by using the N units of money. If not possible then print -1 . Sample Input1 - 5 9 4 2 2 6 3 2 2 1 Output1 - 99999 (as 1+1+1+1+1 is 5 bcoz the number formed by getting the max index of 1 i:e 9) . Input2 - 32 7 8 9 8 7 9 8 8 10 Output2 - 9855 (as 10+8+7+7 is 32 bcoz the number formed by getting the max indexes of 10,8 & 7 is 9855) . Also don't use any imports */ #include #include #include using namespace std; vector findindices(vector& input, int reqSum) { vector indices; int cnt = input.size(); //indices.reserve(cnt); int sum = 0; for(int i=cnt-1;i>=0;--i) { int val =input[i]; while(true) { if ((sum+val)==reqSum) { return indices; } else if ((sum+val)reqSum) { cout << "i is " << i << endl; break; } } } indices.clear(); indices.push_back(-1); return indices; } int main() { //vector input = {7,8,9,8,7,9,8,8,10}; //int reqSum = 32; vector input = {9,4,2,2,6,3,2,2}; int reqSum = 9; vector indices = findindices(input,reqSum ) ; for(const auto& i : indices) cout << i; return 0; }

challenge_vaccines