Codeforces Round 500 (Div. 2) [based on EJOI]

2 problems from Codeforces Round 500 (Div. 2) [based on EJOI] (contest 1013), difficulty 800-1200. 2/2 solutions verified against sample I/O.

2 items

Codeforces Round 500 (Div. 2) [based on EJOI]

Div. 2 | 2 problems | 2/2 verified | Difficulty 800-1200 | 2m 47s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Piles With Stones	800	math	11,706	1m 15s	✓
B	And	1200	greedy	8,300	1m 32s	✓

Practice › Codeforces Solutions › Codeforces Round 500 (Div. 2) [based on EJOI] ›

CF 1013B - And

We are given a list of integers and a special integer x. The only allowed transformation is choosing an index and replacing that element with its bitwise AND with x. This operation can only decrease bits, since AND can only turn 1 bits into 0 depending on x.

Practice › Codeforces Solutions › Codeforces Round 500 (Div. 2) [based on EJOI] ›

CF 1013A - Piles With Stones

We are given two snapshots of the same system of stone piles. In the first snapshot, each pile has some number of stones, and in the second snapshot the piles have different counts.