Decouple the relation and approach in different metrics
Posted on 2015-07-27 07:49:07 +0900 in Algorithm
Problem H – Humble Captains The problem is given an undirected graph (Vertices<=300), and need to color its vertices into red and blue in such a way that the total number of edges between the red vertices is as close as possible to the total number of edges between the...
SRM663
Posted on 2015-07-27 01:24:30 +0900 in Contest
ChangingChange Analyze The constraint on D is the key to solve this problem. As different ways are given, Generating function would be a great tool to hold all the info all at once. Suppose ways = {1, 3, 6, 2}, then By adding a coin whose value is 1, then...