zoukankan      html  css  js  c++  java
  • hdu1133

    Buy the Ticket

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 6867    Accepted Submission(s): 2845


    Problem Description
    The "Harry Potter and the Goblet of Fire" will be on show in the next few days. As a crazy fan of Harry Potter, you will go to the cinema and have the first sight, won’t you?

    Suppose the cinema only has one ticket-office and the price for per-ticket is 50 dollars. The queue for buying the tickets is consisted of m + n persons (m persons each only has the 50-dollar bill and n persons each only has the 100-dollar bill).

    Now the problem for you is to calculate the number of different ways of the queue that the buying process won't be stopped from the first person till the last person.
    Note: initially the ticket-office has no money.

    The buying process will be stopped on the occasion that the ticket-office has no 50-dollar bill but the first person of the queue only has the 100-dollar bill.
     
    Input
    The input file contains several test cases. Each test case is made up of two integer numbers: m and n. It is terminated by m = n = 0. Otherwise, m, n <=100.
     
    Output
    For each test case, first print the test number (counting from 1) in one line, then output the number of different ways in another line.
     
    Sample Input
    3 0 3 1 3 3 0 0
     
    Sample Output
    Test #1: 6 Test #2: 18 Test #3: 180
     1 import java.util.*;  
     2 import java.math.BigInteger;  
     3 public class Main{  
     4     public static void main(String[] args){  
     5         Scanner in=new Scanner(System.in);  
     6         int cnt = 0;
     7         //int n=in.nextInt(); 
     8         int a;
     9         int b,i;
    10         while(in.hasNext())
    11         {
    12             cnt++;
    13             a=in.nextInt();
    14             b=in.nextInt();
    15             BigInteger ans=BigInteger.valueOf(1);
    16             if(a==0&&b==0)
    17                 break;
    18             if(a<b)
    19                 ans=BigInteger.ZERO;
    20             else 
    21             {
    22                 for(i=1;i<=a+b;i++)
    23                 {
    24                     ans=ans.multiply(BigInteger.valueOf(i));
    25                 }
    26                 int x=a-b+1;
    27                 int y=a+1;
    28                 ans=ans.multiply(BigInteger.valueOf(x));
    29                 ans=ans.divide(BigInteger.valueOf(y));
    30             }
    31             System.out.println("Test #"+cnt+":"); 
    32             System.out.println(ans);
    33         }
    34     }  
    35 }  
  • 相关阅读:
    PAT甲级1056Mice and Rice
    李宏毅机器学习课程笔记-5.3神经网络中的反向传播算法
    李宏毅机器学习课程笔记-5.2神经网络为什么要是深度的
    PAT甲级1014Waiting in Line
    python批量处理邮件:poplib和email快速上手教程
    李宏毅机器学习课程笔记-5.1深度学习之引言
    李宏毅机器学习课程笔记-4.2分类模型之概率生成模型
    李宏毅机器学习课程笔记-4.1分类简介及其与回归的区别
    类自动加载封装类
    var与let循环中经典问题
  • 原文地址:https://www.cnblogs.com/--lr/p/6847828.html
Copyright © 2011-2022 走看看