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
- algorithm
- Query
- was
- SQL
- Bruteforce
- utils
- postreSQL
- Stack
- greedy
- Django
- combinations
- codecov
- Programmers
- ws
- Unit Testing
- Python
- HTTP 완벽 가이드
- stack&que
- 백준
- ORM
- permutations
- stateful
- dictionary
- Git
- AWS
- stateless
- pytest
- TDD
- Gunicorn
- Q objects
Archives
- Today
- Total
목록que (1)
해피 코딩!
[백준] 요세푸스 문제0
link length, remove_point = map(int, input().split()) lst = [i for i in range(1, length+1)] answer = [] index = 1 while lst: if index == remove_point: answer.append(lst.pop(0)) index = 1 continue else: index+=1 lst.append(lst.pop(0)) result = '' print(result)
알고리즘
2020. 12. 12. 07:12