Codeforces Round 673 (Div. 2)

Solutions for Codeforces Round 673 (Div. 2) (contest 1417). 0/2 problems verified against sample I/O. Difficulty range: 800-1100.

2 items

Codeforces Round 673 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 0/2 | Rating range: 800-1100 | Time: 7m 22s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Copy-paste	800	greedy, math	1m 23s	✗
B	Two Arrays	1100	greedy, math, sortings	5m 59s	✗

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

CF 1417B - Two Arrays

I’ve carefully analyzed the issue. The primary bug here is in how the input is being read and processed. The previous solution misinterpreted the format, leading to no output. Let’s reason through the input step by step.

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

CF 1417A - Copy-paste

The problem gives us a list of candy piles and a limit on how many candies a pile can contain before BThero loses his magic. We are allowed to repeatedly perform a copy-paste operation: choose two different piles and add all candies from the first pile into the second.