zoukankan      html  css  js  c++  java
  • hdu Buy the Ticket

     1 import java.math.BigInteger;
     2 import java.util.*;
     3 public class Main {
     4     public static void main(String []args)
     5     {
     6         Scanner cin=new Scanner(System.in);
     7         int n,m,i;
     8         int t1=0;
     9         while(cin.hasNextBigInteger())
    10         {
    11             t1++;
    12             m=cin.nextInt();
    13             n=cin.nextInt();
    14             if(m==0&&n==0) break;
    15             System.out.println("Test #"+t1+":");
    16             if(n>m)
    17             {
    18                 System.out.println("0");
    19             }
    20             else
    21             {
    22                 BigInteger sum=new BigInteger("1");
    23                 for(i=m+n; i>=1; i--)
    24                 {
    25                     BigInteger c1=new BigInteger(((Integer)i).toString());
    26                     sum=sum.multiply(c1);
    27                 }
    28                 int c=(m-n+1);
    29                 BigInteger m2=new BigInteger(((Integer)(m+1)).toString());
    30                 BigInteger m1=new BigInteger(((Integer)c).toString());
    31                 System.out.println(sum.multiply(m1).divide(m2));
    32             }
    33         }
    34     }
    35 
    36 }
    View Code
  • 相关阅读:
    【leetcode】二叉搜索树的最近公共祖先
    052-12
    052-11
    052-10
    052-9
    052-8
    052-6
    052-5
    052-3
    052-2
  • 原文地址:https://www.cnblogs.com/fanminghui/p/3755808.html
Copyright © 2011-2022 走看看