chocolate_feast.py

#https://www.hackerrank.com/challenges/chocolate-feast/problem?isFullScreen=true
#!/bin/python3

import math
import os
import random
import re
import sys

#
# Complete the 'chocolateFeast' function below.
#
# The function is expected to return an INTEGER.
# The function accepts following parameters:
#  1. INTEGER n
#  2. INTEGER c
#  3. INTEGER m
#


def totalExploit(n, c, m, w):
    canEat = n//c + w//m
    n = n % c
    w = w % m
    if canEat == 0:
        return 0
    else:
        return canEat + totalExploit(n, c, m, w + canEat)


def chocolateFeast(n, c, m):
    # Write your code here
    return totalExploit(n, c, m, 0)


if __name__ == '__main__':
    fptr = open(os.environ['OUTPUT_PATH'], 'w')

    t = int(input().strip())

    for t_itr in range(t):
        first_multiple_input = input().rstrip().split()

        n = int(first_multiple_input[0])

        c = int(first_multiple_input[1])

        m = int(first_multiple_input[2])

        result = chocolateFeast(n, c, m)

        fptr.write(str(result) + '\n')

    fptr.close()