This year, some contestants at the Memorial Contest ABC are friends with each other (friendship is always mutual). For each contestant $X$, let $t(X)$ be the total score that this contestant achieved in previous years before this contest. It is known that the following statements are true: $1)$ For any two friends $X'$ and $X''$, we have $t(X') \neq t(X''),$ $2)$ For every contestant $X$, the set $\{ t(Y) : Y \text{ is a friend of } X \}$ consists of consecutive integers. The organizers want to distribute the contestants into contest halls in such a way that no two friends are in the same hall. What is the minimal number of halls they need?

Let $x,y$ and $z$ be positive real numbers such that $xy+z^2=8$. Determine the smallest possible value of the expression $$\frac{x+y}{z}+\frac{y+z}{x^2}+\frac{z+x}{y^2}.$$

Find all functions $f: \mathbb{N} \rightarrow \mathbb{Z}$ such that $|f(k)| \leq k$ for all positive integers $k$ and there is a prime number $p>2024$ which satisfies both of the following conditions: $1)$ For all $a \in \mathbb{N}$ we have $af(a+p) = af(a)+pf(a),$ $2)$ For all $a \in \mathbb{N}$ we have $p|a^{\frac{p+1}{2}}-f(a).$ Proposed by Nikola Velov

Let $D$ be a point inside $\triangle ABC$ such that $\angle CDA + \angle CBA = 180^{\circ}.$ The line $CD$ meets the circle $\odot ABC$ at the point $E$ for the second time. Let $G$ be the common point of the circle centered at $C$ with radius $CD$ and the arc $\overset{\LARGE \frown}{AC}$ of $\odot ABC$ which does not contain the point $B$. The circle centered at $A$ with radius $AD$ meets $\odot BCD$ for the second time at $F$. Prove that the lines $GE, FD, CB$ are concurrent or parallel.

For a given integer $k \geq 1$, find all $k$-tuples of positive integers $(n_1,n_2,...,n_k)$ with $\text{GCD}(n_1,n_2,...,n_k) = 1$ and $n_2|(n_1+1)^{n_1}-1$, $n_3|(n_2+1)^{n_2}-1$, ... , $n_1|(n_k+1)^{n_k}-1$. Proposed by Pavel Dimovski

In a group of $2n$ students, each student has exactly $3$ friends within the group. The friendships are mutual and for each two students $A$ and $B$ which are not friends, there is a sequence $C_1, C_2, ..., C_r$ of students such that $A$ is a friend of $C_1$, $C_1$ is a friend of $C_2$, et cetera, and $C_r$ is a friend of $B$. Every student was asked to assess each of his three friendships with: "acquaintance", "friend" and "BFF". It turned out that each student either gave the same assessment to all of his friends or gave every assessment exactly once. We say that a pair of students is in conflict if they gave each other different assessments. Let $D$ be the set of all possible values of the total number of conflicts. Prove that $|D| \geq 3n$ with equality if and only if the group can be partitioned into two subsets such that each student is separated from all of his friends.