classic problems (for e-maxx)

2 problems from classic problems (for e-maxx) (contest 103536), difficulty -. 1/2 solutions verified against sample I/O.

2 items

classic problems (for e-maxx)

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

#	Problem	Rating	Tags	Accepted	Time	✓
A	Guards				46s	✓
B	Troubles				2m 5s

Practice › Codeforces Solutions › classic problems (for e-maxx) ›

CF 103536B - Troubles

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 › classic problems (for e-maxx) ›

CF 103536A - Guards

The problem gives a row of prison cells arranged in a line, each cell containing a prisoner with a fixed “danger value” or intelligence score. Alongside this, there are several guards, and every cell must be assigned to exactly one guard.