Testing Round 20 (Unrated, Communication Problems)

4 problems from Testing Round 20 (Unrated, Communication Problems) (contest 2168), difficulty -. 0/4 solutions verified against sample I/O.

4 items

Testing Round 20 (Unrated, Communication Problems)

Special | 4 problems | 0/4 verified | Difficulty - | 7m 30s

#	Problem	Tags	Accepted	Time
A1	Encode and Decode (Easy Version)	communication, constructive-algorithms, interactive	5,024	1m 52s
A2	Encode and Decode (Hard Version)	bitmasks, communication, interactive	3,303	1m 48s
B	Locate	binary-search, combinatorics, communication	1,550	2m 16s
C	Intercepting Butterflies	bitmasks, communication, constructive-algorithms	876	1m 34s

Practice › Codeforces Solutions › Testing Round 20 (Unrated, Communication Problems) ›

CF 2168C - Intercepting Butterflies

Alice has a secret integer x between 1 and 2^15 that she wants to communicate to Bob using a set S drawn from the integers 1 through 20. The twist is that when Bob receives S, one element may have been added, one may have been removed, or S may be unchanged.

Practice › Codeforces Solutions › Testing Round 20 (Unrated, Communication Problems) ›

CF 2168B - Locate

Something went wrong. If this issue persists please contact us through our help center at help.openai.com.

Practice › Codeforces Solutions › Testing Round 20 (Unrated, Communication Problems) ›

CF 2168A1 - Encode and Decode (Easy Version)

We are asked to design a two-phase program that communicates an array of integers through a single string. On the first run, the program receives an array of length n, where each element is at most 26.

Practice › Codeforces Solutions › Testing Round 20 (Unrated, Communication Problems) ›

CF 2168A2 - Encode and Decode (Hard Version)

We are asked to implement a two-phase encoding and decoding process for an array of integers. In the first phase, the program receives an array a of size n with values up to one billion and must output a string s composed of lowercase letters.