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
- subgroup
- 대한항공
- 아시아나
- 구간쿼리
- round 424
- Codeforces
- gallian
- indexed tree
- self balancing binary search tree
- 이베이트코리아
- ccw
- algebra
- round 420
- 이베이트미국
- Ebate USA
- 백준
- k번째 수
- BOJ
- Algorithm
- acmicpc
- 7469
- 이베이트
- 마일리지
- finite group
- 알고리즘
- Ebate Korea
- Algebraic Geometry
- persistent indexed tree
- 대수학
- persistent segment tree
Archives
- Today
- Total
목록roudn 420 (1)
[Round#420 Div.2] E. Okabe and El Psy Kongroo
http://codeforces.com/contest/821/problem/E E. Okabe and El Psy Kongrootime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOkabe likes to take walks but knows that spies from the Organization could be anywhere; that's why he wants to know how many different walks he can take in his city safely. Okabe's city can be represented as all points (x, y)..
Algorithm/CodeForces
2017. 6. 26. 21:25