Codeforces Round 250 (Div. 2)

Solutions for Codeforces Round 250 (Div. 2) (contest 437). 1/1 problems verified against sample I/O. Difficulty range: 2500-2500.

1 items

Codeforces Round 250 (Div. 2)

Type: Div. 2 | Problems: 1 | Verified: 1/1 | Rating range: 2500-2500 | Time: 1m 18s

Problem	Name	Rating	Tags	Solve Time	Verified
E	The Child and Polygon	2500	dp, geometry	1m 18s	✓

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

CF 437E - The Child and Polygon

We are asked to count how many ways a simple polygon with $n$ vertices can be triangulated. Triangulation here means splitting the polygon into triangles that exactly cover the polygon without overlap and without introducing new points.