UVa 735 - Dart-a-Mania

题目

飞镖游戏，有三个飞镖，靶子上面分成1-20的分数，每个区域的分数可能是对应分数的1,2,3倍。中心50分，不在靶子上0分。问对应x分数有多少种分数组合与排列。

分析

枚举。这里没有要求最后为倍数，直接把0-20的1-3倍去重打成表，然后枚举即可。

说明

雅思已经4个6了┭┮﹏┭┮。。。

#include <stdio.h>
#include <stdlib.h>

int base[66] = {0};
int used[66] = {0};
int list[61][61][61]; 
int p[1001] = {0};
int c[1001] = {0};

int main()
{
    int base_count = 0;
    for (int i = 0; i < 21; ++ i) {
        for (int j = 1; j <= 3; ++ j) {
            if (!used[i*j]) {
                base[base_count ++] = i*j;
                used[i*j] = 1;
            }
        }
    }
    base[base_count ++] = 50;

    for (int i = 0; i < base_count; ++ i) { 
        for (int j = 0; j < base_count; ++ j) {
            for (int k = 0; k < base_count; ++ k) {
                list[base[i]][base[j]][base[k]] = base[i] + base[j] + base[k];  
                p[base[i] + base[j] + base[k]] ++;
                if (base[i] <= base[j] && base[j] <= base[k]) {
                    c[base[i] + base[j] + base[k]] ++;
                }
            }
        }
    }  

    int x;
    while (~scanf("%d", &x) && x > 0) { 
        if (c[x]) {
            printf("NUMBER OF COMBINATIONS THAT SCORES %d IS %d.\n", x, c[x]);
            printf("NUMBER OF PERMUTATIONS THAT SCORES %d IS %d.\n", x, p[x]);
        } else {
            printf("THE SCORE OF %d CANNOT BE MADE WITH THREE DARTS.\n", x);
        }
        puts("**********************************************************************");
    }
    puts("END OF OUTPUT"); 
    return 0;
}