tiling-packing-divisibility
A geometric region must be covered or partitioned by pieces subject to area / divisibility constraints. The decisive observation is usually arithmetic: total area mod tile-area gives the minimum waste, or the constrained items must fit inside a small bounding rectangle.
풀이 전략
- Change grid_dimensions to 4x9 and reuse the same tile set — the mod-4 leftover shifts to a different value
- Replace 1x4 with 1x3 tiles to change divisor_d from 4 to 3
- For an extremal-configuration variant, ask for the MAXIMUM number of clean rows/cols instead of minimum
세부 유형 분포 (3)
한 줄을 클릭하면 그 안의 문제를 볼 수 있어요.
- rectangular-tiling-minimum-filler 29% (2)
A rectangle is tiled by two or more fixed piece sizes; the total area (mod the dominant tile area) forces the minimum number of filler or unit pieces, and the answer is the smallest achievable value consistent with both the arithmetic constraint and a valid geometric arrangement.
- piece-set-feasibility-elimination 29% (2)
A given inventory of distinct pieces (polyomino or brick shapes) must cover a target region; a coloring, size, or spatial argument identifies which target arrangement is impossible (or which piece combination is the only feasible one).
- divisibility-count-packing 43% (3)
Count how many items in a range satisfy a divisibility condition, then determine the minimum bounding dimensions (side length or row-plus-column sum) needed to contain all those items in a grid or square, verified by an explicit integer-solution or area argument.
더 보기 (연도 추세, 도구 fingerprint, 학년 분포, 전체 문제)
도구 fingerprint (1–17)
학년 분포
- Gr 3 2
- Gr 4 4