【HDOJ】1930 And Now, a Remainder from Our Sponsor

简单字符串。

#include <stdio.h>

#define MAXLEN 160

char buf[MAXLEN];
int keys[4], parts[4];

void getpart(int x) {
    int i;
    for (i=3; i>=0; --i) {
        parts[i] = x%100;
        x /= 100;
    }
}

int main() {
    int case_n, n, max, mm;
    int i, j, k, flag, tmp, len;

    scanf("%d", &case_n);
    while (case_n--) {
        scanf("%d", &n);
        max = 0;
        for (i=0; i<4; ++i) {
            scanf("%d",&keys[i]);
            if (max < keys[i]) {
                max = keys[i];
                mm = i;
            }
        }
        len = 0;
        for (i=0; i<n; ++i) {
            scanf("%d", &tmp);
            getpart(tmp);
            for (j=10000;;++j)
                if (j%max == parts[mm])
                    break;
            while (1) {
                flag = 1;
                for (k=0; k<4; ++k) {
                    if (k == mm) continue;
                    if (j%keys[k] != parts[k]) {
                        flag = 0;
                        break;
                    }
                }
                if (flag) break;
                j += max;
            }
            getpart(j);
            for (k=1; k<4; ++k) {
                if (parts[k] == 27)
                    buf[len++] = ' ';
                else
                    buf[len++] = (char)(parts[k])+'A'-1;
            }
        }
        while (buf[--len] == ' ') ;
        buf[len+1] = '';
        printf("%s
", buf);
    }

    return 0;
}