Codeforces Round 614 (Div. 2)

2 problems from Codeforces Round 614 (Div. 2) (contest 1293), difficulty 1000-1100. 0/2 solutions verified against sample I/O.

2 items

Codeforces Round 614 (Div. 2)

Div. 2 | 2 problems | 0/2 verified | Difficulty 1000-1100 | 12m 7s

#	Problem	Rating	Tags	Accepted	Time	✓
A	ConneR and the A.R.C. Markland-N	1100	binary-search, brute-force, implementation	16,151	2m 42s
B	JOE is on TV!	1000	combinatorics, greedy, math	22,294	9m 25s

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

CF 1293B - JOE is on TV!

The game can be seen as a process where we start with n opponents and repeatedly trigger rounds that remove some of them.

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

CF 1293A - ConneR and the A.R.C. Markland-N

There is not enough information to diagnose the bug or provide a corrected solution. The sample with expected output appears to belong to a string construction problem, but you have not provided: - the problem statement, - the original Python solution, - or even the name of…