hdu1570(水题)
2016-03-05 09:43
232 查看
A C
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4710 Accepted Submission(s): 3023
[align=left]Problem Description[/align]
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 .
[align=left]Input[/align]
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)
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
2 A 10 10 C 4 2
[align=left]Sample Output[/align]
3628800 6
[align=left]Author[/align]
linle
[align=left]Source[/align]
HDU 2007-1 Programming Contest
#include<stdio.h> int F(int a) { int sum=1; for(int i=1;i<=a;i++) sum*=i; return sum; } int A(int m,int n){ return F(n)/F(n-m); } int C(int m,int n){ return A(m,n)/F(m); } int main() { char ch; int t,m,n; scanf("%d",&t); while(t--) { getchar(); scanf("%c%d%d",&ch,&n,&m); if(ch=='A') printf("%d\n",A(m,n)); else printf("%d\n",C(m,n)); } return 0; }
相关文章推荐
- [唐诗]秋夜喜遇王处士-王绩
- 大话设计模式之简单的工厂模式
- Zend Framework动作助手(Zend_Controller_Action_Helper)用法详解
- 单链表(c++实现)
- linux yum命令详解(转)
- Codeforces Round #344 (Div. 2) B 题题解 (暴力)
- 统计某个字符串中的标点符号数(c++11)
- java,编写一个矩形类,
- iOS APP 国际化
- //全排列问题的详细解答
- 返回一张图片的主色调
- CoreData版本自动变迁
- pixhawk自学笔记之Mixer学习
- 4415: [Shoi2013]发牌|线段树|并查集
- 背包问题先记录一下
- [唐诗]野望-王绩
- Caffe安装问题汇总
- 如何在程序中判断当前的qq空间图像是默认的空间图像------我现在已经不太喜欢严密的东东了
- Android在Fragment中使用Tab
- Java面试题之一对调两个数