Tasks Details
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
medium
1.
PrettyTiling
Given a sequence of squares, find the minimum number of rotations needed to obtain a pretty sequence.
Task Score
100%
Correctness
100%
Performance
100%
Tom is decorating the pavement in his garden with N square tiles. Each tile is divided into four triangles of different colors (white - 'W', red - 'R', green - 'G' and blue - 'B'). A tile is described as a string of four characters denoting respectively, the color of the upper, right, bottom and left triangle. For example, the tile in the figure below is described as "WRGB".
Tom arranged the tiles in a row and decided to rotate some of them to obtain a pretty sequence. He considers a sequence of tiles pretty if each pair of adjacent tiles shares one side of the same color.
Write a function:
def solution(A)
that, given an array A of N strings, representing the sequence of tiles, returns the minimum number of 90-degree rotations (clockwise or counter-clockwise) that Tom has to perform.
Examples:
1. Given A = ["RGBW", "GBRW"], the function should return 1.
Tom can rotate the second tile counter-clockwise once to obtain a pretty sequence.
2. Given A = ["WBGR", "WBGR", "WRGB", "WRGB", "RBGW"], the function should return 4.
Tom can obtain a pretty sequence by rotating the first and third tiles counter-clockwise and the second and fourth tiles clockwise.
3. Given A = ["RBGW", "GBRW", "RWGB", "GBRW"], the function should return 2.
Tom can rotate the first tile clockwise twice to obtain a pretty sequence.
4. Given A = ["GBRW", "RBGW", "BWGR", "BRGW"], the function should return 2.
Tom can rotate the first two tiles clockwise to obtain a pretty sequence.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..100,000];
- string representing a tile has 4 letters (exactly one occurrence of 'R', 'G', 'B' and 'W').
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used Python
Time spent on task 56 minutes
Notes
not defined yet
Code: 05:07:50 UTC,
java,
autosave
Code: 05:14:46 UTC,
py,
autosave
Code: 05:15:01 UTC,
py,
autosave
Code: 05:16:03 UTC,
py,
autosave
Code: 05:16:14 UTC,
py,
autosave
Code: 05:16:25 UTC,
py,
autosave
Code: 05:16:48 UTC,
py,
autosave
Code: 05:16:59 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def solution(A):
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
Code: 05:17:15 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def solution(A):
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
rotate(A[i])
Code: 05:17:25 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def solution(A):
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
rotate(A[i],)
Code: 05:17:39 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def solution(A):
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
elif:
rotate(A[i],1)
Code: 05:17:58 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def solution(A):
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
elif ispretty(rotate(A[i],1), A[i+1]):
Code: 05:18:12 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def solution(A):
cnt=0
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
elif ispretty(rotate(A[i],1), A[i+1]):
cnt+=1
continue
Code: 05:18:45 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def solution(A):
cnt=0
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
elif ispretty(rotate(A[i],1), A[i+1]):
cnt+=1
continue
Code: 05:19:03 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
def solution(A):
cnt=0
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
elif ispretty(rotate(A[i],1), A[i+1]):
cnt+=1
continue
Code: 05:19:30 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
elif ispretty(rotate(A[i],1), A[i+1]):
cnt+=1
continue
Code: 05:20:00 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
elif ispretty(rotate(A[i],1), A[i+1]):
cnt+=1
continue
elif ispretty(A[i], A[i+1]):
cnt+=1
continue
Code: 05:20:30 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(rotate(A[i],1), A[i+1]):
cnt+=1
continue
elif ispretty(A[i], A[i+1]):
cnt+=1
continue
Code: 05:20:41 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(rotate(A[i],1), A[i+1]):
cnt+=1
break
elif ispretty(A[i], A[i+1]):
cnt+=1
continue
Code: 05:20:51 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(rotate(A[i],j), A[i+1]):
cnt+=1
break
elif ispretty(A[i], A[i+1]):
cnt+=1
continue
Code: 05:21:05 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(rotate(A[i],j+1), A[i+1]):
cnt+=1
break
elif ispretty(A[i], A[i+1]):
cnt+=2
continue
Code: 05:21:38 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(rotate(A[i],j+1), A[i+1]):
cnt+=1
break
elif ispretty(A[i], (A[i+1])):
cnt+=2
continue
Code: 05:21:49 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(rotate(A[i],j+1), A[i+1]):
cnt+=1
break
elif ispretty(A[i], rotate(A[i+1],j+1)):
cnt+=2
continue
Code: 05:22:00 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(rotate(A[i],j+1), A[i+1]):
cnt+=1
break
elif ispretty(A[i], rotate(A[i+1],j+1)):
cnt+=1
continue
Code: 05:25:21 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(rotate(A[i],j+1), A[i+1]):
cnt+=1
break
elif ispretty(A[i], rotate(A[i+1],j+1)):
cnt+=1
continue
Code: 05:25:31 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(4):
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(rotate(A[i],j+1), A[i+1]):
cnt+=1
break
elif ispretty(A[i], rotate(A[i+1],j+1)):
cnt+=1
continue
Code: 05:25:57 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(4):
A[0] = rotate(A[0],i)
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(rotate(A[i],j+1), A[i+1]):
cnt+=1
break
elif ispretty(A[i], rotate(A[i+1],j+1)):
cnt+=1
continue
Code: 05:26:19 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(4):
A[0] = rotate(A[0],i)
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
elif ispretty(A[i], rotate(A[i+1],j+1)):
cnt+=1
continue
Code: 05:26:29 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(4):
A[0] = rotate(A[0],i)
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
cnt+=1
continue
Code: 05:27:36 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(4):
A[0] = rotate(A[0],i)
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
cnt+=()
continue
Code: 05:28:05 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(4):
A[0] = rotate(A[0],i)
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt
continue
Code: 05:28:20 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(4):
A[0] = rotate(A[0],i)
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
continue
Code: 05:28:39 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(4):
A[0] = rotate(A[0],i)
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
Code: 05:28:52 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(4):
A[0] = rotate(A[0],i)
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
Code: 05:29:16 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(4):
A[0] = rotate(A[0],i)
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
Code: 05:29:26 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
cnt=0
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
Code: 05:29:44 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
cnt=0
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
Code: 05:29:56 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
Code: 05:30:07 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
return max(answer)
Code: 05:30:28 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
return max(answer)
Code: 05:30:39 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
cnt
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
return max(answer)
Code: 05:30:55 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
return max(answer)
Code: 05:30:55 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
return max(answer)
Code: 05:31:11 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
return max(answer)
Code: 05:31:28 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return max(answer)
Code: 05:31:37 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:31:55 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:32:09 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
if i==3
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:32:21 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:33:37 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:33:42 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
print(A[0])
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:36:08 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
print(A[0])
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:36:21 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[:]
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
print(A[0])
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:36:31 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[:]
for i in range(4):
cnt=0
A[0] = rotate(initA,i)
print(A[0])
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:36:33 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[:]
for i in range(4):
cnt=0
A[0] = rotate(initA,i)
print(A[0])
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:36:48 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[:]
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
print(A[0])
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:36:54 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0:1]
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
print(A[0])
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:37:19 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
print()
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
print(A[0])
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:37:32 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
print(initA, end=':')
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
print(A[0])
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:37:52 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
print(A[0])
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:38:01 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for i in range(4):
cnt=0
print(initA, end=':')
A[0] = rotate(initA, i)
print(A[0])
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:38:22 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
print(A[0])
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:38:28 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:40:05 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:40:25 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] =
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:40:29 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:45:12 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
pri
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:45:25 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(j,"번째")
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:45:49 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(i,"번째", j+1, "돌림")
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:46:04 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(i+1,"번째", j+1, "돌림")
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:46:15 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(i+1,"", j+1, "돌림")
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:46:45 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(i+1,":", j+1, "돌림")
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:46:50 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(i+1,":", j+1, "rotate")
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:47:23 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
A[0] = rotate(initA, i)
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(i+1,":", j+1, "rotate")
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:47:35 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
A[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(i+1,":", j+1, "rotate")
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:47:37 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
A[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(i+1,":", j+1, "rotate")
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:48:10 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
A[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(ri+1,":", j+1, "rotate")
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:48:19 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
A[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(r, ",",i+1,":", j+1, "rotate")
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:48:40 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
A[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(0, r, ",",i+1,":", j+1, "rotate")
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:49:37 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
A[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(0, r, ",",i+1,":", j+1, "rotate")
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:50:44 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
A[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(0, r, ",",i+1,":", j+1, "rotate")
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:50:53 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
A[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(0, r, ",",i+1,":", j+1, "rotate")
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:56:14 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
A[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(0, r, ",",i+1,":", j+1, "rotate",)
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:56:32 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
A[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(0, r, ",",i+1,":", j+1, "rotate", A[i], A)
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:56:38 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
A[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(0, r, ",",i+1,":", j+1, "rotate", A[i], rotate(A[i+1],j+1))
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:57:06 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
A[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(0, r, ",",i+1,":", j+1, "rotate", A)
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:57:08 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
A[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(0, r, ",",i+1,":", j+1, "rotate", A)
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:58:58 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
A[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(0, r, ",",i+1,":", j+1, "rotate", A)
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:59:03 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
A[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
A[i+1] = rotate(A[i+1],j+1)
print(0, r, ",",i+1,":", j+1, "rotate", A)
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 06:01:40 UTC,
py,
autosave
# you cBn write to stdout for debugging purposes, e.g.
# print("this is B debug messBge")
def rotBte(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else FBlse
def check(B):
return
def solution(B):
Bnswer=[]
initB = B[0]
for r in rBnge(4):
cnt=0
B[0] = rotBte(initB, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in rBnge(len(B)-1):
if ispretty(B[i], B[i+1]):
continue
else:
for j in rBnge(3):
if ispretty(B[i], rotBte(B[i+1],j+1)):
B[i+1] = rotBte(B[i+1],j+1)
print(0, r, ",",i+1,":", j+1, "rotBte", B)
if j==2:
cnt+=1
else:
cnt+=j+1
breBk
Bnswer.Bppend(cnt)
print(Bnswer)
return min(Bnswer)
Code: 06:01:51 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(B):
return
def solution(B):
answer=[]
initA = B[0]
for r in range(4):
cnt=0
B[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(B)-1):
if ispretty(B[i], B[i+1]):
continue
else:
for j in range(3):
if ispretty(B[i], rotate(B[i+1],j+1)):
B[i+1] = rotate(B[i+1],j+1)
print(0, r, ",",i+1,":", j+1, "rotate", B)
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 06:02:02 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def solution(A):
answer=[]
initA = B[0]
for r in range(4):
cnt=0
B[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(B)-1):
if ispretty(B[i], B[i+1]):
continue
else:
for j in range(3):
if ispretty(B[i], rotate(B[i+1],j+1)):
B[i+1] = rotate(B[i+1],j+1)
print(0, r, ",",i+1,":", j+1, "rotate", B)
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 06:02:14 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def solution(A):
answer=[]
B=A[:]
initA = B[0]
for r in range(4):
cnt=0
B[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(B)-1):
if ispretty(B[i], B[i+1]):
continue
else:
for j in range(3):
if ispretty(B[i], rotate(B[i+1],j+1)):
B[i+1] = rotate(B[i+1],j+1)
print(0, r, ",",i+1,":", j+1, "rotate", B)
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 06:02:45 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def solution(A):
answer=[]
B=A[:]
initA = A[0]
for r in range(4):
cnt=0
B[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(B)-1):
if ispretty(B[i], B[i+1]):
continue
else:
for j in range(3):
if ispretty(B[i], rotate(B[i+1],j+1)):
B[i+1] = rotate(B[i+1],j+1)
print(0, r, ",",i+1,":", j+1, "rotate", B)
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 06:02:54 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
B=A[:]
B[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(B)-1):
if ispretty(B[i], B[i+1]):
continue
else:
for j in range(3):
if ispretty(B[i], rotate(B[i+1],j+1)):
B[i+1] = rotate(B[i+1],j+1)
print(0, r, ",",i+1,":", j+1, "rotate", B)
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 06:03:04 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
B=A[:]
B[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(B)-1):
if ispretty(B[i], B[i+1]):
continue
else:
for j in range(3):
if ispretty(B[i], rotate(B[i+1],j+1)):
B[i+1] = rotate(B[i+1],j+1)
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 06:03:08 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
B=A[:]
B[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(B)-1):
if ispretty(B[i], B[i+1]):
continue
else:
for j in range(3):
if ispretty(B[i], rotate(B[i+1],j+1)):
B[i+1] = rotate(B[i+1],j+1)
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
return min(answer)
Code: 06:03:40 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
B=A[:]
B[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(B)-1):
if ispretty(B[i], B[i+1]):
continue
else:
for j in range(3):
if ispretty(B[i], rotate(B[i+1],j+1)):
B[i+1] = rotate(B[i+1],j+1)
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
return min(answer)
Code: 06:03:44 UTC,
py,
final,
score:
100
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
B=A[:]
B[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(B)-1):
if ispretty(B[i], B[i+1]):
continue
else:
for j in range(3):
if ispretty(B[i], rotate(B[i+1],j+1)):
B[i+1] = rotate(B[i+1],j+1)
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
return min(answer)