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

P2252-[SHOI2002]取石子游戏|【模板】威佐夫博弈 题目: 题目描述: 有两堆石子，数量任意，可以不同。游戏开始由两个人轮流取石子。游

P2197-【模板】nim游戏 题目: 题目描述: 甲，乙两个人玩 Nim 取石子游戏。 Nim 游戏的规则是这样的：地上有 $n$ 堆石子（每堆石子数量小于 $10^4$

CF1451E2-Bitwise Queries (Hard Version) 题目: 题目描述: The only difference between the easy and hard versions is the constraints on the number of queries. This is an interactive problem. Ridbit has a hidden array $ a $ of $ n $ integers which he wants Ashish to guess. Note that $ n $ is a power of two. Ashish is allowed to ask three different

CF1451E1-Bitwise Queries (Easy Version) 题目: 题目描述: The only difference between the easy and hard versions is the constraints on the number of queries. This is an interactive problem. Ridbit has a hidden array $ a $ of $ n $ integers which he wants Ashish to guess. Note that $ n $ is a power of two. Ashish is allowed to ask three different