Bubble Cup 11 - Finals [Online Mirror, Div. 2]

3 problems from Bubble Cup 11 - Finals [Online Mirror, Div. 2] (contest 1046), difficulty 1400-2300. 2/3 solutions verified against sample I/O.

3 items

Bubble Cup 11 - Finals [Online Mirror, Div. 2]

Div. 2 | 3 problems | 2/3 verified | Difficulty 1400-2300 | 15m 39s

#	Problem	Rating	Tags	Accepted	Time	✓
C	Space Formula	1400	greedy	3,355	3m 45s
F	Splitting money	1400	implementation	3,117	4m 16s	✓
I	Say Hello	2300	geometry	574	7m 38s	✓

Practice › Codeforces Solutions › Bubble Cup 11 - Finals [Online Mirror, Div. 2] ›

CF 1046I - Say Hello

We are given two points moving in the plane over time, but their motion is only specified at discrete timestamps. Between consecutive timestamps, each friend moves in a straight line at constant speed, so the position at any intermediate time is obtained by linear interpolation.

Practice › Codeforces Solutions › Bubble Cup 11 - Finals [Online Mirror, Div. 2] ›

CF 1046C - Space Formula

We are given a leaderboard of astronauts sorted by their current total points in non-increasing order, meaning the first astronaut currently has the highest score and the last has the lowest. One specific astronaut, identified by their position $D$, is the one we care about.

Practice › Codeforces Solutions › Bubble Cup 11 - Finals [Online Mirror, Div. 2] ›

CF 1046F - Splitting money

We are given several Bitcoin wallets, each holding some amount of satoshis. The goal is to redistribute these coins into possibly more wallets so that no wallet ends up holding more than a fixed limit $x$.