2018年7月31日
2018HDU多校训练-3-Problem M. Walking Plan
摘要： 链接：http://acm.hdu.edu.cn/showproblem.php?pid=6331 Walking Plan Problem Description There are n intersections in Bytetown, connected with m one way str 阅读全文
posted @ 2018-07-31 22:06 StarHai 阅读(310) 评论(0) 推荐(0)
2018HDU多校训练-3-Problem G. Interstellar Travel
摘要： 链接：http://acm.hdu.edu.cn/showproblem.php?pid=6325 Interstellar Travel Problem Description After trying hard for many years, Little Q has finally recei 阅读全文
posted @ 2018-07-31 21:55 StarHai 阅读(230) 评论(0) 推荐(0)
2018HDU多校训练-3-Problem F. Grab The Tree
摘要： Little Q and Little T are playing a game on a tree. There are n vertices on the tree, labeled by 1,2,...,n , connected by n−1 bidirectional edges. The 阅读全文
posted @ 2018-07-31 21:46 StarHai 阅读(366) 评论(0) 推荐(0)
2018HDU多校训练-3-Problem D. Euler Function
摘要： 链接：http://acm.hdu.edu.cn/showproblem.php?pid=6322 Problem Description In number theory, Euler's totient function φ(n) counts the positive integers up 阅读全文
posted @ 2018-07-31 21:35 StarHai 阅读(566) 评论(1) 推荐(0)