The Preliminary Contest for ICPC Asia Nanjing 2019 B. super_log (欧拉函数)(数论)
In Complexity theory, some functions are nearly O(1)O(1)O(1), but it is greater then O(1)O(1)O(1). For example, the complexity of a typical disjoint set is O(nα(n))O(nα(n))O(nα(n)). Here α(n)α(n)α(n) ...
原创
2019-09-02 21:23:53 ·
1543 阅读 ·
0 评论