Dividing

GitHub跳转原题关系图返回列表

本地题面缓存已迁移，解析内容待补充。

OJ: noi_openjudge

题目 ID: ch0405-16

难度:未知

标签:python

日期: 2026-07-30 23:01

目录

  1. 题意
  2. 思路
  3. 代码
  4. Python代码
    1. 复杂度
    2. 总结

题意

完整题面见同目录的 problem.md。

思路

代码

Python代码

python
case_number = 1
while True:
    counts = list(map(int, input().split()))
    if not any(counts):
        break
    total = sum((value + 1) * count for value, count in enumerate(counts))
    possible = total % 2 == 0
    if possible:
        target = total // 2
        reachable = 1
        mask = (1 << (target + 1)) - 1
        for value, count in enumerate(counts, start=1):
            batch = 1
            while count:
                take = min(batch, count)
                reachable |= reachable << (value * take)
                reachable &= mask
                count -= take
                batch <<= 1
        possible = (reachable >> target) & 1
    result = "Can be divided." if possible else "Can't be divided."
    print(f"Collection #{case_number}:\n{result}\n")
    case_number += 1

复杂度

总结