返回题库

街区派对 2

Block Party 2

专题
Brainteaser / 脑筋急转弯
难度
L6

题目详情

Fill each cell with a positive integer such that integers do not repeat within any row, column, or outlined region. Within each region, one cell must be equal to the product of the other cells, and these “product” cells may not share edges with “product” cells from other regions. (See the example.)

The answer to this month’s puzzle is the smallest possible sum for the “product” cells.

解析


Original Explanation

The minimum possible sum is 210, which can be achieved in a handful of different ways. The one shown above is the only placement that has a 15 in the tetromino. (All the other placements use a 12.)

Congrats to this month’s solvers!