![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
2017 Multi-University Training Contest - Team 1
ZZZZone
这个作者很懒,什么都没留下…
展开
-
2017 Multi-University Training Contest - Team 1 1001 Add More Zero
题目链接:VJ: https://vjudge.net/problem/HDU-6033 HDU原链接:http://acm.hdu.edu.cn/contests/contest_showproblem.php?pid=1001&cid=759题意: 给定一个m(1 ^m - 1和10^k长度相同的k是多少 思想:对于一个数x来说, log10(x) 就等于k, 就要考虑这个-1, 当只原创 2017-07-26 20:57:38 · 336 阅读 · 0 评论 -
2017 Multi-University Training Contest - Team 1 1011 KazaQ's Socks
Problem DescriptionKazaQ wears socks everyday.At the beginning, he has n pairs of socks numbered from 1 to n in his closets. Every morning, he puts on a pair of socks which has the sma原创 2017-07-26 21:41:43 · 268 阅读 · 0 评论 -
2017 Multi-University Training Contest - Team 1 1002 Balala Power!
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=6034题目大意: 给你n个字符串, a~z的每个字母可以映射为0~25的一个数字, 每个字符串会形成一个26进制的数, 让所有的字符串加起来的和最大, 并且不能有前导零。解题思路: 对于每一个字母, 他都有一个位权值, 只需要把所有的字母的位权和从大到小排序并且一一映射成数字,原创 2017-07-27 00:17:30 · 326 阅读 · 0 评论 -
2017 Multi-University Training Contest - Team 1 1006 Function
Problem DescriptionYou are given a permutation a from 0 to n−1 and a permutation b from 0 to m−1.Define that the domain of function f is the set of integers from 0 to n−1, and原创 2017-07-26 21:28:01 · 459 阅读 · 0 评论 -
2017 Multi-University Training Contest - Team 1 1003 Colorful Tree
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=6035题目大意: 给一棵n个点树, 每一个点有一个颜色ci, 对于每一条边对答案的贡献为这一条边上颜色不同的个数, 问有的n * (n - 1) / 2条边的贡献和是多小。参考博客:http://blog.csdn.net/my_sunshine26/article/details/76原创 2017-07-27 09:58:59 · 373 阅读 · 1 评论