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

CF1451D-Circle Game 题目: 题目描述: Utkarsh is forced to play yet another one of Ashish’s games. The game progresses turn by turn and as usual, Ashish moves first. Consider the 2D plane. There is a token which is initially at $ (0,0) $ . In one move a player must increase either the $ x $ coordinate or the $ y $ coordinate of the

CF1451C-String Equality 题目: 题目描述: Ashish has two strings $ a $ and $ b $ , each of length $ n $ , and an integer $ k $ . The strings only contain lowercase English letters. He wants to convert string $ a $ into string $ b $ by performing some (possibly zero) operations on $ a $ . In one move,