All the cells of a $10\times10$ board are colored white initially. Two players are playing a game with alternating moves. A move consists of coloring any un-colored cell black. A player is considered to loose, if after his move no white domino is left. Which of the players has a winning strategy? Proposed by A. Khrabrov

Define a quadratic trinomial to be "good", if it has two distinct real roots and all of its coefficients are distinct. Do there exist 10 positive integers such that there exist 500 good quadratic trinomials coefficients of which are among these numbers? Proposed by F. Petrov

A convex pentagon $ABCDE$ is given with $AB=BC$, $CD=DE$ and $\angle A=\angle C=\angle E>90^{\circ}$. Prove that the pentagon is circumscribed Proposed by F. Baharev

Let $a,b,c\in\mathbb{Z^{+}}$ such that $$(a^2-1, b^2-1, c^2-1)=1$$Prove that $$(ab+c, bc+a, ca+b)=(a,b,c)$$(As usual, $(x,y,z)$ means the greatest common divisor of numbers $x,y,z$) Proposed by A. Golovanov

Points $A_1$, $B_1$, $C_1$ are midpoints of sides $BC$, $AC$, $AB$ of triangle $ABC$. On midlines $C_1B_1$ and $A_1B_1$ points $E$ and $F$ are chosen such that $BE$ is the angle bisector of $AEB_1$ and $BF$ is the angle bisector of $CFB_1$. Prove that bisectors of angles $ABC$ and $FBE$ coincide. Proposed by F. Baharev

Find all positive integer solution: $$k^m+m^n=k^n+1$$ Proposed by V. Frank, F. Petrov

300 students participate on the international math olympiad. Every student speaks in exactly two of the official languages of the olympiad and every language is spoken by 100 people (it is known that students speak only the official languages). Prove that the students can be sited on a circular table, such that no two neighbors spoke the same language.

Quadratic trinomials $f$ and $g$ with integer coefficients obtain only positive values and the inequality $\dfrac{f(x)}{g(x)}\geq \sqrt{2}$ is true $\forall x\in\mathbb{R}$. Prove that $\dfrac{f(x)}{g(x)}>\sqrt{2}$ is true $\forall x\in\mathbb{R}$ Proposed by A. Khrabrov

The computer "Intel stump-V" can do only one operation with a number: add 1 to it, then rearrange all the zeros in the decimal representation to the end and rearrenge the left digits in any order. (For example from 1004 you could get 1500 or 5100). The number $12345$ was written on the computer and after performing 400 operations, the number 100000 appeared on the screen. How many times has a number with the last digit 0 appeared on the screen?

Let $I$ be the incenter of triangle $ABC$ and let $D$ be the midpoint of side $AB$. Prove that if the angle $\angle AOD$ is right, then $AB+BC=3AC$. Proposed by S. Ivanov

Rectangles $1\times20$, $1\times 19$, ..., $1\times 1$ were cut out of $20\times20$ table. Prove that from the remaining part of the table $36$ $1\times2$ dominos can be cut Proposed by S. Berlov

On the bisector $AL$ of triangle $ABC$ a point $K$ is chosen such that $\angle BKL=\angle KBL=30^{\circ}$. Lines $AB$ and $CK$ intersect at point $M$, lines $AC$ and $BK$ intersect at point $N$. FInd the measure of angle $\angle AMN$ Proposed by D. Shiryaev, S. Berlov

For any positive integers $n>m$ prove the following inequality: $$[m,n]+[m+1,n+1]\geq 2m\sqrt{n}$$As usual, [x,y] denotes the least common multiply of $x,y$ Proposed by A. Golovanov

On the parliament of Sikinia, for any two deputies, there is third deputy, which knows exactly one of the two. Every deputy belongs to one of the two ruling parties. Every day, he president tells a certain group of deputies to change the party that they belong, and all the deputies which which know at least one of the deputies of the group has to change their party too. Prove that, the president can reach any configuration of deputies between two parties.(The president himself isn't a member of the parliament of Sikinia). Proposed by S. Berlov

Do there exist distinct numbers $x,y,z$ from $[0,\dfrac{\pi}{2}]$, such that six number $\sin x$, $\sin y$,$\sin z$, $\cos x$, $\cos y$, $\cos z$ could be partitioned into 3 pairs with equal sums? Proposed by A. Golovanov

There are 2000 cities in a country and no roads. Prove that some cities can be connected by a road such that there would be 2 cities with 1 road passing through them, there would be 2 cities with 2 roads passim through them,...,there would be 2 cities with 1000 roads passing through them. Proposed by F. Bakharev

For any two positive integers $n>m$ prove the following inequality: $$[m,n]+[m+1,n+1]\geq \dfrac{2nm}{\sqrt{m-n}}$$As always, $[x,y]$ means the least common multiply of $x,y$. Proposed by A. Golovanov

Let $I$ and $H$ be the incenter and orthocenter of an acute triangle $ABC$. $M$ is the midpoint of arc $AC$ of circumcircle of triangle $ABC$ which does not contain point $B$. If $MI=MH$, find the measure of angle $\angle ABC$. Proposed by F. Bakharev

Find all functions $f:\mathbb{Z}\rightarrow\mathbb{Z}$ such that for any $x,y$ the following is true: $$f(x+y+f(y))=f(x)+2y$$proposed by F. Petrov

Rectangles $1\times20$, $1\times 19$, ..., $1\times 1$ were cut out of $20\times20$ table. Prove that the maximal amount of $1\times2$ dominos can be cut from the table is 85 Proposed by S. Berlov