https://www.gravatar.com/avatar/8f3abece0f8608ce4b9c1e3212fd1b72?s=240&d=mp

CF1451D-Circle Game

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

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,

CF1451B-Non-Substring Subsequence

CF1451B-Non-Substring Subsequence 题目: 题目描述: Hr0d1y has $ q $ queries on a binary string $ s $ of length $ n $ . A binary string is a string containing only characters ‘0’ and ‘1’. A query is described by a pair of integers $ l_i $ , $ r_i $ $ (1 \leq l_i \lt r_i \leq n) $ . For each query,

CF1451A-Subtract or Divide

CF1451A-Subtract or Divide 题目: 题目描述: Ridbit starts with an integer $ n $ . In one move, he can perform one of the following operations: divide $ n $ by one of its proper divisors, or subtract $ 1 $ from $ n $ if $ n $ is greater than $ 1 $ . A proper divisor is a divisor of a number,