hdoj-1570A C
来源:互联网 发布:怎么知道淘宝店铺降权 编辑:程序博客网 时间:2024/05/29 18:53
A C
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5689 Accepted Submission(s): 3700
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 .
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)
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.
And print the answer in a single line.
Sample Input
2A 10 10C 4 2
Sample Output
36288006
题目链接
公式都给了,那就套公式吧。
#include<iostream>#include<cstdio>using namespace std;int jc(int n){ int sum=1; for(int i=1;i<=n;i++) sum*=i; return sum;}int A(int m,int n){ return jc(n)/jc(n-m);}int C(int m,int n){ return A(m,n)/jc(m);}int main(){ char c; int t,m,n; scanf("%d",&t); while(t--) { getchar(); scanf("%c%d%d",&c,&n,&m); if(c=='A') printf("%d\n",A(m,n)); else printf("%d\n",C(m,n)); } return 0;}
阅读全文
0 0
- hdoj 1570 A C
- hdoj-1570A C
- hdoj.1570 A C 20140825
- HDOJ(HDU) 1570 A C
- HDOJ 1570 A C(水题)
- hdoj 2503 a/b + c/d
- HDOJ 2503 a/b + c/d
- hdoj.2503 a/b + c/d 20140725
- hdoj 2503 a/b + c/d
- HDOJ--2503 a/b + c/d
- [数论]HDOJ 2503 a/b + c/d 欧几里得算法
- HDOJ-1002 A + B Problem II C语言
- HDOJ(HDU) 2503 a/b + c/d(最大公约数问题)
- HDOJ 2503 a/b + c/d(求最大公约数)
- HDOJ A strange lift
- HDOJ 1575 - Tr A
- HDOJ A Mathematical Curiosity
- A+B(HDOJ)
- 封装opencv的函数成dll,独立调用
- 【Scikit-Learn 中文文档】聚类
- 从最大子数组和问题详尽贪心算法策略
- N的阶乘末尾有多少个0 51Nod
- Android使用自定义控件实现无限轮播
- hdoj-1570A C
- 可持久化Treap(范浩强Treap)
- WPF下DataGrid header 居中及分隔线等属性设置
- Edit Distance
- Git使用-基本使用
- Linux实验四
- 【Scikit-Learn 中文文档】双聚类
- 谱聚类
- Flask学习(一):From表单更新