Given a string S and an integer N as the
input, the program must split the string into groups whose size is N and print
them as the output in separate lines in a zig zag manner. If the last group
size is less than N then the remaining letters must be filled with asterisk as
shown in the Example Input/Output.
Input
Format:
The first line contains S. The second line
contains N.
Output
Format:
LENGTH(S)/N + LENGTH(S)%N lines containing
the desired pattern.
Boundary
Conditions:
4 <= LENGTH(S) <= 500 2 <= N
<= LENGTH(S)
Example
Input/Output 1:
Input:
ENVIRONMENT
3
Output:
ENV
ORI
NME
*TN
Example
Input/Output 2:
Input:
EVERYDAY
2
Output:
EV
RE
YD
YA
Solution:
s,n,i,j=input().strip(),int(input()),0,0
s= s+'*'*((len(s)//n+1)*n-len(s)) if
len(s)%n!=0 else s
while i<len(s):
print(s[i:i+n]) if j%2==0 else print(s[i+n-1:i-1:-1])
i+=n
j+=1