luogu#P10961. 划分大理石

    ID: 10154 远端评测题 1000ms 512MiB 尝试: 0 已通过: 0 难度: 5 上传者: 标签>动态规划 DPO2优化背包 DP动态规划优化

划分大理石

Problem Description

There are a1,a2,,a6a_1,a_2,\dots,a_6 marbles with values 1,2,,61,2,\dots,6, respectively. Now you need to divide them into two parts so that the total value of the two parts is equal. Determine whether this is possible. The total number of marbles does not exceed 2000020000.

Input Format

This problem contains multiple test cases. Each test case is given in a single line with 66 integers, which represent a1,a2,,a6a_1,a_2,\dots,a_6. If all 66 integers in a line are 00, it indicates the end of the input file.

For each test point, the number of valid test cases does not exceed 100100.

Output Format

For each test case, if the division is successful, output Can; otherwise output Can't.

4 7 4 5 9 1
9 8 1 7 2 4
6 6 8 5 9 2
1 6 6 1 0 7
5 9 3 8 8 4
0 0 0 0 0 0
Can't
Can
Can't
Can't
Can

Hint

Translated by ChatGPT 5