Answer to Question #54004 in C++ for santhosh

Question

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.

Answer 1

Solve

#include <stdio.h>
#include <fstream>

int main()
{
std::ifstream f("input.txt");
std::ofstream f_res("output.txt");
if(!f.is_open())
return -1;
else
{
int N,L;
f>>N;
for(int i=0;i<N;i++)
{
f>>L;
int numberBottles=L/10;
L=L%10;
numberBottles+=L/7;
L=L%7;
numberBottles+=L/5;
L=L%5;
numberBottles+=L;
f_res<<numberBottles<<std::endl;
}
f.close();
f_res.close();
}
return 0;
}