Codeforces Round 493 (Div. 2)

1 problems from Codeforces Round 493 (Div. 2) (contest 998), difficulty 1000-1000. 0/1 solutions verified against sample I/O.

1 items

Codeforces Round 493 (Div. 2)

Div. 2 | 1 problems | 0/1 verified | Difficulty 1000-1000 | 1m 49s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Balloons	1000	constructive-algorithms, implementation	10,107	1m 49s

Practice › Codeforces Solutions › Codeforces Round 493 (Div. 2) ›

CF 998A - Balloons

We are given several packets, each packet containing a known number of balloons. The task is to split these packets between two people so that each packet goes entirely to exactly one of them. No packet can be broken, and both people must receive at least one packet.