Company: Sigmoid_4nov
Difficulty: medium
Island Life Problem Description You are stuck on an island where they sell and eat coconut sweets only. A person can buy at most 1 box per day with each box containing N pieces. To remain alive, you must consume E coconut sweets daily for D days, but the catch is that you cannot purchase sweets on Sundays. Your task is to find and return an integer value representing the minimum number of times you have to buy coconut sweets in order to stay alive. If not possible, return -1. Note: The day starts from Monday. Input Specification: input1: An integer value N, representing the number of coconut sweets per box. input2: An integer value E, representing the number of coconut sweets you must eat daily. input3: An integer value D, representing the number of days you have to spend on the island. Output Specification: Return an integer value representing the minimum number of times you have to buy coconut sweets in order to stay alive. If not possible, return -1. Examples Example 1: Input: input