Codeforces Round 156 (Div. 1)

2 problems from Codeforces Round 156 (Div. 1) (contest 256), difficulty 2400-2700. 1/2 solutions verified against sample I/O.

2 items

Codeforces Round 156 (Div. 1)

Div. 1 | 2 problems | 1/2 verified | Difficulty 2400-2700 | 5m

#	Problem	Rating	Tags	Accepted	Time	✓
D	Liars and Serge	2700	dp	279	3m 18s	✓
E	Lucky Arrays	2400	data-structures	714	1m 42s

Practice › Codeforces Solutions › Codeforces Round 156 (Div. 1) ›

CF 256D - Liars and Serge

We have n people sitting at a table, each of whom is either always honest or always lies. Honest people always answer truthfully about how many honest people are at the table. Liars can pick any number from 1 to n except the true number.

Practice › Codeforces Solutions › Codeforces Round 156 (Div. 1) ›

CF 256E - Lucky Arrays

We are given an array of length n, initially filled with zeroes. Each query sets a single element to a value between 0 and 3. Zero represents an unset element, while 1, 2, or 3 are actual values.