notes/school/di-ma/uebung/03/st.py
Valentin Brandl fc55a49fb7
Add dima u03
2018-11-05 22:29:46 +01:00

42 lines
881 B
Python

#!/usr/bin/env python
def p(n,k):
if k == 0:
return 0
elif n == k or k == 1:
return 1
elif n < k:
return 0
else:
return p(n-1,k-1) + p(n-k,k)
def s(n,k):
if n == k:
return 1
elif k == 0:
return 0
elif n < k:
return 0
else:
return s(n-1,k-1) + (n-1)*s(n-1,k)
def S(n, k):
if n == k:
return " S_{" + n + "," + k + "} "
# return 1
elif k == 1:
return " S_{" + n + "," + k + "} "
# return 1
elif k == 0:
return " S_{" + n + "," + k + "} "
# return 0
elif n < k:
return " S_{" + n + "," + k + "} "
# return 0
else:
return " S_{" + str(n-1) + "," + str(k-1) + "} + " + str(k) + " * S_{" + str(n-1) + "," + str(k) + "} "
# return S(n-1,k-1) + k * S(n-1,k)
print(S(5,3))
# print(p(10,4))