2895: 反反复复

解题思路:

注意事项:

参考代码:

m = int(input())

s = input()

n = len(s)//m

l = []

k = 0

for i in range(n):

    t = []

    for j in range(m):

        t.append(s[k])

        k += 1

    l.append(t)

for i in range(n):

    if i%2 != 0:

        l[i] = l[i][::-1]

for i in range(m):

    for j in range(n):

        print(l[j][i],end="")