HACKERRANK chocolate-feast Solution

| August 02, 2016

The correct, optimal and working solution for programming question chocolate-feast on hackerrank

/*
 *  Author: Arpit Bhayani
 *  http://arpitbhayani.me
 */
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <deque>
#include <iostream>
#include <list>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>

#define ll long long

#define MIN(a, b) a < b ? a : b
#define MAX(a, b) a > b ? a : b

using namespace std;

int readline(char *str) {
    int i = 0;
    char ch;
    while((ch = getchar()) != '\n') {
        str[i++] = ch;
    }
    str[i] = '\0';
    return i;
}

int main(int argc, char *argv[]) {
    int t;
    scanf("%d", &t);

    while(t--) {
        int n, c, m, wraps;
        cin >> n >> c >> m;

        int chocs = n/c;
        wraps = chocs;
        while(wraps >= m) {
            chocs += wraps/m;
            wraps = wraps/m + wraps%m;
        }
        cout << chocs << endl;
    }

    return 0;
}