2019年4月28日
HDU 5398 GCD Tree
摘要： "题目链接" 题意： Teacher Mai has a graph with n vertices numbered from 1 to n. For every edge(u,v), the weight is gcd(u,v). (gcd(u,v) means the greatest com 阅读全文
posted @ 2019-04-28 16:13 季芊月 阅读(134) 评论(0) 推荐(0) 编辑