CF1463A-Dungeon 题目: 题目描述: You are playing a new computer game in which you have to fight monsters. In a dungeon you are trying to clear, you met three monsters; the first of them has $ a $ health points, the second has $ b $ health points, and the third has $ c $ . To kill the monsters, you can use a cannon

CF1455D-Sequence and Swaps 题目: 题目描述: You are given a sequence $ a $ consisting of $ n $ integers $ a_1, a_2, \dots, a_n $ , and an integer $ x $ . Your task is to make the sequence $ a $ sorted (it is considered sorted if the condition $ a_1 \le a_2 \le a_3 \le \dots \le a_n $ holds). To

CF1455C-Ping-pong 题目: 题目描述: Alice and Bob play ping-pong with simplified rules. During the game, the player serving the ball commences a play. The server strikes the ball then the receiver makes a return by hitting the ball back. Thereafter, the server and receiver must alternately make a return until one of them doesn’t make a return. The one who doesn’t make a return loses

CF1455B-Jumps 题目: 题目描述: You are standing on the $ \mathit{OX} $ -axis at point $ 0 $ and you want to move to an integer point $ x > 0 $ . You can make several jumps. Suppose you’re currently at point $ y $ ( $ y $ may be negative) and jump for the $ k $ -th time. You can: either

CF1455A-Strange Functions 题目: 题目描述: Let’s define a function $ f(x) $ ( $ x $ is a positive integer) as follows: write all digits of the decimal representation of $ x $ backwards, then get rid of the leading zeroes. For example, $ f(321) = 123 $ , $ f(120) = 21 $ , $ f(1000000) = 1 $ , $ f(111) = 111

CF757F-Team Rocket Rises Again 题目: 题目描述: It’s the turn of the year, so Bash wants to send presents to his friends. There are $ n $ cities in the Himalayan region and they are connected by $ m $ bidirectional roads. Bash is living in city $ s $ . Bash has exactly one friend in each of the other cities. Since Bash wants