CategoriesCTF2Math23Misc1OI47solution30template8project3sympy1Tagstree-diameter1tree-centroid1tree4tools2theme2surreal-numbers1sort1sieve2shortest-path1set-theory1sequence8random1project-euler1probability2prime4prefix-sum4powerful-number1poly1number-theory6meet-in-middle1math(oi)10linear-algebra1io2interactive2integrate2hash2hack1greedy3graph8geometry3general-term5games3fixed-point4finite-difference2fenwick1euler-totient1equation2dsu-on-tree1distance2dfs2data-structure5contest1constructive4construction1communication1combinatorics2brute-force1blocks1bitset2bits4binary-search1binary-lifting1asymptotic1Theorem6OS1OGF2Mo-algo2MST2Dynamic-Programming8Convolution2Calculus7Bugs1BIOS1Axiom1Ad-hoc5ASM1Tag: math(oi)2025-0808-29Codeforces Round 1046 (Div 2)08-24sqrt(n²+n+X) (ABC 420)08-20排序问题 (JXOI 2018)08-19平方数 (SNOI 2024)08-11质数判定和快速质因数分解08-09Luogu 981608-08组合数计算模板2025-0505-21十二重计数法05-20CF2109C (Div. 2) Hacking Numbers2024-0707-25快速 GCD 算法∧