kwm_t

kwm_tのメモ

Codeforces Round #831 (Div. 1 + Div. 2)

■A. Factorise N+M
n+n
■B. Jumbo Extra Cheese 2
max(a[i],b[i])でsort
■C. Bricks and Bags
適当に分けた
■D. Knowledge Cards
未処理がn*m-4個以下ならOk
■E. Hanging Hearts
わかんねぇ
落ち着いてやると木dp