Chairs Requirement Solution Codechef

June Long Challenge 2022 Solution

Chairs Requirement Solution Codechef Chef’s coding class is very famous in Chefland. This year X students joined his class and each student will require one chair to sit on. Chef already has Y chairs in his class. Determine the minimum number of new chairs Chef must buy so that every student is able to get one chair to sit … Read more

Subscriptions Solution Codechef

June Long Challenge 2022 Solution

Subscriptions Solution Codechef A new TV streaming service was recently started in Chefland called the Chef-TV. A group of N friends in Chefland want to buy Chef-TV subscriptions. We know that 6 people can share one Chef-TV subscription. Also, the cost of one Chef-TV subscription is X rupees. Determine the minimum total cost that the group of N friends will incur so that … Read more

Alternate Additions Solution Codechef

June Long Challenge 2022 Solution

Alternate Additions Solution Codechef Chef has 2 numbers A and B (A<B). Chef will perform some operations on A. In the ith operation: Chef can stop at any instant. Can Chef make A equal to B? Input Format Output Format Constraints Sample 1: Input 4 1 2 3 6 4 9 10 20 Output YES YES NO YES Explanation: SOLUTION Program: Alternate Additions Solution in Python Program: … Read more

Equal Strings Solution Codechef

June Long Challenge 2022 Solution

Equal Strings Solution Codechef Given a string A of length N consisting of lowercase English alphabet letters. You are allowed to perform the following operation on the string A any number of times: Find the minimum number of operations required to convert A into a given string B of length N consisting of lowercase English alphabet letters. Input Format Output Format For each test case, output the minimum number … Read more

Divisible by i Solution Codechef

June Long Challenge 2022 Solution

Divisible by i Solution Codechef You are given an integer N. Construct a permutation P of length N such that For all i (1≤i≤N-1), i divides abs(Pi+1​−Pi​). Recall that a permutation of length N is an array where every integer from 1 to N occurs exactly once. It can be proven that for the given constraints at least one such P always exists. Input Format Output Format Constraints Sample 1: Input 2 … Read more