cp

module

v0.0.0-...-16b8d63 Latest Latest Go to latest Published: Oct 13, 2020 License: MIT

Details

Path	Synopsis
atcoder
dp command T(i, j) 投完前 i 个硬币，j 个 head 的概率 T(1, 0) = 1 - p_1 T(1, 1) = p_1	T(i, j) 投完前 i 个硬币，j 个 head 的概率 T(1, 0) = 1 - p_1 T(1, 1) = p_1
codeforces
1405 command
669/E command
leetcode
3sum command
3sum-closest command
4sum command
binary-tree-maximum-path-sum command
course-schedule command
create-maximum-number command
edit-distance command
find-median-from-data-stream command
largest-rectangle-in-histogram command
letter-combinations-of-a-phone-number command
longest-consecutive-sequence command
longest-increasing-path-in-a-matrix command
longest-palindromic-substring command
longest-valid-parentheses command
lru-cache command
max-points-on-a-line command
maximal-rectangle command
maximum-performance-of-a-team command
merge-k-sorted-lists command
minimum-window-substring command
regular-expression-matching command
remove-nth-node-from-end-of-list command
sliding-window-maximum command
sliding-window-median command
two-sum command
wildcard-matching command
word-break-ii command