[Solved] Kids Love Muffins with Java, C++

Kids Love Muffins: Louis was celebrating his 10th Birthday and his parents have promised to make the best party ever for him. He will be very happy if he can invite all his friends to this party (he has many friends), but unfortunately his parents can’t invite everyone because they have a limited number of muffins, and they want everyone to be happy.

As we all know, kids love to eat a lot of muffins of the same type, let’s say a kid will be happy only if he can eat at least K muffins of the same type.

Given K, and the number of available muffins of each type, calculate the maximum number of kids where Louis’s parents can make all of them happy by giving each one at least K muffins of the same type.

Input Format:
The first line of the input contains two space-separated integers N, the number of different muffins (1 ≤ N ≤ 100), and K, the minimum number of muffins which will make a kid happy as described above (1 ≤ K ≤ 100).
The second line of input contains N integers, separated by a single space, which are the available number of muffins of each type. There will be at least 1 muffin and at most 100 muffins of each type.

Output Format:
Output on a single line one integer, the maximum number of kids Louis’ parents can make happy by giving each one at least K muffins of the same type.
Refer sample input and output for formatting specifications.

Sample Input 1:
3 2
4 5 7

Sample Output 1:
7

Sample Input 2:
3 8
4 5 7

Sample Output 2:
 0

Solution

import java.util.*;
class Main
{
    public static void main(String jr[])
    {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int k= sc.nextInt();
        int a[] = new int[n];
        for(int i=0;i<n;i++)
        { 
            a[i]=sc.nextInt();
            //sauravhathi
        }
        int count = 0;
        
        for(int i=0;i<n;i++)
        {  
            count=count+(a[i]/k);
        }
        
        System.out.println(count);
    }
}

#include<iostream>
#include<vector>
using namespace std;

int main()
{
    int n, k;
    cin>>n>>k;
    vector<int> a(n);
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
    }
    int count = 0;
    for(int i=0;i<n;i++)
    {
        count = count + (a[i]/k);
    }
    cout<<count;
    return 0;
}

Happy Learning – If you require any further information, feel free to contact me.