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
- 마일리지
- algebra
- k번째 수
- 대수학
- round 420
- 알고리즘
- round 424
- finite group
- self balancing binary search tree
- Algebraic Geometry
- indexed tree
- persistent segment tree
- persistent indexed tree
- Ebate USA
- Codeforces
- gallian
- Ebate Korea
- 백준
- Algorithm
- 아시아나
- BOJ
- 대한항공
- 7469
- 이베이트미국
- ccw
- 이베이트
- subgroup
- acmicpc
- 구간쿼리
- 이베이트코리아
Archives
- Today
- Total
목록LCA (1)
[Round#425 Div2] D. Misha, Grisha and Underground
http://codeforces.com/contest/832/problem/D D. Misha, Grisha and Underground time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMisha and Grisha are funny boys, so they like to use new underground. The underground has n stations connected with n - 1 routes so that each route connects two stations, and it is possible to reach every station from a..
Algorithm/CodeForces
2017. 7. 25. 23:42