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,...

t3chn0tr0n

• Jun 26th, 2019

Here is a take in Python. Hope this helps. "python def get_bottles(demand): l = [] bottles = [1, 5, 7, 10] for b in bottles: if demand % b is 0: ...

lavanya

• Jul 19th, 2016

Code
#include<stdio.h>
int main()
{
 int b,n,l;
 scanf("%d",&n);
 while(n>0)
 {
 scanf("%d",&l);
 b=0;
 while(l>0)
 {
 b++;
 if(l>=10)
  l=l-10;
 else if(l>=7)
  l=l-7;
 else if(l>=5)
  l=l-5;
 else
  l=l-1;
 }
 printf("%d
",b);
 n--;
 }
 return 0;
}

Answer Question  Select Best Answer