+ This is P6 on IMO 2025. The given grid size was 2025 in the original problem. +
++ Place rectangular tiles on the grid so that each row and each column has exactly one uncovered square. What's the smallest number of rectangles you can use? +
+ ++ {validationResult.message} +
++ Total uncovered squares: {validationResult.uncoveredCount} +
++ Based on IMO 2025 Problem P6 +
++ Place lines to cover all blue dots in the triangle where a + b ≤ n + 1. + A line is "sunny" if it's not parallel to the x-axis, y-axis, or x + y = 0. +
+ ++ Results for n = {n} +
++ k = {countSunnyLines()} (number of sunny lines) +
+Coverage Status:
++ {allTrianglePointsCovered() ? + "✅ All triangle points are covered" : + "❌ Some triangle points are not covered" + } +
+Line Summary:
++ Total: {lines.length} | Sunny: {countSunnyLines()} | Non-sunny: {countNonSunnyLines()} +
++ Practice with problems from programming competitions, mathematical olympiads, and algorithmic challenges with interactive solutions and explanations. +
++ No interactives found matching "{searchTerm}" +
+