def solution(arr, n):
answer = []
len_arr = len(arr)
if len_arr % 2 == 0:
for idx, value in enumerate(arr):
if idx % 2 == 1:
value += n
answer.append(value)
else:
for idx, value in enumerate(arr):
if idx % 2 == 0:
value += n
answer.append(value)
return answer
def solution(myString):
answer = myString.lower()
return answer
def solution(num, n):
if num % n == 0:
answer = 1
else:
answer = 0
return answer
def solution(myString):
answer = myString.upper()
return answer
str1, str2 = input().strip().split(' ')
print(str1+str2)
def solution(num_list, n):
answer = []
for idx, value in enumerate(num_list):
if idx == n:
break
answer.append(value)
return answer
def solution(number, n, m):
if (number % n == 0) and (number % m == 0):
answer = 1
else:
answer = 0
return answer
def solution(numbers, n):
answer = 0
for num in numbers:
answer += num
if answer > n:
return answer
def solution(flo):
answer = int(flo)
return answer
def solution(n_str):
answer = int(n_str)
return answer
def solution(num_list):
hap = 0
gop = 1
for num in num_list:
hap += num
gop *= num
answer = 1 if gop < hap*hap else 0
return answer
def solution(num_list):
hap = 0
gop = 1
if len(num_list) >= 11:
for num in num_list:
hap += num
return hap
else:
for num in num_list:
gop *= num
return gop
def solution(num_list, n):
answer = 1 if n in num_list else 0
return answer
def solution(my_string, n):
answer = my_string[:n]
return answer
def solution(my_string, n):
answer = my_string[-n:]
return answer
def solution(arr, k):
answer = []
if k % 2 == 1:
for num in arr:
answer.append(num*k)
else:
for num in arr:
answer.append(num+k)
return answer
def solution(arr):
answer = []
for num in arr:
if (num >= 50) and (num%2==0):
answer.append(num / 2)
elif (num < 50) and (num%2==1):
answer.append(num * 2)
else:
answer.append(num)
return answer
def solution(num_list, n):
answer = [num_list[i] for i in range(0, len(num_list), n)]
return answer
def solution(n):
answer = str(n)
return answer
def solution(my_string, index_list):
answer = ''
for idx in index_list:
answer += my_string[idx]
return answer
def solution(a, b, flag):
answer = a + b if flag == True else a - b
return answer
def solution(n, k):
answer = []
for i in range(1, n+1):
if i % k == 0:
answer.append(i)
return answer
def solution(my_string, alp):
answer = ''
for idx in range(len(my_string)):
if my_string[idx] == alp:
answer += my_string[idx].upper()
else:
answer += my_string[idx]
return answer
def solution(str1, str2):
answer = 1 if str1 in str2 else 0
return answer
def solution(a, b):
if (a%2==1) and (b%2==1):
answer = a**2 + b**2
elif (a%2==0) and (b%2==0):
answer = abs(a-b)
else:
answer = 2 * (a+b)
return answer
def solution(a, b):
tmp_1 = int(str(a) + str(b))
tmp_2 = int(str(b) + str(a))
if tmp_1 > tmp_2:
answer = tmp_1
elif tmp_1 < tmp_2:
answer = tmp_2
else:
answer = tmp_1
return answer
def solution(my_string, target):
answer = 1 if target in my_string else 0
return answer
def solution(start, end_num):
answer = [num for num in range(start, end_num-1, -1)]
return answer
def solution(my_string, is_prefix):
s_len = len(is_prefix)
answer = 1 if my_string[:s_len] == is_prefix else 0
return answer
def solution(num_list):
hol = ''
jjak = ''
for num in num_list:
if num%2 == 1:
hol += str(num)
else:
jjak += str(num)
answer = int(hol) + int(jjak)
return answer