fork download 
  1. cnt = 0
  2.  
  3. def divide(n, l):
  4.     global cnt
  5.     if n == 0:
  6.         cnt += 1
  7.         print(' + '.join(str(x) for x in l))
  8.     elif n >= 2:
  9.         divide(n - 2, [*l, 2])
  10.         divide(n - 1, [*l, 1])
  11.     else:
  12.         divide(n - 1, [*l, 1])
  13.  
  14.  
  15. divide(4, [])
  16. print(cnt)
Success #stdin #stdout 0.02s 9088KB
comments (?)
stdin 
Standard input is empty
stdout 
2 + 2
2 + 1 + 1
1 + 2 + 1
1 + 1 + 2
1 + 1 + 1 + 1
5
https://ideone.com/nVwQOh
language:
Python 3 (python  3.12)
created:
3 years ago
visibility:
secret

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!