[SW11688] Calkin-Wilf tree 1

 

 SW Expert Academy- Calkin Wilf tree 1 

문제 링크

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AXgZSOn6ApIDFASW&categoryId=AXgZSOn6ApIDFASW&categoryType=CODE&problemTitle=&orderBy=FIRST_REG_DATETIME&selectCodeLang=ALL&select-1=3&pageSize=10&pageIndex=2 

SW Expert Academy

 

문제 입력

15
L
R
LL
LR
RL
RR
LLL
LRL
LRR
RLR
RRL
LLRLLRLRLLRRRRLRLRLLRLLRLRLLRR
LLLLLLLLLLLLLLLLLLLLLLLLLLLLLL
LLLLLLLLLLRLLLLLLLLLLLLLLLLLLL
RRRRRRRRRRRRRRRRRRRRRRRRRRLRRR

#1 1 2
#2 2 1
#3 1 3
#4 3 2
#5 2 3
#6 3 1
#7 1 4
#8 3 5
#9 5 2
#10 5 3
#11 3 4
#12 618347 259846
#13 1 31
#14 12 239
#15 111 28

 

문제 풀이

import sys

"""
[입력]
T
s: (t개의 줄) 길이 1이상 30이하 L, R
return 위치한 노드가 a b
"""

sys.stdin = open('input.txt', 'rt')
T = int(input())

for t in range(T):
    s = input()
    l, r = 1, 1

    for si in s:
        if si == 'L':
            l = l
            r = l + r
        else:
            l = l + r
            r = r
    print(f"#{t + 1}", l, r)

 

 

 

 

 

 

 

 

 

 

# SW Expert 알고리즘 python 풀이Calkin-Wilf tree

---