摘要:
Tutorial for CF1167G English Version Hints What stops the rotation? A brute-force solution is straightforward, but how can we optimize it? Step 1 Ther 阅读全文
摘要:
English version Hints How to choose the edges greedily? In which cases does the greedy method fail? How can we find the extra non-tree edges? Solution 阅读全文
摘要:
Two language versions are available in order to serve both codeforces and luogu community. English Version Hints What's the necessary condition for \( 阅读全文
摘要:
Set algorithm Sometimes we may meet with some functions \(S\rightarrow V\)(S is a set,V is a value),and we need to handle some transformations on it. 阅读全文
摘要:
Fail to become GM. Hints are omitted. \(O(nmh^2)\) is too simple,just use dynamic programming. \(dp(i,j,k)\) means the probability to reach the goal i 阅读全文