Last active
February 5, 2017 17:17
-
-
Save anemochore/02a56a9a9c8430ff361173a4da4fcc4e to your computer and use it in GitHub Desktop.
crude combination solution
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
def factorial(n): | |
if n <= 1: | |
return 1 | |
else: | |
return n * factorial(n - 1) | |
def combination(n, k): | |
if k == 0 or n == k: | |
return 1 | |
else: | |
return int(factorial(n) / factorial(k) / factorial(n - k)) | |
a = input().split(' ') | |
if not a[0].isdigit() or len(a) == 1 or not a[1].isdigit(): | |
print('both n and k should be numbers') | |
quit() | |
n, k = int(a[0]), int(a[1]) | |
if n < 0 or k < 0: | |
print('both n and k should be >= 0') | |
quit() | |
for n2 in range(n + 1): | |
for k2 in range(n2 + 1): | |
print("{0}C{1} = {2}".format(n2, k2, combination(n2, k2)), end=" ") | |
print() |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment