# n = int(input())
# aaa = []
# for i in range(n):
# a = 0
# err = 0
# cnt = 0
# x = input()
# for j in range(len(x) // 2):
# if x[j] != x[-1-j]:
# a = 1
# err = j
# break
# if a == 0:
# print(0)
# aaa.append(0)
# continue
# else:
# y = list(x)
# z = list(x)
# y.pop(err)
# # print(y)
# z.pop(-1-err)
# # print(z)
# for j in range(len(x) // 2):
# if y[j] != y[-1-j]:
# # print('y ' + y[j], y[-1-j])
# cnt += 1
# break
# for j in range(len(x) // 2):
# if z[j] != z[-1-j]:
# # print('z ' + z[j], z[-1-j])
# cnt += 1
# if cnt == 2: a = 2
# cnt = 0
# break
# print(a)
# aaa.append(a)
# # for i in range(len(aaa)):
# # print(aaa[i], end=' ')
n = int(input())
weight = list(map(int, input().split()))
sum = 0
for i in range(n):
sum += weight[i]
memo = [0 for _ in range(sum)]
memo[-1] = 1
#????????????????
sum = 0
for i in range(n):
if memo[i] == 0:
sum += 1
for i in range(n):
print(i, memo[i])
print(sum)
top of page
실제 작동 상태를 확인하려면 라이브 사이트로 이동하세요.
20240501
20240501
댓글 0개
좋아요
댓글(0)
bottom of page