Insurance Solution Codechef Chef bought car insurance. The policy of the insurance is: The maximum rebatable amount for any damage is Rs X lakhs. If the amount required for repairing the damage is ≤X lakhs, that amount is rebated in full. Chef’s car meets an accident and required Rs Y lakhs for repairing. Determine the amount that will be rebated by the insurance … Read more
Game of Piles Version 1 Solution Codechef There are N piles where the ith pile consists of Ai stones. Chef and Chefina are playing a game taking alternate turns with Chef starting first.In his/her turn, a player can choose any non-empty pile and remove exactly 1 stone from it. The game ends when exactly 1 pile becomes empty. The player who made the last move wins.Determine the winner … Read more
Journey of the Knight Solution Codechef Chef has an 8×8 chessboard. He placed a knight on the square (X1,Y1). Note that, the square at the intersection of the ith row and jth column is denoted by (i,j). Chef wants to determine whether the knight can end up at the square (X2,Y2) in exactly 100 moves or not. For reference, a knight can move to a square which is: One … Read more
Slow Solution Solution Codechef Chef is trying to solve a problem having T test cases, where, for each test case he is given a single integer N. Chef has an algorithm which takes exactly N2 iterations for a test case with value N. The constraints of the problem are as follows: 1≤T≤maxT 1≤N≤maxN Sum of N over all test cases does not exceed sumN. Given … Read more
Chef and Candies Solution Codechef There are N children and Chef wants to give them 1 candy each. Chef already has X candies with him. To buy the rest, he visits a candy shop. In the shop, packets containing exactly 4 candies are available. Determine the minimum number of candy packets Chef must buy so that he is able to give 1 candy to each of the N children. Input … Read more
