• hdu 1570 AC


    A C

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4830    Accepted Submission(s): 3115

    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 Input
    2
    A 10 10
    C 4 2
     
    Sample Output
    3628800
    6
     1 #include <iostream>
     2 using namespace std;
     3 int f[11] = {1, 1};
     4 
     5 
     6 int main(){
     7     for(int i = 2; i < 11; i++){
     8         f[i] = i * f[i-1];
     9     }
    10     int test, n, m;
    11     char c;
    12     cin >> test;
    13     while(test--){
    14         cin >> c >> n >> m;
    15         if(c == 'A')
    16             cout << f[n] / f[n - m] << endl;
    17         else if(c == 'C')
    18             cout << f[n] / f[m] / f[n - m] << endl;
    19     }
    20     return 0;
    21 }
  • 相关阅读:
    设计模式 --建造者模式
    HIVE
    Sqoop Mysql导入Hive完整命令参数解析
    Centos7 安装CDH6.3.2 集群
    sqlalchemy 批量插入
    前后端分离
    后台管理模板
    Springboot
    汇编基础
    百万点数据矢量切片实时聚合展示
  • 原文地址:https://www.cnblogs.com/qinduanyinghua/p/5560546.html
Copyright © 2020-2023  润新知