This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
void solve(){
    int a,b,c;
    scanf("%d %d %d",&a,&b,&c);
    int piv = 0, ret = 0;
    for (int i=0; i<a; i++) {
        ret += (piv + b + c - 1) / c;
        piv += b % c;
        piv %= c;
    }
    printf("%d\n",ret);
}
int main(){
    int t;
    scanf("%d",&t);
    for (int i=1; i<=t; i++) {
        printf("Case #%d: ",i);
        solve();
    }
}
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |