摘要：@ "toc" 题意 给你一颗$n(1e5)$个点有边权有点权的树，$Min(u,v)$表示$u,v$路径最小点权，$gcd(u,v)$表示$u,v$路径点权的最大公因数，$dis(u,v)$表示$u,v$路径大小。 输出$max(dis(u,v) gcd(u,v) Min(u,v))$ 解析 法一 阅读全文

摘要：QTREE4 cpp pragma comment(linker, "/STACK:102400000,102400000") // include include include include include include include include include define fi f 阅读全文

摘要：@ sudo apt update && sudo apt upgrade sudo apt-get install git fakeroot build-essential ncurses-dev xz-utils libssl-dev bc flex libelf-dev bison sudo 阅读全文