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
- persistent indexed tree
- round 424
- BOJ
- 이베이트미국
- finite group
- algebra
- 이베이트코리아
- subgroup
- indexed tree
- 백준
- self balancing binary search tree
- Algebraic Geometry
- Algorithm
- 이베이트
- 아시아나
- 구간쿼리
- Ebate USA
- 대수학
- ccw
- round 420
- 알고리즘
- 마일리지
- acmicpc
- 대한항공
- k번째 수
- Ebate Korea
- gallian
- Codeforces
- persistent segment tree
- 7469
Archives
- Today
- Total
목록Dynamic Programming (1)
[Round#455 Div2] C. Python Indentation
http://codeforces.com/problemset/problem/909/C C. Python Indentationtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn Python, code blocks don't have explicit begin/end or curly braces to mark beginning and end of the block. Instead, code blocks are defined by indentation.We will consider an extremely simplified subset of Python with only two..
Algorithm/CodeForces
2018. 1. 2. 21:12