Codeforces Round 236 (Div. 1)

2 problems from Codeforces Round 236 (Div. 1) (contest 403), difficulty 2300-2900. 0/2 solutions verified against sample I/O.

2 items

Div. 1 | 2 problems | 0/2 verified | Difficulty 2300-2900 | 1m 57s

#	Problem	Rating	Tags	Accepted	Time	✓
D	Beautiful Pairs of Numbers	2300	combinatorics, dp	1,234	51s
E	Two Rooted Trees	2900	data-structures, implementation, trees	242	1m 6s

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

CF 403D - Beautiful Pairs of Numbers

Codeforces 403D: Beautiful Pairs of Numbers

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

Codeforces 403E: Two Rooted Trees