The cell of a $(2m +1) \times (2n +1)$ board are painted in two colors - white and black. The unit cell of a row (column) is called [i]dominant[/i] on the row (the column) if more than half of the cells that row (column) have the same color as this cell. Prove that at least $m + n-1$ cells on the board are dominant in both their row and column.

Some squares of the infinite sheet of cross-lined paper are red. Each $2\times 3$ rectangle (of $6$ squares) contains exactly two red squares. How many red squares can be in the $9\times 11$ rectangle of $99$ squares?

In the rectangle $ABCD, BC = 5, EC = 1/3 CD$ and $F$ is the point where $AE$ and $BD$ are cut. The triangle $DFE$ has area $12$ and the triangle $ABF$ has area $27$. Find the area of the quadrilateral $BCEF$ . [img]https://1.bp.blogspot.com/-4w6e729AF9o/XNY9hqHaBaI/AAAAAAAAKL0/eCaNnWmgc7Yj9uV4z29JAvTcWCe21NIMgCK4BGAYYCw/s400/may%2B2011%2Bl1.png[/img]

The rectangle is cut into $10$ squares as shown in the figure on the right. Find its sides if the side of the smallest square is $3$.[img]https://cdn.artofproblemsolving.com/attachments/e/5/1fe3a0e41b2d3182338a557d3d44ff5ef9385d.png[/img]

With $21$ pieces, some white and some black, a rectangle is formed of $3 \times 7$. Prove that there are always four pieces of the same color located at the vertices of a rectangle.

Let $p,q$ be positive integers. Consider a rectangle $ABCD$ with lengths of sides $p$ and $q$ that consists of $pq$ unital squares. How many of these squares are crossed by diagonal $AC$?

A strip of width $1$ is to be divided by rectangular panels of common width $1$ and denominations long $a_1$, $a_2$, $a_3$, $. . .$ be paved without gaps ($a_1 \ne 1$). From the second panel on, each panel is similar but not congruent to the already paved part of the strip. When the first $n$ slabs are laid, the length of the paved part of the strip is $sn$. Given $a_1$, is there a number that is not surpassed by any $s_n$? The accuracy answer has to be proven.

Show that for every integer $n \geq 6$, there exists a convex hexagon which can be dissected into exactly $n$ congruent triangles.

Cut the $9 \times 10$ grid rectangle along the grid lines into several squares so that there are exactly two of them with odd sidelengths.

Andriy and Olesya take turns (Andriy starts) in a $2 \times 1$ rectangle, drawing horizontal segments of length $2$ or vertical segments of length $1$, as shown in the figure below. [img]https://i.ibb.co/qWqWxgh/Kyiv-MO-2021-Round-1-7-2.png[/img] After each move, the value $P$ is calculated - the total perimeter of all small rectangles that are formed (i.e., those inside which no other segment passes). The winner is the one after whose move $P$ is divisible by $2021$ for the first time. Who has a winning strategy? [i]Proposed by Bogdan Rublov[/i]

A square is drawn inside a rectangle. The ratio of the width of the rectangle to a side of the square is $ 2: 1$. The ratio of the rectangle's length to its width is $ 2: 1$. What percent of the rectangle's area is inside the square? $ \textbf{(A)}\ 12.5 \qquad \textbf{(B)}\ 25 \qquad \textbf{(C)}\ 50 \qquad \textbf{(D)}\ 75 \qquad \textbf{(E)}\ 87.5$

Let $m$ and $n$ be positive integers, and let $\mathcal R$ be a $2m\times{2n}$ grid of unit squares. A [i]domino[/i] is a $1\times2{}$ or $2\times{1}$ rectangle. A subset $S$ of grid squares in $\mathcal R$ is [i]domino-tileable[/i] if dominoes can be placed to cover every square of $S$ exactly once with no domino extending outside of $S$. [i]Note[/i]: The empty set is domino tileable. An [i]up-right path[/i] is a path from the lower-left corner of $\mathcal R$ to the upper-right corner of $\mathcal R$ formed by exactly $2m+2n$ edges of the grid squares. Determine, with proof, in terms of $m$ and $n$, the number of up-right paths that divide $\mathcal R$ into two domino-tileable subsets.

When the unit squares at the four corners are removed from a three by three squares, the resulting shape is called a cross. What is the maximum number of non-overlapping crosses placed within the boundary of a $ 10\times 11$ chessboard? (Each cross covers exactly five unit squares on the board.)

$ABCD$ is a rectangle. $I$ is the midpoint of $CD$. $BI$ meets $AC$ at $M$. Show that the line $DM$ passes through the midpoint of $BC$. $E$ is a point outside the rectangle such that $AE = BE$ and $\angle AEB = 90^o$. If $BE = BC = x$, show that $EM$ bisects $\angle AMB$. Find the area of $AEBM$ in terms of $x$.

Circles $ C_1$ and $ C_2$ with centers at $ O_1$ and $ O_2$ respectively meet at points $ A$ and $ B$. The radii $ O_1B$ and $ O_2B$ meet $ C_1$ and $ C_2$ at $ F$ and$ E$. The line through $ B$ parallel to $ EF$ intersects $ C_1$ again at $ M$ and $ C_2$ again at $ N$. Prove that $ MN \equal{} AE \plus{} AF$.

Squares $ABCD$, $EFGH$, and $GHIJ$ are equal in area. Points $C$ and $D$ are the midpoints of sides $IH$ ad $HE$, respectively. What is the ratio of the area of the shaded pentagon $AJICB$ to the sum of the areas of the three squares? [asy] pair A,B,C,D,E,F,G,H,I,J; A = (0.5,2); B = (1.5,2); C = (1.5,1); D = (0.5,1); E = (0,1); F = (0,0); G = (1,0); H = (1,1); I = (2,1); J = (2,0); draw(A--B); draw(C--B); draw(D--A); draw(F--E); draw(I--J); draw(J--F); draw(G--H); draw(A--J); filldraw(A--B--C--I--J--cycle,grey); draw(E--I); dot("$A$", A, NW); dot("$B$", B, NE); dot("$C$", C, NE); dot("$D$", D, NW); dot("$E$", E, NW); dot("$F$", F, SW); dot("$G$", G, S); dot("$H$", H, N); dot("$I$", I, NE); dot("$J$", J, SE);[/asy] $\textbf{(A)}\ \frac14 \qquad \textbf{(B)}\ \frac7{24} \qquad \textbf{(C)}\ \frac13 \qquad \textbf{(D)}\ \frac38 \qquad \textbf{(E)}\ \frac5{12}$

A cylindrical log has diameter $ 12$ inches. A wedge is cut from the log by making two planar cuts that go entirely through the log. The first is perpendicular to the axis of the cylinder, and the plane of the second cut forms a $ 45^\circ$ angle with the plane of the first cut. The intersection of these two planes has exactly one point in common with the log. The number of cubic inches in the wedge can be expressed as $ n\pi,$ where $ n$ is a positive integer. Find $ n.$

Let $ ABC$ be an acute angled triangle and let $ H$ be its ortho centre. Let $ h_{max}$ denote the largest altitude of the triangle $ ABC$. Prove that: $AH \plus{} BH \plus{} CH\leq2h_{max}$

In $\triangle ABC$ we have $BC>CA>AB$. The nine point circle is tangent to the incircle, $A$-excircle, $B$-excircle and $C$-excircle at the points $T,T_A,T_B,T_C$ respectively. Prove that the segments $TT_B$ and lines $T_AT_C$ intersect each other.

If the perimeter of rectangle $ABCD$ is $20$ inches, the least value of diagonal $\overline{AC}$, in inches, is: $\textbf{(A)}\ 0\qquad \textbf{(B)}\ \sqrt{50}\qquad \textbf{(C)}\ 10\qquad \textbf{(D)}\ \sqrt{200}\qquad \textbf{(E)}\ \text{none of these}$

Let $ABCD$ be a rectangle inscribed in circle $\omega$ with center $O$. Line $l$ passes trough $O$ and intersects lines $BC$ and $AD$ at points $E$ and $F$ respectively. Points $K$ and $L$ are the intersection points of $l$ and $\omega$ and points $K, E, F, L$ lie in this order on the line $l$. Lines tangent to $w$ in $K$ and $L$ intersect $CD$ at $M$ and $N$ respectively. Prove that $E, F, M, N$ lie on a common circle.

On a chessboard ($8\times 8$ squares with sides of length $1$) two diagonally opposite corner squares are taken away. Can the board now be covered with nonoverlapping rectangles with sides of lengths $1$ and $2$?

In the rectangle $ABCD$ with $|AB|<2 |AD|$, let $E$ be the midpoint of $AB$ and $F$ a point on the chord $CE$ such that $\angle CFD = 90^o$. Prove that $FAD$ is an isosceles triangle.

Let $ABCDEF$ be a regular hexagon with side length $2$. Calculate the area of $ABDE$. [i]2015 CCA Math Bonanza Lightning Round #1.2[/i]

Determine the number of non-degenerate rectangles whose edges lie completely on the grid lines of the following figure. $ \begin{tabular}{|c|c|c|c|c|c|} \hline & & & & & \\ \hline & & & & & \\ \hline & & \multicolumn{1}{c}{} & & & \\ \cline{1 \minus{} 2}\cline{5 \minus{} 6} & & \multicolumn{1}{c}{} & & & \\ \hline & & & & & \\ \hline & & & & & \\ \hline \end{tabular}$