[恢]hdu 1570

2011-12-16 01:50:33

地址:http://acm.hdu.edu.cn/showproblem.php?pid=1570

题意:算排列&组合数。数据忒小,不用考虑溢出。

代码:

# include <stdio.h>


int factorial[15] = {1, 1} ;


int main ()
{
int i, T, a, b ;
char ch ;
for(i = 2 ; i <= 10 ; i++)
factorial[i] = factorial[i-1] * i ;
scanf ("%d%*c", &T) ;
while (T--)
{
scanf ("%c %d %d%*c", &ch, &a, &b) ;
if (ch == 'A') printf ("%d\n", factorial[a] / factorial[a-b]) ;
else printf ("%d\n", factorial[a] / factorial[b] / factorial[a-b]) ;
}
return 0 ;
}



原文地址:https://www.cnblogs.com/lzsz1212/p/2314845.html