On a circle, n>1n > 1n>1 points are marked, called positions, dividing it into equal arcs. The positions are numbered clockwise from 0 to n−1n-1n−1. Vasya places a token on one of these positions. The following actions, called moves, are re…
Given a positive integer nnn, Sisyphus performs a series of operations on n+1n+1n+1 squares arranged in a row and numbered from 0,1,⋯ ,n0, 1, \cdots, n0,1,⋯,n. Initially, there are nnn stones in the square labeled 000 and no stones in th…
It is given sequence wih length of 201720172017 which consists of first 201720172017 positive integers in arbitrary order (every number occus exactly once). Let us consider a first term from sequence, let it be kkk . From given sequence we form a…
Elza draws 201320132013 cities on the map and connects some of them with NNN roads. Then Elza and Susy erase cities in turns until just two cities left (first city is to be erased by Elza). If these cities are connected with a road then Elza…
In the corner of a chessboard of size m×nm \times nm×n squares, there is a rook. Two players take turns moving it either vertically or horizontally by any number of squares; it is not allowed for the rook to land on or pass through a square…
After the long January holidays, 36 sad office workers decided to play ball on the first working day. The rules of the game are as follows: a sad worker who hits another sad worker with the ball becomes cheerful and no longer sad. The worke…
Vasya, Petya, and 2020 other people stood in a circle, with Vasya and Petya not standing next to each other. After that, Vasya chooses one of his two neighbors and "tags" them (taps them on the shoulder). Then Petya does the same, then agai…
Given nnn points in a circle, Arnaldo write 0 or 1 in all the points. Bernado can do a operation, he can chosse some point and change its number and the numbers of the points on the right and left side of it. Arnaldo wins if Bernado can´t…
(a) The numbers 1,2,4,8,16,32,64,1281 , 2, 4, 8, 1 6 , 32, 64, 1 281,2,4,8,16,32,64,128 are written on a blackboard. We are allowed to erase any two numbers and write their difference instead (this is always a non-negative number). After this procedure has been repeated seven…
In some cells of a 10×1010 \times 1010×10 board, there are fleas. Every minute, the fleas jump simultaneously to an adjacent cell (along the sides). Each flea jumps strictly in one of the four directions parallel to the sides of the board, mainta…
On the coordinate plane, points are marked: (1,1)(1,1)(1,1), (2,3)(2,3)(2,3), (4,5)(4,5)(4,5), (999,111)(999,111)(999,111). If the point (a,b)(a, b)(a,b) is marked, then points (b,a)(b, a)(b,a) and (a−b,a+b)(a-b, a+b)(a−b,a+b) can also be marked; if the points (a,b)(a, b)(a,b) and (c,d)(c, d)(c,d) are marked,…
Two girls, Ere and Odette, are playing a game using black and white pieces on a 3×33 \times 33×3 chessboard. The rules of the game are as follows: 1. They take turns placing a piece. 2. On each turn, a piece is placed on an empty square on the…
A grid strip of size 1×10000001 \times 10000001×1000000 is divided into 100 segments. An integer is written in each cell, and the numbers in cells lying within the same segment are the same. A token is placed in each cell. Then, an operation is performe…
In each cell of a strip of length 100 there is a chip. You can swap any two adjacent chips for 1 ruble, and you can also swap any two chips for free if there are exactly three chips between them. What is the minimum number of rubles needed…
Two players are playing a card game with a deck of nnn pairwise distinct cards. For any two cards in the deck, it is known which one beats the other (it is possible that AAA beats BBB, BBB beats CCC, and CCC beats AAA). The deck is distribu…
Mr. Ganzgenau wants to take his tea cup out of the microwave exactly at the front. However, his microwave is not that precise. The following game is played: Let nnn be a positive integer. In nnn seconds, the microwave's turntable…
There is a strip of graph paper with 15 cells, numbered 0,1,2,…,140,1,2, \ldots, 140,1,2,…,14. Two players take turns moving a token, which is on one of the cells, to the left by 1, 2, or 3 spaces. The player who has no moves loses. For which starting positi…
The integers 1 to 100 are randomly written in a 10×1010 \times 1010×10 grid, with one number in each cell. In each operation, two numbers can be swapped. Prove that, with only 35 operations, it is possible to achieve the following condition: the su…
On the central square of an 11×1111 \times 1111×11 board, there is a chip. Petya and Vasya are playing the following game. With each move, Petya moves the chip one square vertically or horizontally. With each of his moves, Vasya places a wall on on…
There are 2003 stones in a pile. Two players alternately select a positive divisor of the number of stones currently in the pile and remove that number of stones. The player who removes the last stone loses. Find a winning strategy for one…