Packaging Cupcakes Codechef Solution

Hello Programmers In this post, you will know how to solve the Packaging Cupcakes Codechef Solution.

report this ad

One more thing to add, don’t directly look for the solutions, first try to solve the problems of Codechef by yourself. If you find any difficulty after trying several times, then you can look for solutions.

Problem

Now that Chef has finished baking and frosting his cupcakes, it’s time to package them. Chef has N cupcakes, and needs to decide how many cupcakes to place in each package. Each package must contain the same number of cupcakes. Chef will choose an integer A between 1 and N, inclusive, and place exactly A cupcakes into each package. Chef makes as many packages as possible. Chef then gets to eat the remaining cupcakes. Chef enjoys eating cupcakes very much. Help Chef choose the package size A that will let him eat as many cupcakes as possible.

Input 

Input begins with an integer T, the number of test cases. Each test case consists of a single integer N, the number of cupcakes.

Output 

For each test case, output the package size that will maximize the number of leftover cupcakes. If multiple package sizes will result in the same number of leftover cupcakes, print the largest such size.

Constraints

• 1 <= T <= 1000
• 2 <= N <= 100000000

Sample Input 

2
2
5

Sample Output 

2
3

Packaging Cupcakes CodeChef Solutions in Python

T = int(input())
for i in range(T):
    n = int(input())
    print((n // 2) + 1)

Packaging Cupcakes CodeChef Solutions in CPP

#include <iostream>
using namespace std;
int main(){
	int a;
	cin >> a;
	while(a--){
		long long a,b,c;
		cin >> a >> b >> c;
		if(a>=b && b>=c || a<=b && b<=c)
			cout << b << endl;
		else if(a>=c && c>=b || a<=c && b>=c)
			cout << c << endl;
		else
			cout << a << endl;
	}
}

Packaging Cupcakes CodeChef Solutions in JAVA

import java.util.Scanner;
public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int tc = 0; tc < T; tc++) {
			int N = sc.nextInt();
			System.out.println(solve(N));
		}
		sc.close();
	}
	static int solve(int N) {
		return N / 2 + 1;
	}
}

report this ad

Disclaimer: The above Problem (Packaging Cupcakes) is generated by CodeChef but the solution is provided by BrokenProgrammers. This tutorial is only for Educational and Learning purpose.

Note:- I compile all programs, if there is any case program is not working and showing an error please let me know in the comment section. If you are using adblocker, please disable adblocker because some functions of the site may not work correctly.

Next: Second Largest Codechef Solution