Codeforces Round 195 (Div. 2)

Solutions for Codeforces Round 195 (Div. 2) (contest 336). 2/2 problems verified against sample I/O. Difficulty range: 2100-2700.

2 items

Codeforces Round 195 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 2100-2700 | Time: 6m 33s

Problem	Name	Rating	Tags	Solve Time	Verified
D	Vasily the Bear and Beautiful Strings	2100	combinatorics, math, number-theory	3m 11s	✓
E	Vasily the Bear and Painting Square	2700	bitmasks, combinatorics, dp	3m 22s	✓

Practice › Codeforces Solutions › Codeforces Round 195 (Div. 2) ›

CF 336D - Vasily the Bear and Beautiful Strings

We are asked to count the number of binary strings containing exactly n zeros and m ones that can be reduced, through a sequence of specific operations, to a single character g.

Practice › Codeforces Solutions › Codeforces Round 195 (Div. 2) ›

CF 336E - Vasily the Bear and Painting Square

Vasily the Bear is creating a geometric structure on the plane using a sequence of squares and line segments, all centered at the origin. The parameter n controls the number of nested squares he draws, each forming vertices at multiples of 2i and 2i+1 along the axes.