HDU1570 A C【水题】

A C

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 6133 Accepted Submission(s): 4018

Problem Description
Are you excited when you see the title “AC” ? If the answer is YES , AC it ;

You must learn these two combination formulas in the school . If you have forgotten it , see the picture.

Now I will give you n and m , and your task is to calculate the answer .

Input
In the first line , there is a integer T indicates the number of test cases.
Then T cases follows in the T lines.
Each case contains a character ‘A’ or ‘C’, two integers represent n and m. (1<=n,m<=10)

Output
For each case , if the character is ‘A’ , calculate A(m,n),and if the character is ‘C’ , calculate C(m,n).
And print the answer in a single line.

Sample Input
2
A 10 10
C 4 2

Sample Output
3628800
6

Author
linle

Source
HDU 2007-1 Programming Contest

Source
2008 “Shun Yu Cup” Zhejiang Collegiate Programming Contest - Warm Up（1）

问题链接：HDU1570 A C
问题简述：（略）
问题分析：
    排列组合数计算问题，大水题。还是打表吧，不然毫无技术含量。
程序说明：（略）
参考链接：（略）
题记：（略）

AC的C语言程序如下：

/* HDU1570 A C */

#include <stdio.h>

#define N 10
long long fact[N + 1];

void init()
{
    int i;
    fact[1] = fact[0] = 1;
    for(i = 2; i <= N; i++)
        fact[i] = fact[i - 1] * i;
}

int main(void)
{
    init();

    int t, n, m;
    char c;

    scanf("%d%*c", &t);
    while(t--) {
        scanf("%c%d%d%*c", &c, &n, &m);
        long long a = fact[n] / fact[n - m];
        printf("%lld\n", c == 'A' ?  a : a / fact[m]);
    }

    return 0;
}