TopCoder
关注
分享
扫一扫
deprecated_tzg
这个作者很懒，什么都没留下…
展开
-
TopCoder SRM 657 DIV 1
250Problem Statement Cat Snuke came up with some problems. He wants to construct as many problem sets as possible using those problems. Each problem set must contain exactly three原创 2015-05-01 14:47:28 · 1127 阅读 · 0 评论 -
TCO 2015 Round 1A DIV 1 1000
Problem Statement You have a weighted bipartite graph. Each partition contains n vertices numbered 0 through n-1. You are given the weights of all edges encoded into a vector A with n ele原创 2015-04-12 19:02:18 · 618 阅读 · 0 评论 -
TopCoder SRM 669 DIV 1
250Problem Statement The idols Ami and Mami like playing games. Today they bought a new game. At the beginning of the game a single slime appears on the screen. You are given原创 2015-10-03 21:52:00 · 1705 阅读 · 1 评论 -
整数的幂分解
topcoder srm 669 level 3给定整数X（X>=1 && X 很明显首先需要将X按M进制分解，问题关键是状态转移。设 X = b0 * M^0 + b1*M^1 + ... + bn*M^n，bi = [0,M)。对于bi*M^i，可以视作与其他分开考虑。所以问题的核心变成如何计算bi*M^i的拆解数目。借鉴了别人的代码，有些状态矩阵的转移很微妙。原创 2016-01-04 09:50:33 · 1232 阅读 · 1 评论