华为算法精英实战营第二十期-Beautiful Partit
【赛事简介】
In number theory and computer science, the partition problem, or number partitioning, is the task of deciding whether a given multiset S of positive integers can be partitioned into two subsets S1 and S2 such that the sum of the numbers in S1 equals the sum of the numbers in S2. Although the partition problem is NP-complete, there is a pseudo-polynomial time dynamic programming solution, and there are heuristics that solve the problem in many instances, either optimally or approximately. For this reason, it has been called "the easiest hard problem".
【参赛对象】
在校学生、开发者、企业员工等科技人员均可参赛。
【报名须知】
1. 报名方式:登录大赛官网,点击页面上方“立即报名”按钮进行报名。
2. 大赛以单人形式参赛,不需多人组队。
3. 赛题详情附件中有编译运行环境常见问题说明,请各位参赛选手仔细阅读。
【赛程说明】
报名:即日起-2025年3月15日18:00
作品提交:即日起-2025年3月15日18:00
【赛事交流答疑】
官方交流答疑论坛:https://bbs.huaweicloud.com/forum/forum-0122141620620367005-1.html
如有赛题疑问,请前往官方论坛发帖提问,我们将尽快解答~