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

最新推荐文章于 2019-01-11 23:36:39 发布

卢超群

最新推荐文章于 2019-01-11 23:36:39 发布

阅读量1.1k

点赞数

分类专栏： JAVA ACM 文章标签： JAVA 杭电 hearthstone dfs 回溯

本文链接：https://blog.csdn.net/lu_chaoqun/article/details/44707883

版权

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

摘要由CSDN通过智能技术生成

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
  Because Cdfpysw is clever, there must be a way to split there card. Can you tell Cdfpysw what is the way?