0525_백준 7568번 : 덩치 & 백준 10448번 : 유레카이론 / Python

*완전탐색문제

 

백준 7568번 덩치 : https://www.acmicpc.net/problem/7568

7568번: 덩치

 

wh_lst =[]
for i in range(int(input())):
    wh_lst.append(list(map(int, input().split())))

for i in wh_lst:
    rank = 1
    for j in wh_lst:
        if i[0] < j[0] and i[1] < j[1]:
            rank += 1
    print(rank, end=' ')

 백준 10448번 유레카이론 : https://www.acmicpc.net/problem/10448

10448번: 유레카 이론

 

triangle = [n*(n+1)//2 for n in range(1,46)]
eureka = [0]*1001

for i in triangle:
    for j in triangle:
        for k in triangle:
            if i+j+k <= 1000:
                eureka[i+j+k] = 1
for i in range(int(input())):
    print(eureka[int(input())])