Python算法--斐波那契字符串

1.题目要求2.题目分析3.算法代码

O O O o O o o O
1 2 3 4 5 6 7 8
1 1 2 3 5 8 13 21

需要每个递增的数字都在斐波那契数列里面,然后把两个一拆开==大写的O,
拆成两部分构成。最后输出打印
代码如下：

res = []
x = int(input())
a, b = 0, 1
while b <= x:
    res.append(b)
    a, b = b, a + b

y = res[2:x+1]
count = []
for i in range(1,3):
    if x==1:
        count.append('O')
        break
    elif x==0:
        break
    else:
        count.append('O')

for j in range(3,x+1):
    if j in y  :
        count.append('O')
    else:
        count.append('o')

for v in count:
    print(v, end="")