Codeforces Round 664 (Div. 2)

Solutions for Codeforces Round 664 (Div. 2) (contest 1395). 1/3 problems verified against sample I/O. Difficulty range: 1000-1600.

3 items

Codeforces Round 664 (Div. 2)

Type: Div. 2 | Problems: 3 | Verified: 1/3 | Rating range: 1000-1600 | Time: 18m 47s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Boboniu Likes to Color Balls	1000	brute-force, math	8m 29s	✗
B	Boboniu Plays Chess	1100	constructive-algorithms	9m 1s	✗
C	Boboniu and Bit Operations	1600	bitmasks, brute-force, dp	1m 17s	✓

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

CF 1395B - Boboniu Plays Chess

Thanks. I can see exactly why the program fails. The traceback shows: Looking at the input: The program immediately tries to unpack two integers from the first line after reading the number of test cases, but the actual input format is clearly different: it starts with a…

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

CF 1395A - Boboniu Likes to Color Balls

We are given counts of four types of balls: red, green, blue, and white. The only allowed operation takes one red, one green, and one blue ball and converts all three into white balls. We may apply this operation any number of times.

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

CF 1395C - Boboniu and Bit Operations

We are given two small arrays of integers. For every element in the first array, we must pick one element from the second array and combine them using bitwise AND. This produces a new value for each position in the first array.