Skip to content

[Programmers] Recursion 43165.target-number #7

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
seunguri wants to merge 2 commits into
base: main
Choose a base branch
from
Open

[Programmers] Recursion 43165.target-number #7

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
9994107
solve: 11729.hanoi-tower
seunguri Sep 16, 2021
af43579
solve: target-number
seunguri Sep 17, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
13 changes: 13 additions & 0 deletions Recursion/11729.Hanoi-tower/김승아.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,13 @@
import sys

def solve(a, b, c, n):
if n == 1: #최소 이동횟수
print(a, c)
else:
solve(a, c, b, n - 1)
print(a, c)
solve(b, a, c, n - 1)

n = int(sys.stdin.readline())
print(2**n - 1)
solve(1, 2, 3, n)
16 changes: 16 additions & 0 deletions Recursion/43165.target-number/김승아.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
def solution(numbers, target):
answer = recur(numbers, target, 0)
return answer

def recur(numbers, target, i):
answer = 0
if i == len(numbers):
if sum(numbers) == target:
return 1
else:
return 0
else:
answer += recur(numbers, target, i+1)
numbers[i] *= -1
answer += recur(numbers, target, i+1)
return answer