#18169. 约约约!!!!!
约约约!!!!!
说明
N个汉子和M个妹子在一起准备约,每次约要恰好选取S个人,但是每次要保证汉子的个数不少于4个,妹子的个数不少于1个,问有多少种选择的办法。输入格式
输入数据有T组。接下来输入N(4<=N<=30) M(1<=M<=30) S(5<=S<=M+N)
输出格式
对于每组数据输出一个数表示方案数。2
5 2 5
4 3 510
3
2
5 2 5
4 3 510
3
By signing up a 算道OJ universal account, you can submit code and join discussions in all online judging services provided by us.