HDU 1570 A C(暴力)
来源:互联网 发布:js回调函数如何返回值 编辑:程序博客网 时间:2024/06/06 14:05
A C
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 5686 Accepted Submission(s): 3697
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 Input2A 10 10C 4 2Sample Output36288006AuthorlinleSourceHDU 2007-1 Programming Contest
#include<iostream>#include<algorithm>#include<cstdio>#include<cstring>using namespace std;int main(){ int t; scanf("%d",&t); int n,m; char a; int as[11]; as[0]=1; for(int i=1;i<=10;i++) as[i]=as[i-1]*i; while(t--) { getchar(); scanf("%c %d %d",&a,&n,&m); if(a=='A') { printf("%d\n",as[n]/as[n-m]); } else { printf("%d\n",as[n]/(as[m]*as[n-m])); } } return 0;}
- HDU 1570 A C(暴力)
- HDU 1570-A C(暴力)
- Hdu 1570 A C
- HDU 1570 A C
- hdu 1570 A C
- HDU 1570 A C
- HDU 4282 A very hard mathematic problem(暴力优化)
- HDU 3699 A hard Aoshu Problem (暴力搜索)
- HDU 4403 A very hard Aoshu problem (DFS暴力)
- HDU 4403 A very hard Aoshu problem(DFS+暴力)
- HDU 1339 A Simple Task(暴力枚举)
- HDU 4454 Stealing a Cake(暴力计算几何)
- HDU 1570 A C (数学题)
- 2013 蓝桥杯 C.A组 02题(暴力)
- HDOJ(HDU) 1570 A C
- HDU 5745(暴力)
- HDU 5762(暴力)
- hdu 5762(暴力)
- Openssl中AES加解密——CBC模式
- 史上最全的Vim命令
- js、script、window.onload、数组、
- 点击按钮切换图片
- ORACLE常用时间计算
- HDU 1570 A C(暴力)
- 欢迎使用CSDN-markdown编辑器
- leetcode 503. Next Greater Element II
- mySql常用函数
- Delphi奇技淫巧(一)string系列
- 基于Yii2.0发送邮箱
- 作业三
- openstack orchestration service list出错报ERROR: 503 Service Unavailable解决方法
- [虚树] BZOJ3611: [Heoi2014]大工程