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
- ccw
- Ebate Korea
- persistent segment tree
- k번째 수
- Ebate USA
- round 420
- BOJ
- Codeforces
- round 424
- 이베이트코리아
- 마일리지
- finite group
- persistent indexed tree
- 이베이트미국
- 백준
- Algorithm
- 7469
- 아시아나
- 대수학
- 이베이트
- algebra
- 대한항공
- gallian
- Algebraic Geometry
- indexed tree
- 구간쿼리
- self balancing binary search tree
- subgroup
- 알고리즘
- acmicpc
Archives
- Today
- Total
목록okabe and banana trees (1)
[Round#420 Div.2] B. Okabe and Banana Trees
http://codeforces.com/contest/821/problem/B B. Okabe and Banana Treestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOkabe needs bananas for one of his experiments for some strange reason. So he decides to go to the forest and cut banana trees.Consider the point (x, y) in the 2D plane such that x and y are integers and 0 ≤ x, y. There is a tr..
Algorithm/CodeForces
2017. 6. 26. 21:09