Project Euler Problem 15

  组合中一个基本问题--->C(40,20)

import java.math.*; public class PE15 { /** * @param args */ private static BigInteger combination(int total, int selection) { selection = selection > (total - selection) ? total - selection : selection; BigInteger r1 = BigInteger.ONE; BigInteger r2 = BigInteger.ONE; for (int i = 0; i < selection; i++) { r1 = r1.multiply(BigInteger.valueOf(total - i)); r2 = r2.multiply(BigInteger.valueOf(i + 1)); } return r1.divide(r2); } public static void main(String[] args) { // TODO Auto-generated method stub System.out.println(combination(40, 20)); } }

---

Answer:

137846528820

 

 

http://www.leftworld.net/online/j2sedoc/javaref/java.math.biginteger_dsc.htm

介绍Java BigInteger(比较详细)