Milk Man and His Bottles

A Milkman serves milk in packaged bottles of varied sizes. The possible size of the bottles are {1, 5, 7 and 10} litres. He wants to supply desired quantity using as less bottles as possible irrespective of the size. Your objective is to help him find the minimum number of bottles required to supply the given demand of milk.
Input Format:
First line contains number of test cases N
Next N lines, each contain a positive integer Li which corresponds to the demand of milk.
Output Format:
For each input Li, print the minimum number of bottles required to fulfill the demand
Constraints:
1 <= N <= 1000
Li > 0
1 <= i <= N
Sample Input and Output
SNo. Input Output
1
2
17
65
2
7
Explanation:
Number of test cases is 2
1. In first test case, demand of milk is 17 litres which can be supplied using minimum of 2 bottles as follows
o 1 x 10 litres and
o 1 x 7 litres
2. In second test case, demand of milk is 65 litres which can be supplied using minimum of 7 bottles as follows
o 6 x 10 litres and
o 1 x 5 litres

Interview Candidate
Aug 7th, 2015
7
25690

Aptitude

Answer

Showing Answers 1 - 7 of 7 Answers

john

Aug 7th, 2015

Code
span style="color: #ff0000;">"Enter the number of puk


");


   scanf("%d""First %d terms of fate sanka are :-


""%d


"

john

Aug 7th, 2015

Code
#include <stdio.h>


#include <stdlib.h>


 


#define ARRAYSIZE(a) (sizeof(a))/(sizeof(a[0]))


// prints subset found"%*d""


");


}


 


// inputs


// s            - set vector


// t            - tuplet vector


// s_size       - set size


// t_size       - tuplet size so far


// sum          - sum so far


// ite          - nodes count


// target_sum   - sum to be found// We found subset// Exclude previously added item and consider next candidate// generate nodes along the breadth// consider next level node (along depth)


            subset_sum(s, t, s_size, t_size + 1, sum + s[i], i + 1, target_sum);


        }


    }


}


 


// Wrapper to print subsets that sum to target_sum


// input is weights vector and target_sum"Nodes generated %d


"#include <stdio.h>


#include <stdlib.h>


 


#define ARRAYSIZE(a) (sizeof(a))/(sizeof(a[0]))


// prints subset found"%*d""


suls");


}


 


// qsort compare function// inputs


// s            - set vector


// t            - tuplet vector


// s_size       - set size


// t_size       - tuplet size so far


// sum          - sum so far


// ite          - nodes count


// target_sum   - sum to be found// We found sum// constraint check// Exclude previous added item and consider next candidate// constraint check// generate nodes along the breadth// consider next level node (along depth)


                    subset_sum(s, t, s_size, t_size + 1, sum + s[i], i + 1, target_sum);


                }


            }


        }


    }


}


 


// Wrapper that prints subsets that sum to target_sum// sort the set//mlikman will save you from code vita"pukss generated %d


"

SathishKumaar
Profile Answers by SathishKumaar

Aug 7th, 2015

Code
#include <stdio.h>


"%d""%d""%d""%d",b+0);


        }


    }


    // your code goes here

Ritobrata Choudhury

Aug 7th, 2015

Code
#include<stdio.h>


//printf("Enter Number of test cases:--");


    scanf("%d"//printf("Enter a number >0:--");


        scanf("%d""%d


",a[i]);


    }


 


}