fork(1) download
copy 
  1. N = 2
  2. M = 1
  3. K = 3
  4.  
  5. count = [0] * (N+1)
  6. prev = [0] * (N+1)
  7.  
  8. count[0] = 1 # empty set
  9.  
  10. for i in range(K):
  11. 	# move count to prev
  12. 	for index in range(N+1):
  13. 		prev[index] = count[index]
  14. 		count[index] = 0
  15.  
  16. 	# calculate new counts
  17. 	for prevSum in range(N+1):
  18. 		for value in range(M+1):
  19. 			newSum = min(N, prevSum+value)
  20. 			count[newSum] += prev[prevSum]
  21.  
  22. ans = (count[N] / pow(M+1, K))
  23. print(ans)
  24.  
Success #stdin #stdout 0.02s 9140KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
0.5
https://ideone.com/5N9fHj
language:
Python 3 (python  3.12)
created:
5 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!