Notice
Recent Posts
Recent Comments
Link
| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | 2 | |||||
| 3 | 4 | 5 | 6 | 7 | 8 | 9 |
| 10 | 11 | 12 | 13 | 14 | 15 | 16 |
| 17 | 18 | 19 | 20 | 21 | 22 | 23 |
| 24 | 25 | 26 | 27 | 28 | 29 | 30 |
Tags
- 백준
- TDD
- stateless
- algorithm
- Programmers
- pytest
- SQL
- ORM
- Gunicorn
- permutations
- postreSQL
- Python
- Q objects
- ws
- Git
- Query
- stack&que
- Unit Testing
- utils
- combinations
- was
- dictionary
- Stack
- HTTP 완벽 가이드
- stateful
- Django
- Bruteforce
- AWS
- greedy
- codecov
Archives
- Today
- Total
목록백준 (17)
해피 코딩!
[백준] 덩치 7568번
link length = int(input()) lst = [0]* length stack = [0] * length # 모든 값을 넣은다. for index, value in enumerate(lst): weight, height = map(int, input().split(' ')) lst[index] = weight, height # 비교 for index, value in enumerate(lst): rank = 1 for indent_1, indent_1_value in enumerate(lst): if index == indent_1: continue if (value[0] < indent_1_value[0]) and (value[1]
알고리즘
2020. 12. 12. 07:06