17 Jun PMCA Friday 19:00 Python Homework 20.06.12.
Solution 2 sample coding at the bottom of the page
When moving, ants form rows so that each ant except the first is behind another ant. It is not widely known what happens when two rows of ants moving in opposite directions run into each other in a passage too narrow for both rows to pass through. One theory says that, in that situation, ants will jump over each other.
From the moment the rows meet, each second every ant jumps over (or gets jumped over, as they agree upon) the ant in front of himself so that the two ants swap places, but only if the other ant is moving in the opposite direction. Find the order of the ants after T seconds.
The first line contains two integers N1 and N2, the numbers of ants in the first and second rows, respectively.
The next two rows contain the orders of ants in the first and second row (first to last). Each ant is uniquely determined by an uppercase letter of the English alphabet (this letter is unique between both rows).
The last line of input contains the integer T (0≤T≤50).
Output the order of the ants after TT seconds on a single line. Our viewpoint is such that the first row of ants comes from our left side and the other one from our right side.
Sample Input 1 3 3 ABC DEF 0 Sample Output 1 CBADEF
Sample Input 2 3 3 ABC DEF 2 Sample Output 2 CDBEAF
Sample Input 3 3 4 JLA CRUO 3 Sample Output 3 CARLUJO
Solution 2 sample code:
line = input().split()
n1 = int(line)
n2 = int(line)
row1 = input()
row2 = input()
row = list(row1[::-1]) + list(row2)
t = int(input())
d = 
for i in range(n1):
for i in range(n2):
for i in range(t):
p = 0
while p < n1+n2-1:
if d[p] < d[p+1]:
Sorry, the comment form is closed at this time.