Codeforces Round 647 (Div. 2) - Thanks, Algo Muse!

3 problems from Codeforces Round 647 (Div. 2) - Thanks, Algo Muse! (contest 1362), difficulty 1000-1400. 2/3 solutions verified against sample I/O.

3 items

Codeforces Round 647 (Div. 2) - Thanks, Algo Muse!

Div. 2 | 3 problems | 2/3 verified | Difficulty 1000-1400 | 13m 41s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Johnny and Ancient Computer	1000	implementation	34,050	3m 46s	✓
B	Johnny and His Hobbies	1200	bitmasks, brute-force	21,033	2m 2s	✓
C	Johnny and Another Rating Drop	1400	bitmasks, greedy, math	23,690	7m 53s

Practice › Codeforces Solutions › Codeforces Round 647 (Div. 2) - Thanks, Algo Muse! ›

CF 1362C - Johnny and Another Rating Drop

We are given a sequence that always contains consecutive integers starting from 0 up to some number n. Each number is viewed in binary, and all numbers are conceptually padded with leading zeros so they share the same bit length.

Practice › Codeforces Solutions › Codeforces Round 647 (Div. 2) - Thanks, Algo Muse! ›

CF 1362A - Johnny and Ancient Computer

We are given a starting number and a target number, and we are allowed to transform the starting value using a very specific set of operations.

Practice › Codeforces Solutions › Codeforces Round 647 (Div. 2) - Thanks, Algo Muse! ›

CF 1362B - Johnny and His Hobbies

We are given a set of distinct integers. Johnny chooses a positive integer k and replaces every value s in the set with s XOR k. The transformation is applied to every element simultaneously.