Let $n\geq 2$ be a fixed positive integer. Let $\{a_1,a_2,...,a_n\}$ be fixed positive integers whose sum is $2n-1$. Denote by $S_{\mathbb{A}}$ the sum of elements of a set $A$. Find the minimal and maximal value of $S_{\mathbb{X}}\cdot S_{\mathbb{Y}}$ where $\mathbb{X}$ and $\mathbb{Y}$ are two sets with the property that $\mathbb{X}\cup \mathbb{Y}=\{a_1,a_2,...,a_n\}$ and $\mathbb{X}\cap \mathbb{Y}=\emptyset.$ [i]Note: $\mathbb{X}$ and $\mathbb{Y}$ can have multiple equal elements. For example, when $n=5$ and $a_1=...=a_4=1$ and $a_5=5$, we can consider $\mathbb{X}=\{1,1,1\}$ and $\mathbb{Y}=\{1,5\}$. Moreover, in this case, $S_\mathbb{X}=3$ and $S_{\mathbb{Y}}=6.$[/i]

$2019$ people (all of whom are perfect logicians), labeled from $1$ to $2019$, partake in a paintball duel. First, they decide to stand in a circle, in order, so that Person $1$ has Person $2$ to his left and person $2019$ to his right. Then, starting with Person $1$ and moving to the left, every person who has not been eliminated takes a turn shooting. On their turn, each person can choose to either shoot one non-eliminated person of his or her choice (which eliminates that person from the game), or deliberately miss. The last person standing wins. If, at any point, play goes around the circle once with no one getting eliminated (that is, if all the people playing decide to miss), then automatic paint sprayers will turn on, and end the game with everyone losing. Each person will, on his or her turn, always pick a move that leads to a win if possible, and, if there is still a choice in what move to make, will prefer shooting over missing, and shooting a person closer to his or her left over shooting someone farther from their left. What is the number of the person who wins this game? Put “$0$” if no one wins.

The 16 fields of a $4 \times 4$ checker board can be arranged in 18 lines as follows: the four lines, the four columns, the five diagonals from north west to south east and the five diagonals from north east to south west. These diagonals consists of 2,3 or 4 edge-adjacent fields of same colour; the corner fields of the chess board alone do not form a diagonal. Now, we put a token in 10 of the 16 fields. Each of the 18 lines contains an even number of tokens contains a point. What is the highest possible point number when can be achieved by optimal placing of the 10 tokens. Explain your answer.

A $6 \times 6$ board is given such that each unit square is either red or green. It is known that there are no $4$ adjacent unit squares of the same color in a horizontal, vertical, or diagonal line. A $2 \times 2$ subsquare of the board is [i]chesslike[/i] if it has one red and one green diagonal. Find the maximal possible number of chesslike squares on the board. [i]Proposed by Nikola Velov[/i]

A regular 1001-gon is drawn on a board, the vertiecs of which are numbered with $1,2,\ldots,1001.$ Is it possible to label the vertices of a cardboard 1001-gon with the numbers $1,2,\ldots,1001$ such that for any overlap between the two 1001-gons, there are two vertices with the same number one over the other? Note that the cardboard polygon can be inverted.

Consider the set of grid points $(m,n)$ in the plane, $m,n$ integers. Let $\sigma$ be a finite subset and define \[S(\sigma)=\sum_{(m,n)\in\sigma}(100-|m|-|n|) \] Find the maximum of $S$, taken over the set of all such subsets $\sigma$.

Given a finite collection of lines in a plane $P$, show that it is possible to draw an arbitrarily large circle in $P$ which does not meet any of them. On the other hand, show that it is possible to arrange a countable infinite sequence of lines (first line, second line, third line, etc.) in $P$ so that every circle in $P$ meets at least one of the lines. (A point is not considered to be a circle.)

Each row of a $24 \times 8$ table contains some permutation of the numbers $1, 2, \cdots , 8.$ In each column the numbers are multiplied. What is the minimum possible sum of all the products? [i](C. Wu)[/i]

assume that X is a set of n number.and $0\leq k\leq n$.the maximum number of permutation which acting on $X$ st every two of them have at least k component in common,is $a_{n,k}$.and the maximum nuber of permutation st every two of them have at most k component in common,is $b_{n,k}$. a)proeve that :$a_{n,k}\cdot b_{n,k-1}\leq n!$ b)assume that p is prime number,determine the exact value of $a_{p,2}$.

An international society has its members from six different countries. The list of members contain $1978$ names, numbered $1, 2, \dots, 1978$. Prove that there is at least one member whose number is the sum of the numbers of two members from his own country, or twice as large as the number of one member from his own country.

[u]Round 5[/u] [b]5.1.[/b] A triangle has lengths such that one side is $12$ less than the sum of the other two sides, the semi-perimeter of the triangle is $21$, and the largest and smallest sides have a difference of $2$. Find the area of this triangle. [b]5.2.[/b] A rhombus has side length $85$ and diagonals of integer lengths. What is the sum of all possible areas of the rhombus? [b]5.3.[/b] A drink from YAKSHAY’S SHAKE SHOP is served in a container that consists of a cup, shaped like an upside-down truncated cone, and a semi-spherical lid. The ratio of the radius of the bottom of the cup to the radius of the lid is $\frac23$ , the volume of the combined cup and lid is $296\pi$, and the height of the cup is half of the height of the entire drink container. What is the volume of the liquid in the cup if it is filled up to half of the height of the entire drink container? [u]Round 6[/u] [i]Each answer in the next set of three problems is required to solve a different problem within the same set. There is one correct solution to all three problems; however, you will receive points for any correct answer regardless whether other answers are correct.[/i] [b]6.1.[/b] Let the answer to problem $2$ be $b$. There are b people in a room, each of which is either a truth-teller or a liar. Person $1$ claims “Person $2$ is a liar,” Person $2$ claims “Person $3$ is a liar,” and so on until Person $b$ claims “Person $1$ is a liar.” How many people are truth-tellers? [b]6.2.[/b] Let the answer to problem $3$ be $c$. What is twice the area of a triangle with coordinates $(0, 0)$, $(c, 3)$ and $(7, c)$ ? [b]6.3.[/b] Let the answer to problem $ 1$ be $a$. Compute the smaller zero to the polynomial $x^2 - ax + 189$ which has $2$ integer roots. [u]Round 7[/u] [b]7.1. [/b]Sir Isaac Neeton is sitting under a kiwi tree when a kiwi falls on his head. He then discovers Neeton’s First Law of Kiwi Motion, which states: [i]Every minute, either $\left\lfloor \frac{1000}{d} \right\rfloor$ or $\left\lceil \frac{1000}{d} \right\rceil$ kiwis fall on Neeton’s head, where d is Neeton’s distance from the tree in centimeters.[/i] Over the next minute, $n$ kiwis fall on Neeton’s head. Let $S$ be the set of all possible values of Neeton’s distance from the tree. Let m and M be numbers such that $m < x < M$ for all elements $x$ in $S$. If the least possible value of $M - m$ is $\frac{2000}{16899}$ centimeters, what is the value of $n$? Note that $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$, and $\lceil x \rceil$ is the least integer greater than or equal to $x$. [b]7.2.[/b] Nithin is playing chess. If one queen is randomly placed on an $ 8 \times 8$ chessboard, what is the expected number of squares that will be attacked including the square that the queen is placed on? (A square is under attack if the queen can legally move there in one move, and a queen can legally move any number of squares diagonally, horizontally or vertically.) [b]7.3.[/b] Nithin is writing binary strings, where each character is either a $0$ or a $1$. How many binary strings of length $12$ can he write down such that $0000$ and $1111$ do not appear? [u]Round 8[/u] [b]8.[/b] What is the period of the fraction $1/2018$? (The period of a fraction is the length of the repeated portion of its decimal representation.) Your answer will be scored according to the following formula, where $X$ is the correct answer and $I$ is your input. $$max \left\{ 0, \left\lceil min \left\{13 - \frac{|I-X|}{0.1 |I|}, 13 - \frac{|I-X|}{0.1 |I-2X|} \right\} \right\rceil \right\}$$ PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h2765571p24215461]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Through the points with integer coordinates in the right-angled coordinate system $Oxyz$ are constructed planes, parallel to the coordinate planes and in this way the space is divided to unit cubes. Find all triples ($a, b, c$) consisting of natural numbers ($a \le b \le c$) for which the cubes formed can be coloured in $abc$ colors in such a way that every palellepiped with dimensions $a \times  b \times c$, having vertices with integer coordinates and sides parallel to the coordinate axis doesn't contain unit cubes in the same color.

Every square of a $2020 \times 2020$ chess table is painted in red or white. For every two columns and two rows, at least two of the intersection squares satisfies that they are in the same column or row and they are painted in the same color. Find the least value of number of columns and rows that are completely painted in one color.

Let A be a subset of the set $\{1,2, ...,n\}$ with at least $100\sqrt n$ elements. Prove that there is a four-element arithmetic sequence in which each element is the sum of two different elements of the set A.

Denote by $g_n$ the number of connected graphs of degree $n$ whose vertices are labeled with numbers $1,2,...,n$. Prove that $g_n \ge (\frac{1}{2}).2^{\frac{n(n-1)}{2}}$. [b][u]Note[/u][/b]:If you prove that for $c < \frac{1}{2}$, $g_n \ge c.2^{\frac{n(n-1)}{2}}$, you will earn some point! [i]proposed by Seyed Reza Hosseini and Mohammad Amin Ghiasi[/i]

The cells of the $200 \times 200$ table are painted black and white so that there are $404$ more black cells than white ones. Prove that there is a $2 \times 2$ square in which the number of white cells is odd.

A rectangular array has 9 rows and 2004 columns. In the 9 * 2004 cells of the table we place the numbers from 1 to 2004, each 9 times. And we do this in such a way that two numbers, which stand in exactly the same column in and differ around at most by 3. Find the smallest possible sum of all numbers in the first row.

Standing in a circle are $99$ girls, each with a candy. In each move, each girl gives her candy to either neighbour. If a girl receives two candies in the same move, she eats one of them. What is the minimum number of moves after which only one candy remains?

Let $n>1$ be an integer. Suppose we are given $2n$ points in the plane such that no three of them are collinear. The points are to be labelled $A_1, A_2, \dots , A_{2n}$ in some order. We then consider the $2n$ angles $\angle A_1A_2A_3, \angle A_2A_3A_4, \dots , \angle A_{2n-2}A_{2n-1}A_{2n}, \angle A_{2n-1}A_{2n}A_1, \angle A_{2n}A_1A_2$. We measure each angle in the way that gives the smallest positive value (i.e. between $0^{\circ}$ and $180^{\circ}$). Prove that there exists an ordering of the given points such that the resulting $2n$ angles can be separated into two groups with the sum of one group of angles equal to the sum of the other group.

What is the largest possible number of vertices one can have in a graph that satisfies the following conditions: each vertex is connected to exactly $3$ other vertices, and there always exists a path of length less than or equal to $2$ between any two vertices?

A mathematical competition was attended by 120 participants from several contingents. At the closing ceremony, each participant gave 1 souvenir each to every other participants from the same contingent, and 1 souvenir to any person from every other contingents. It is known that there are 3840 souvenirs whom were exchanged. Find the maximum possible contingents such that the above condition still holds? [i]Raymond Christopher Sitorus, Singapore[/i]

Billy owns some really energetic horses. They are hopping around on points of the plane having two integer coordinates. Each horse can make the following types of jumps. They can hop to a point obtained from their current position via a translation by vector $(15, 9)$, $(-9, 15)$, $(-15,-9)$ or $(9,-15)$. The horses are now standing on lattice points such that no two can meet by making jumps as above. What is the maximal possible number of horses Billy can own?

In each square of a $4$ by $4$ grid, you put either a $+1$ or a $-1$. If any 2 rows and 2 columns are deleted, the sum of the remaining 4 numbers is nonnegative. What is the minimum number of $+1$'s needed to be placed to be able to satisfy the conditions

A [i]synogon [/i] is a convex $2n$-gon with all sides of the same length and all opposite sides are parallel. Show that every synogon can be broken down into a finite number of rhombuses.

A set of segments with the total length less than $1$ is given on a line. Prove that every set of $n$ points on the line can be translated by a vector of length not exceeding $n/2$, so that all the obtained points are away from the given segments.