HOJ 2411 Quick Change

http://acm.hit.edu.cn/hoj/problem/view?id=2411

换钱 保证总硬币数最小

#include <stdio.h>int main(){    int n,c,nQUARTER,nDIME,nNICKEL;    int i;    scanf("%d", &n);    for (i = 1; i <= n; i++)    {        nQUARTER = 0, nDIME = 0, nNICKEL = 0;        scanf("%d", &c);        nQUARTER = c / 25;        c = c % 25;        nDIME = c / 10;        c = c % 10;        nNICKEL = c / 5;        c = c % 5;        printf("%d %d QUARTER(S), %d DIME(S), %d NICKEL(S), %d PENNY(S)\n", i, nQUARTER, nDIME, nNICKEL, c);    }    return 0;}