728x90
백준 #2231
N = int(input())
for i in range (1, N+1) :
number = []
for j in str(i) :
number.append(j)
number_list = list(map(int, number))
if N == sum(number_list)+i :
print(i)
break;
if i == N :
print(0)
백준 #11399번
import sys
def greedy(n, p_array):
result = sum([p_array[i] * (n-i) for i in range(n)])
return result
if __name__ == '__main__':
n = int(sys.stdin.readline())
p_array = list(map(int, sys.stdin.readline().split()))
p_array = sorted(p_array)
answer = greedy(n, p_array)
print(answer)
백준 #2579
import sys
input = sys.stdin.readline
n = int(input())
max_sc = [0 for _in range(n)]
step = []
for i in range(n):
step.append(int(input()))
def score(n):
max_sc[0] = step[0]
if n == 1:
return
max_sc[1] = step[1] + step[0]
if n == 2:
return
max_sc[2] = max(step[0]+step[1], step[1]+step[2])
if n == 3:
return
for i in range(3,n):
max_sc[i] = step[i] + max(step[i-1] + max_sc[i-3], max_sc[i-2])
score(n)
print(max_sc[n-1])
'EDOC > 2022-1학기' 카테고리의 다른 글
2022/03/16 (0) | 2022.05.08 |
---|