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
- round 420
- Algebraic Geometry
- 이베이트
- 이베이트코리아
- Algorithm
- 이베이트미국
- 7469
- finite group
- Ebate Korea
- indexed tree
- acmicpc
- Codeforces
- persistent segment tree
- 아시아나
- 대한항공
- persistent indexed tree
- BOJ
- algebra
- round 424
- 구간쿼리
- Ebate USA
- 마일리지
- 대수학
- self balancing binary search tree
- 알고리즘
- subgroup
- gallian
- ccw
- 백준
- k번째 수
Archives
- Today
- Total
목록too easy problems (1)
[Hello2018] D. Too Easy Problems
http://codeforces.com/problemset/problem/913/D D. Too Easy Problemstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are preparing for an exam on scheduling theory. The exam will last for exactly T milliseconds and will consist of n problems. You can either solve problem i in exactly ti milliseconds or ignore it and spend no time. You don't..
Algorithm/CodeForces
2018. 1. 12. 11:12