@@ -0,0 +1,442 @@
+package algorithms;%0A%0Apublic class BinomialCoefficientAdditive %7B%0A  private long%5B%5D%5B%5D vals = new long%5BInteger.MAX_VALUE%5D%5BInteger.MAX_VALUE%5D;%0A  public long nChooseK(int n, int k) %7B%0A    if (vals%5Bn%5D%5Bk%5D == -1) %7B%0A      long res = nChooseK(n - 1, k - 1) + nChooseK(n - 1, k);%0A      if (res %3C 0) %7B%0A        throw new RuntimeException(%22Long overflow!%22);%0A      %7D%0A      vals%5Bn%5D%5Bk%5D = res;%0A      return res;%0A    %7D else %7B%0A      return vals%5Bn%5D%5Bk%5D;%0A    %7D%0A  %7D%0A%7D%0A

Add another way of calculating binomial coefficient