2. 자료구조와 알고리즘 입문 5.정다면체

5.정다면체

import sys
sys.stdin=open("pythonalgorithm/섹션 2/5. 정다면체/in1.txt","rt")
n,m=map(int,input().split())
a=[0 for _ in range(n+m+1)]
for i in range(1,n+1):
    for j in range(1,m+1):
        a[i+j]+=1
largest=max(a)
for idx, x in enumerate(a):
    if x==largest:
        print(idx,end=" ")


## 선생님 풀이
cnt=[0]*(n+m+3)
max=-2147000000
for i in range(1,n+1):
    for j in range(1,m+1):
        cnt[i+j]+=1
for i in range(n+m+1):
    if cnt[i]>max:
        max=cnt[i]
for i in range(n+m+1):
    if cnt[i]==max:
        print(i, end=' ')

• 빈 리스트 만들기

a=[0 for _ in range(n+m+1)]
cnt=[0]*(n+m+3)