'''
4016
def idk(x, y, z):
a = 0
if x>y:
a = y
else:
a = x
if a>z:
a = z
k = 0
for i in range(1, a+1):
if x % i == 0 and y % i == 0 and z % i == 0:
k=i
print(k)
a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
idk(a, b, c)
4021
def idk(x):
k = 0
for i in range(len(x)):
if x[i] % 2 != 0:
k += x[i]
if k == 0:
k = -1
print(k)
arr = input().split()
for i in range(len(arr)):
arr[i] = int(arr[i])
idk(arr)
4026
def idk(x):
x.sort()
if len(x) % 2 != 0:
print(x[len(x)//2])
else:
w = x[len(x)//2] + x[len(x)//2 + 1]
w = w /2
print(w)
arr = input().split()
for i in range(len(arr)):
arr[i] = int(arr[i])
idk(arr)
4031
def idk(x):
a = []
b = []
a.append(0)
b.append(0)
for i in range(len(x)):
if x[i] % 2 == 0:
a.append(x[i])
a.sort()
n = a[-1]
for i in range(len(x)):
if x[i] % 2 != 0:
b.append(x[i])
b.sort()
m = b[-1]
print(n + m)
arr = input().split()
for i in range(len(arr)):
arr[i] = int(arr[i])
idk(arr)
4051
def idk(x):
d = 0
for i in range(5):
k = x[i][1] - x[i][0]
if k <= 1:
k = 0
else:
k -= 1
if k > 4:
k = 4
d += k
k = d * 10000
if d >= 15:
k = k * 0.95
elif d <= 5:
k = k * 1.05
print(int(k))
n = []
for i in range(5):
arr = input().split()
for j in range(len(arr)):
arr[j] = float(arr[j])
n.append(arr)
idk(n)
4816
def idk(x):
if x >= 300:
a = x / 300
else:
a = 0
if (x % 300) >= 60:
b = (x % 300 )/ 60
else:
b = 0
if (x % 300 ) % 60 >= 10:
c = ((x % 300 ) % 60) / 10
else:
c = 0
if (int(a)*300) + (int(b)* 60) + (int(c)*10) == x :
print(int(a), int(b), int(c))
else:
print('-1')
n = int(input())
idk(n)
3129
def idk(x):
k = 0
for i in range(len(x)):
if x[i] == '(':
k += 1
if x[i] == ')':
k -= 1
if k < 0:
return 'bad'
break
if k == 0:
return 'good'
else:
return 'bad'
a = input()
print(idk(a))
3117
def idk(x):
n = []
for i in range(len(x)):
if x[i] != 0:
n.append(x[i])
else:
del n[-1]
a = 0
for i in range(len(n)):
a += n[i]
return a
k = int(input())
arr = []
for i in range(k):
p = int(input())
arr.append(p)
print(idk(arr))
1172 (bubble sort)
def idk(a):
for i in range(len(a)-1):
for j in range(len(a)-1):
if a[j] > a[j+1]:
t = a[j]
a[j] = a[j+1]
a[j+1] = t
for i in range(len(a)):
print(a[i], end=' ')
a = input().split()
for i in range(len(a)):
a[i] = int(a[i])
idk(a)
1420
def idk(x):
for i in range(len(x)-1):
for j in range(len(x)-1):
if x[j][1] < x[j+1][1]:
t = x[j]
x[j] = x[j+1]
x[j+1] = t
return x[2][0]
k = int(input())
arr =[]
for i in range(k):
a = input().split()
a[1] = int(a[1])
arr.append(a)
# [['minsu', 78], ['gunho', 64], ['sumin', 84], ['jiwon', 96], ['woosung', 55]]
print(idk(arr))
'''
'''
a = [1,2,3]
a[1:2] = ['a','b','c']
print(a)
b = [1,2,3]
b[1] = ['a','b','c']
print(b)
print(a.index(3)) #위치
print(a.insert(0, 5)) # 0 index에 5 넣기, 뒤에 숫자들 다 하나씩 밀림
'''
# a.remove(3) 첫번째로 나오는 3 삭제
# a.pop() 마지막자리꺼 보여주고 리스트에서 삭제
# a.pop(1) 1 index꺼 보여주고 리스트에서 삭제
# a.count(1) 1이 몇개
# a.extend([4,5]) 혹은 c = [4,5] 하고 a.extend(c)
# list(dic.keys()) # dic의 keys를 리스트로 변환 list(dic.values())
# dic.get('key') dic['key']
# dic.get('foo','bar') key 'foo'가 없을때 디폴트값 'bar' 리턴
'''
class student:
a = 10
b = 20
def sum(a):
return a+a
print(student.sum(10))
# linear
def rec(n):
if n == 0:
return
rec(n-1)
print(n)
k = int(input())
rec(k)
1901
def idk(x):
if x == 0:
return
idk(x-1)
print(x)
n = int(input())
idk(n)
# 1 2 3 4
1902
def idk(x):
if x == 0:
return
print(x)
idk(x-1)
n = int(input())
idk(n)
# 10 9 8 7
1904
def idk(x, y):
if y < x:
return
idk(x, y-1)
if y % 2 == 1:
print(y)
a, b = input().split()
a = int(a)
b = int(b)
idk(a, b)
1905
def idk(x):
if x == 1:
return 1
return x + idk(x-1)
n = int(input())
print(idk(n))
1912
def idk(x):
if x == 1:
return 1
return x * idk(x-1)
n = int(input())
print(idk(n))
# non-linear
1915 1,1,2,3,5,8,13....
def idk(x):
if x <= 2:
return 1
return idk(x-2)+ idk(x-1)
n = int(input())
print(idk(n))
1920
def idk(x):
if x == 0:
return
idk(x//2)
print(x % 2, end='')
n = int(input())
if n==0:
print(n)
else:
idk(n)
1928
def idk(x):
if x == 1:
return
if x % 2 == 1:
print(int(3*x + 1))
idk(3*x + 1)
else:
print(int(x / 2))
idk(x / 2)
n = int(input())
if n==1:
print(n)
else:
print(n)
idk(n)
Q1:
def func_a(k):
sum = 0
for i in range(k+1):
sum += i
return sum
def solution(n,m):
sum_to_m = func_a(m)
sum_to_n = func_a(n-1)
answer = sum_to_m - sum_to_n
return answer
Q2
b(score)
a(score)
c(score)
Q3
def func_a(arr, n):
ret = []
for x in arr:
if x!= n:
ret.append(x)
return ret
def func_b(a,b):
if a>= b:
return a - b
else:
return b-a
def func_c(arr):
ret = -1
for x in arr:
if ret< x:
ret = x
return ret
def solution(visitor):
max_first = func_c(visitor)
visitor_removed = func_a(visitor, max_first)
max_second = func_c(visitor_removed)
answer = func_b(max_first, max_second)
return answer
Q4
1. x>= 85
2. x >=70 and x <=84
3. x >=55 and x <=69
4. x >= 40 and x <= 54
5. x >= 0 and x <= 39
Q5
def solution(stones):
cnt = 0
current = 0
n = len(stones)
while n > current:
current += stones[current]
cnt += 1
return cnt
arr = [2,5,1,3,2,1]
print(solution(arr))
Q6
def solution(height,k):
answer = 0
n = len(height)
for h in height:
if h > k:
answer += 1
return answer
arr = [165,170,175,180,184]
x = 175
print(solution(arr, x))
Q7
def solution(s):
s_lst = list(s)
n = len(s)
for i in range(n):
if s_lst[i] == 'a':
s_lst[i] = 'z'
elif s_lst[i] == 'z':
s_lst[i] = 'a'
return "".join(s_lst)
s = 'abz'
print(solution(s))
Q8
def solution(name_list):
answer = 0
for name in name_list:
for n in name:
if n == 'j' or n == 'k':
answer += 1
break
return answer
s = ['james','luke', 'oliver', 'jack']
print(solution(s))
Q9
def solution(price, money):
answer = 0
for i in price:
answer += i
if money - answer >= 0:
return money - answer
else:
return -1
arr = [2100,3200,2100,800]
x = 10000
print(solution(arr, x))
Q10
def solution(arr, k):
idk =[]
for i in arr:
idk += i
idk.sort()
return idk[k-1]
arr = [[5,12,4,31],[24,13,11,2],[43,44,19,26],[33,65,20,21]]
x = 4
print(solution(arr, x))
4771
def idk(x):
k = 10
for i in range(len(x)-1):
if x[i] == x[i+1]:
k += 5
else:
k += 10
return k
a = str(input())
print(idk(a))
4776
def idk(x):
a = [0,1,2,3,4,5,6,7,8,9]
b = ['A','B','C','D','E','F','G','H','I','J','K','L']
i = (x+6) % 10
j = (x-4) % 12
print(b[j], end='')
print(a[i])
a = int(input())
idk(a)
4891
def idk(y):
k = int(y[-1]) - int(y[0])
if k == 0:
print(0)
else:
print(k)
a = int(input())
k = input().split()
for i in range(len(k)):
k[i] = int(k[i])
k.sort()
idk(k)
4592
map = []
for i in range(105):
v = []
for j in range(105):
v.append(0)
map.append(v)
a = int(input())
for i in range(a):
k = input().split()
x = int(k[0])
y = int(k[1])
for a in range(x, x+10):
for b in range(y, y+10):
map[a][b] = 1
sum = 0
for i in range(105):
for j in range(105):
sum += map[i][j]
print(sum)
4726
a, b = input().split()
a = int(a)
b = int(b)
k = input().split()
for i in range(len(k)):
k[i] = int(k[i]) # [3, -2, -4, -9, 0, 3, 7, 13, 8, -3]
n = -800
for i in range(len(k)-b+1):
sum = 0
for j in range(i, i+b):
sum += k[j]
if n < sum:
n = sum
print(n)
'''
top of page
실제 작동 상태를 확인하려면 라이브 사이트로 이동하세요.
200806
200806
댓글 0개
좋아요
댓글(0)
bottom of page