def solution(arr):
answer = 1
for i in range(len(arr)):
for j in range(len(arr[i])):
if arr[i][j] != arr[j][i]:
answer = 0
return answer
def solution(arr, idx):
answer = -1
for i, num in enumerate(arr):
if i >= idx and num == 1:
answer = i
return answer
else:
return answer
def solution(myString):
return [len(w) for w in myString.split('x')]
def solution(a, b):
tmp_1 = int(str(a) + str(b))
tmp_2 = 2 * a * b
answer = max(tmp_1, tmp_2) if tmp_1 != tmp_2 else tmp_1
return answer
def solution(n):
answer = [n]
x = n
while x != 1:
x = x/2 if x % 2 == 0 else 3*x+1
answer.append(x)
return answer
def solution(n):
return [[1 if i == j else 0 for i in range(n)] for j in range(n)]
def solution(strArr):
answer = []
for str in strArr:
if "ad" not in str:
answer.append(str)
return answer
a, b = map(int, input().strip().split(' '))
print(a,'+',b,'=',a+b)
def solution(myString):
answer = myString.strip().split('x')
answer.sort()
while "" in answer:
answer.remove("")
return answer
def solution(my_string):
answer = []
for i in range(len(my_string)):
answer.append(my_string[i:])
answer.sort()
return answer
def solution(arr):
answer = ''
for str in arr:
answer += str
return answer
def solution(arr, intervals):
answer = []
a1, b1 = intervals[0][0], intervals[0][1]
a2, b2 = intervals[1][0], intervals[1][1]
answer = arr[a1:b1+1]
answer += arr[a2:b2+1]
return answer
def solution(binomial):
tmp = binomial.split()
a, b = int(tmp[0]), int(tmp[2])
if tmp[1] == "+":
answer = a + b
elif tmp[1] == "-":
answer = a - b
else:
answer = a * b
return answer
def solution(number):
num_sum = 0
num_len = len(str(number))
for i in range(num_len):
num_sum += int(str(number)[i])
answer = num_sum % 9
return answer
def solution(a, b, c):
if a == b == c:
answer = (a+b+c) * (a**2 + b**2 + c**2) * (a**3 + b**3 + c**3)
elif (a==b) or (a==c) or (b==c):
answer = (a+b+c) * (a**2 + b**2 + c**2)
else:
answer = a+b+c
return answer
str = input()
for x in str:
print(x)
def solution(str1, str2):
answer = ''
for i in range(len(str1)):
answer += str1[i] + str2[i]
return answer
def solution(arr, queries):
for query in queries:
s, e = query[0], query[1]
for i in range(len(arr)):
if (s<=i) and (i<=e):
arr[i] += 1
return arr
def solution(a, d, included):
answer = 0
num_list = [a]
for i in range(len(included)-1):
num_list.append(num_list[-1]+d)
for idx, value in enumerate(included):
if value == True:
answer += num_list[idx]
return answer
def solution(date1, date2):
if date1[0] < date2[0]:
answer = 1
elif (date1[0] == date2[0]) and (date1[1] < date2[1]):
answer = 1
elif (date1[0] == date2[0]) and (date1[1] == date2[1]) and (date1[2] < date2[2]):
answer = 1
else:
answer = 0
return answer
def solution(board, k):
answer = 0
for i in range(len(board)):
for j in range(len(board[i])):
if i + j <= k:
answer += board[i][j]
return answer
def solution(my_string, m, c):
answer = ''
for i in range(c-1, len(my_string), m):
answer += my_string[i]
return answer
def solution(intStrs, k, s, l):
answer = []
for str in intStrs:
num = int(str[s:s+l])
if num > k:
answer.append(num)
return answer
def solution(arr, flag):
answer = []
for i in range(len(flag)):
if flag[i] == True:
cnt = arr[i] * 2
for j in range(cnt):
answer.append(arr[i])
else:
cnt = arr[i]
answer = answer[:-cnt]
return answer
def solution(my_string, indices):
answer = ''
for i in range(len(my_string)):
if i not in indices:
answer += my_string[i]
return answer
def solution(arr, queries):
answer = arr
for query in queries:
idx_1, idx_2 = query[0], query[1]
tmp = answer[idx_1]
answer[idx_1] = answer[idx_2]
answer[idx_2] = tmp
return answer
def solution(my_string, s, e):
answer = my_string[:s]
for i in range(e, s-1, -1):
answer += my_string[i]
answer += my_string[e+1:]
return answer
def solution(num_list):
answer = 0
for num in num_list:
while num != 1:
num = num/2 if num % 2 == 0 else (num-1)/2
answer += 1
return answer
def solution(myStr):
tmp = ''
for str in myStr:
if (str=="a") or (str=="b") or (str=="c"):
tmp += " "
else:
tmp += str
answer = tmp.strip().split()
answer = ["EMPTY"] if answer == [] else answer
return answer
def solution(myString, pat):
result = ''
last_index = myString.rfind(pat)
if last_index != -1:
result = myString[:last_index + len(pat)]
return result