Chocolate bar division with dimension constraints
Filed under Media.net
The question
Given a vector of k pairs and an m*n chocolate bar, divide the bar using horizontal or vertical cuts such that each resulting piece matches dimensions from the allowed pairs (where (1,2) allows both 1*2 and 2*1), and find the minimum non-divisible dimensions of chocolate left.
No write-up yet. Related questions below have one.
Related Media.net questions
Collected from public candidate posts and coding forums. Updated Nov 2026.