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

In first test case, demand of milk is 17 litres which can be supplied using minimum of 2 bottles as follows
1 x 10 litres and
1 x 7 litres
In second test case, demand of milk is 65 litres which can be supplied using minimum of 7 bottles as follows
6 x 10 litres and
1 x 5 litres

• import java.util.*;
  class MB{
  public static void main(String arg[]){
  int mod1,mod2,mod3,mod4,count1=0,count2=0,count3=0,count4=0,count5=0;
  System.out.println("Milk in litres");
  Scanner scan=new Scanner(System.in);
  int litres=scan.nextInt();
  do
  {
  mod1 =litres%10;
  litres=litres-mod1;
  litres=litres/10;
  count1=count1+litres;
  }while(litres>=10);
  do
  {
  mod2 =mod1%7;
  mod1=mod1-mod2;
  mod1=mod1/7;
  count2=count2+mod1;
  }while(mod1>=7);
  do
  {
  mod3 =mod2%5;
  mod2=mod2-mod3;
  mod2=mod2/5;
  count3=count3+mod2;
  }while(mod2>=5);
  for(int i=0;i
• 8 years agoHelpfull: Yes(3) No(1)
• #include
  int process(int num)
  {
  int k1=0,k2=0,num2=num;
  while(num>0)
  {
  if(num%10==0)
  {
  k1=k1+num/10;
  num=num%10;
  }
  else if(num%7==0)
  {
  k1=k1+num/7;
  num=num%7;
  }
  else if(num%5==0)
  {
  k1=k1+num/5;
  num=num%5;
  }
  else
  {
  k1=k1+num;
  num=0;
  }
  
  }
  while(num2>0)
  {
  if(num2>=10)
  num2=num2-10;
  else if(num2>=7)
  num2=num2-7;
  else if(num2>=5)
  num2=num2-5;
  else
  num2=num2-1;
  k2++;
  }
  if(k1>k2)
  return k2;
  else
  return k1;
  }
  void main()
  {
  int a[1000];
  int n,i,num;
  //printf("Enter Number of test cases:--");
  scanf("%d",&n);
  for(i=0;i
• 8 years agoHelpfull: Yes(2) No(0)
• 
  #include
  using namespace std;
  
  int main()
  {
  
  int arr[]={1,5,7,10};
  
  int N;
  cin>>N;
  while(N--)
  {
  
  long long L;
  cin>>L;
  
  long long ans=0,x;
  ans=L/10;
  if(ans)
  L=L%10;
  
  x=L/7;
  if(x)
  {
  L=L%7;
  ans+=x;
  }
  
  x=L/5;
  if(x)
  {
  L=L%5;
  ans+=x;
  }
  
  x=L;
  if(x)
  {
  
  
  ans+=x;
  }
  cout
• 7 years agoHelpfull: Yes(2) No(0)
• import java.util.*;
  class MB{
  public static void main(String arg[]){
  int mod1,mod2,mod3,mod4,count1=0,count2=0,count3=0,count4=0,count5=0;
  System.out.println("Milk in litres");
  Scanner scan=new Scanner(System.in);
  int litres=scan.nextInt();
  do
  {
  mod1 =litres%10;
  litres=litres-mod1;
  litres=litres/10;
  count1=count1+litres;
  }while(litres>=10);
  do
  {
  mod2 =mod1%7;
  mod1=mod1-mod2;
  mod1=mod1/7;
  count2=count2+mod1;
  }while(mod1>=7);
  do
  {
  mod3 =mod2%5;
  mod2=mod2-mod3;
  mod2=mod2/5;
  count3=count3+mod2;
  }while(mod2>=5);
  for(int i=0;i
• 8 years agoHelpfull: Yes(1) No(3)
• #include
  int process(int num)
  {
  int k1=0,k2=0,num2=num;
  while(num>0)
  {
  if(num%10==0)
  {
  k1=k1+num/10;
  num=num%10;
  }
  else if(num%7==0)
  {
  k1=k1+num/7;
  num=num%7;
  }
  else if(num%5==0)
  {
  k1=k1+num/5;
  num=num%5;
  }
  else
  {
  k1=k1+num;
  num=0;
  }
  
  }
  while(num2>0)
  {
  if(num2>=10)
  num2=num2-10;
  else if(num2>=7)
  num2=num2-7;
  else if(num2>=5)
  num2=num2-5;
  else
  num2=num2-1;
  k2++;
  }
  if(k1>k2)
  return k2;
  else
  return k1;
  }
  void main()
  {
  int a[1000];
  int n,i,num;
  //printf("Enter Number of test cases:--");
  scanf("%d",&n);
  for(i=0;i
• 8 years agoHelpfull: Yes(0) No(0)
• #include
  
  int main(void) {
  int i,j,N;
  int Li[1000];
  int count;
  scanf("%d",&N);
  if(N>0 && N=10)
  {
  count++;
  Li[j]-=10;
  goto here;
  }
  here1: if(Li[j]>=7)
  {
  count++;
  Li[j]-=7;
  goto here1;
  }
  here2: if(Li[j]>=5)
  {
  count++;
  Li[j]-=5;
  goto here2;
  }
  here3: if(Li[j]>=1)
  {
  count++;
  Li[j]-=1;
  goto here3;
  }
  printf("%d |n",count);
  
  }
  }
  
  return 0;
  }
  }
• 8 years agoHelpfull: Yes(0) No(1)
• import java.io.*;
  
  
  public class Main {
  public static void main(String args[]) throws IOException{
  BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  int N;
  N=Integer.parseInt(br.readLine());
  int L[]=new int[N];
  for(int i=0;i0){
  L[i]=L[i]%10;
  x=L[i]/7;
  }
  if(x>0){
  L[i]=L[i]%7;
  sum=sum+x;
  }
  x=L[i]/5;
  if(x>0){
  L[i]=L[i]%5;
  sum=sum+x;
  }
  x=L[i];
  if(x>0){
  sum=sum+x;
  }
  }
  System.out.println(sum);
  }
  
  }
  }
  
• 7 years agoHelpfull: Yes(0) No(0)
• #include
  #include
  using namespace std;
  int main()
  {
  int n,a[100],i,j,m,x,sum=0;
  cin>>n>>m;
  for(i=0;i>a[i];
  }
  for(i=0;i
• 7 years agoHelpfull: Yes(0) No(0)
• #include
  using namespace std;
  int main()
  {
  int bottle,test,i,j;
  int b[4]={1,5,7,10};
  int sum=0;
  int n[1000];
  couttest;
  for(i=0;i>n[i];
  }
  for(i=0;i=0)
  {
  while(sum>=b[j])
  {
  sum=sum-b[j];
  bottle++;
  }
  j--;
  }
  cout
• 5 years agoHelpfull: Yes(0) No(0)