python 3.x - permutations with two groups recursive -


i need kick in head on problem(https://uchicago.kattis.com/problems/uchicago.shortmanhattan). list code have written below. know looks terrible, can reach far. want present thinking problem.

def permunation_xy(x_move, y_move):     if len(x_move) == 0 , len(y_move) >= 1:         return y_move     elif len(y_move) == 0 , len(x_move) >= 1:         return x_move     elif len(x_move) == 0 , len(y_move) == 0:         return []      else:         [x_move[-1]] + permunation_xy(x_move[:-1], y_move)          [y_move[-1]] + permunation_xy(x_move, y_move[:-1])   x0, y0, x1, y1 = map(int, input().split()) x_move = [] y_move = [] if x0 == x1 , y0 == y1:     print("none") else:     dx = x1 - x0     dy = y1 - y0      if dx > 0:         x_move = ["right"] * abs(dx)     elif dx < 0:         x_move = ["left"] * abs(dx)     else:         x_move = []     if dy > 0:         y_move = ["up"] * abs(dy)     elif dy < 0:         y_move = ["down"] * abs(dy)     else:         y_move =[]      print(" ".join(permunation_xy(x_move, y_move)))

in problem, how should build recursion process? how deal multi outputs? think problem looks building simple binary tree?

beyond problem, depressed recursive programming, don't know how think them, don't know how establish basic step, , recursive step. can share experience me? thank you!


Comments

Post a Comment

Popular posts from this blog

python - Alternative to referencing variable before assignment -

import time # define variables username = "username" password = "password" customer_info_file_path = "c:\\users\megam\pycharmprojects\general stuff\the square pie co\customer " \ "information\{}.txt ".format(name) username_entry = input("enter username\n>>") password_entry = input("enter password\n>>") if username_entry != username or password_entry != password: print("access denied\nyou have entered username or password incorrectly. please check password , " "account name , try again.\n") else: print("access granted") choice_menu = input("\na) view list of customers\nb) add customer\nc) delete customer\nd) log out\n>>") if choice_menu == "a": customer_info = open(customer_info_file_path, 'a', ) file = open(customer_info_file_path, 'r') output = file.read() ...
Read more

vb.net - How to ignore if a cell is empty nothing -

how use roscolor() ignore value (like empty cell) ? color row if value upper 5 when there nothing in cell, want ignore roscolor() apply, how? public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val integer val = quotedatagridview1.rows(i).cells(3).value if val = vbempty quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white elseif val < 5 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.red elseif val > 5 , val < 10 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.lightyellow end if next end sub you can check empty value following public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val = quotedatagridview1.rows(i).cells(3).value if isdbnull(val) or val nothing quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white ...
Read more

recursion - Can every recursive algorithm be improved with dynamic programming? -

i first year undergraduate csc student looking competitive programming. recursion involves defining , solving sub problems. understand, top down dynamic programming (dp) involves memoizing solutions sub problems reduce time complexity of algorithm. can top down dp used improve efficiency of every recursive algorithm overlapping sub problems? dp fail work , how can identify this? the short answer is: yes. however, there constraints. obvious 1 recursive calls must overlap. i.e. during execution of algorithm, recursive function must called multiple times same parameters. lets truncate recursion tree memoization. can use memoization reduce number of calls. however, reduction of calls comes price. need store results somewhere. next obvious constraint need have enough memory. comes not-so obvious constraint. memory access requires time. first need find result stored , maybe copy location. in cases, might faster let recursion calculate result instead of loading somewher...
Read more