fork download 
  1. def _s_u_b_s_e_t_s( n ):
  2.  
  3.     stack = [0]
  4.  
  5.     stack[-1] = 1
  6.  
  7.     for i in range(0, len(stack)):
  8.  
  9.         if stack[i] > 0:
  10.  
  11.            print(stack[i], end = '\n')
  12.  
  13.     while not len(stack) == 0 :
  14.  
  15.         if stack[-1] < n:
  16.  
  17.            stack.append(stack[-1] + 1)
  18.  
  19.         else:
  20.  
  21.            stack.pop()
  22.  
  23.            if len(stack)!= 0:
  24.  
  25.               stack[-1] += 1
  26.  
  27.  
  28.         for i in range(0, len(stack)):
  29.  
  30.            if stack[i] > 0:
  31.  
  32.               print(stack[i], end = ' ')
  33.  
  34.         print()              
  35.  
  36. def main():
  37.  
  38. 	n = int(input())
  39.  
  40. 	_s_u_b_s_e_t_s( n )
  41.  
  42. main()
Success #stdin #stdout 0.02s 9120KB
comments (?)
stdin 
3
stdout 
1
1 2 
1 2 3 
1 3 
2 
2 3 
3
https://ideone.com/ItktLY
Generating Subsets using Stack
language:
Python 3 (python  3.9.5)
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!