【HDOJ】1058 Humble Numbers

简单题，注意打表，以及输出格式。这里使用了可变参数。

#include <stdio.h>

#define MAXNUM 5845
#define ANS    2000000000

int buf[MAXNUM];
int min(int a, int b) {
    return a<b ? a:b;
}

int minn(int argc, ...) {
    int i, tmp;
    int *arg = &argc + 1;

    tmp = *arg;
    for (i=1; i<argc; ++i)
        tmp = min(tmp, *++arg);

    return tmp;
}

int main() {
    int i;
    int a, b, c, d;
    int ia, ib, ic, id;
    ia = ib = ic = id = 1;

    i = 1;
    buf[1] = 1;

    a = 2 * buf[ia];
    b = 3 * buf[ib];
    c = 5 * buf[ic];
    d = 7 * buf[id];
    while (buf[i] < ANS) {
        buf[++i] = minn(4, a,b,c,d);
        if (buf[i] == a)  a = 2*buf[++ia];
        if (buf[i] == b)  b = 3*buf[++ib];
        if (buf[i] == c)  c = 5*buf[++ic];
        if (buf[i] == d)  d = 7*buf[++id];
    }

    while (scanf("%d", &i)!=EOF && i) {
        if (i%10==1 && i%100!=11)
            printf("The %dst humble number is %d.
", i, buf[i]);
        else if (i%10==2 && i%100!=12)
            printf("The %dnd humble number is %d.
", i, buf[i]);
        else if (i%10==3 && i%100!=13)
            printf("The %drd humble number is %d.
", i, buf[i]);
        else
            printf("The %dth humble number is %d.
", i, buf[i]);
    }

    return 0;
}