|
public class PascalTriangle {
|
|
public static int binomialCoeff(int n, int k) {
|
|
if (k > n) {
|
|
return 0;
|
|
}
|
|
if (k == 0) {
|
|
return 1;
|
|
}
|
|
if (k == n) {
|
|
return 1;
|
|
}
|
|
if (k > n - k) {
|
|
k = n - k;
|
|
}
|
|
|
|
int result = 1;
|
|
int i = 0;
|
|
while (i < k) {
|
|
result = result * (n - i);
|
|
result = result / (i + 1);
|
|
i = i + 1;
|
|
}
|
|
return result;
|
|
}
|
|
|
|
public static int main() {
|
|
System.out.println(binomialCoeff(0, 0));
|
|
System.out.println(binomialCoeff(1, 0));
|
|
System.out.println(binomialCoeff(1, 1));
|
|
System.out.println(binomialCoeff(2, 0));
|
|
System.out.println(binomialCoeff(2, 1));
|
|
System.out.println(binomialCoeff(2, 2));
|
|
System.out.println(binomialCoeff(3, 0));
|
|
System.out.println(binomialCoeff(3, 1));
|
|
System.out.println(binomialCoeff(3, 2));
|
|
System.out.println(binomialCoeff(3, 3));
|
|
System.out.println(binomialCoeff(4, 2));
|
|
System.out.println(binomialCoeff(5, 2));
|
|
return 0;
|
|
}
|
|
}
|