杭电OJ第十五届ACM第一题 Hearthstone

原创

于 2015-03-28 22:54:27 发布 · 1.2k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#JAVA #杭电 #hearthstone #dfs #回溯

本文详细介绍了参与杭电在线判题系统（OJ）第十五届ACM比赛的第一道题目——Hearthstone，主要探讨了使用深度优先搜索（DFS）和回溯算法来解决该问题的方法和思路。

Problem Description

  
  
   
     Cdfpysw loves playing a card game called "Hearthstone".
  Now he has N cards, he wants to split these cards into 4 piles. Let's assume the number of cards in each pile is a1, a2, a3, a4.
  It must be satisfied that:
    a1 * k1 = a2 + a3 + a4
    a2 * k2 = a1 + a3 + a4
    a3 * k3 = a1 + a2 + a4
    a1, a2, a3, a4 must be positive
&nbs