✅ Need help with recursive solution on vjudge Homer Simpson UVA - 10465 problem with C

#include <stdio.h>

int recursion(int m, int n, int t, int *hamburger, int *beer) {
    if(t <= 0 || (t < n && t < m)) {
        *beer = t;
        return *hamburger;
    } else {
        int best_time_burger = m;
        int worst_time_burger = n;
        if (n < m) {
            best_time_burger = n;
            worst_time_burger = m;
        }
        int burger_time = worst_time_burger;


        if (t % best_time_burger == 0) {
            *hamburger += t / best_time_burger;
            t = burger_time;
        } else if(t-worst_time_burger < worst_time_burger && t-worst_time_burger != 0) {
            burger_time = best_time_burger;
            *hamburger+=1;
        } else {
            *hamburger+=1;
        }

        return recursion(m, n, t-burger_time, hamburger, beer);
    }
}

int main(void) {
    int m, n, t;
    while (scanf("%d %d %d", &m, &n, &t) == 3) {
        int hamburger = 0;
        int beer = 0;
        printf("%d ", recursion(m, n, t, &hamburger, &beer));
        if(beer > 0) {
        printf("%d", beer);
        }
        printf("\n");
    }

    return 0;
}