CP Course Contest

2 problems from CP Course Contest (contest 103540), difficulty -. 1/2 solutions verified against sample I/O.

2 items

CP Course Contest

Special | 2 problems | 1/2 verified | Difficulty - | 2m 40s

#	Problem	Rating	Tags	Accepted	Time	✓
A	I will win				39s	✓
B	Gift				2m 1s

Practice › Codeforces Solutions › CP Course Contest ›

CF 103540B - Gift

Let $(a{n-1},dots,a1,a0)$ be elements of the ternary reflected Gray code, so consecutive tuples differ in exactly one coordinate by $+1$ or $-1$, with all entries in ${0,1,2}$. The full sequence runs through all $3^n$ ternary $n$-tuples.

Practice › Codeforces Solutions › CP Course Contest ›

CF 103540A - I will win

We are simulating a tournament made of exactly $n$ games, where each game independently either increases or decreases your position on a linear ranking scale. You start at rank $n+1$.