onlyblues

摘要： 求函数 题目描述 牛可乐有 $n$ 个一次函数，第 $i$ 个函数为 $f_i(x) = k_i \times x + b_i$。 牛可乐有 $m$ 次操作，每次操作为以下二者其一： $1$ $i$ $k$ $b$ 将 $f_i(x)$ 修改为 $f_i(x) = k \times x + b$。 阅读全文

摘要： F - Not Adjacent Problem Statement You are given a length-$N$ integer sequence $A=(A _ 1,A _ 2,\ldots,A _ N)$. There are $2 ^ N$ (not necessarily cont 阅读全文

摘要： F - Clearance Problem Statement AtCoder Inc.'s online shop currently handles $N$ products, and the stock of product $i$ is $A_i$ units remaining. Proc 阅读全文

摘要： E1. Prime Gaming (Easy Version) This is the easy version of the problem. The difference between the versions is that in this version, $m \le 2$. You c 阅读全文

摘要： D. A Cruel Segment's Thesis You are given $n$ segments on a number line. The $i$-th segment is represented as $[l_i, r_i]$. Initially, all the segment 阅读全文

摘要： Count Binary Palindromic Numbers You are given a non-negative integer n. A non-negative integer is called binary-palindromic if its binary representat 阅读全文

摘要： 牛牛的三角形 题目描述 从集合 $\{1, 2, \dots, n\}$ 中等概率地随机选取 $m$ 个不同的整数，使得在选出的这 $m$ 个数中，存在三个不同的数 $a, b, c$，满足以 $a, b, c$ 为边长可以构成一个非退化的三角形。 求解上述情况出现的概率。可以证明答案可以表示为一个 阅读全文

摘要： Minimum Operations to Equalize Binary String You are given a binary string s, and an integer k. In one operation, you must choose exactly k different  阅读全文

摘要： Two-Letter Card Game You are given a deck of cards represented by a string array cards, and each card displays two lowercase letters. You are also giv 阅读全文

摘要： F. Rada and the Chamomile Valley Yesterday, Rada found a portal that can transport her to the Chamomile Valley and back. Rada's happiness knew no boun 阅读全文