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 | 31 |
Tags
- stateless
- Q objects
- stack&que
- Programmers
- Query
- dictionary
- ORM
- combinations
- Python
- Unit Testing
- 백준
- Git
- AWS
- Gunicorn
- greedy
- SQL
- Django
- postreSQL
- TDD
- ws
- Stack
- permutations
- Bruteforce
- utils
- was
- HTTP 완벽 가이드
- pytest
- algorithm
- stateful
- codecov
Archives
- Today
- Total
목록완전탐색 (1)
해피 코딩!
[프로그래머스] 모의고사
link def solution(answers): answer = [] soopo_1 = [1, 2, 3, 4, 5,] soopo_2 = [2, 1, 2, 3, 2, 4, 2, 5] soopo_3 = [3, 3, 1, 1, 2, 2, 4, 4, 5, 5] soopo1 = 0 soopo2 = 0 soopo3 = 0 for index in range(len(answers)): if soopo_1[index % len(soopo_1)] == answers[index]: soopo1 += 1 if soopo_2[index % len(soopo_2)] == answers[index]: soopo2 += 1 if soopo_3[index % len(soopo_3)] == answers[index]: soopo3 +..
알고리즘
2020. 12. 12. 06:59