notes/school/di-ma/uebung/02/st.py
Valentin Brandl e39bbdf827
Add dima u02
2018-10-27 16:57:32 +02:00

37 lines
586 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 1
elif k == 1:
return 1
elif k == 0:
return 0
elif n < k:
return 0
else:
return S(n-1,k-1) + k * S(n-1,k)
# print(S(9,5))
print(p(10,4))