![](https://img-blog.csdnimg.cn/20201014180756918.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
构造
文章平均质量分 73
构造
to cling
Everything negative - pressure, challenges - is all an opportunity for me to rise.
展开
-
C. Subsequence Counting(构造)
Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)题意构造一个序列,其子序列中满足max−min>=dmax - min >= dmax−min>=d的数量为x。思路Let’s call a subsequence valid if the difference of maximum element and minimum element is less than d. ~原创 2021-10-13 15:33:16 · 246 阅读 · 0 评论 -
C. Carrying Conundrum(找规律)
Codeforces Round #742 (Div. 2)题意正常的加法竖式运算,现在出错了,按照出错的方式,给你一个结果n,找出满足题意的非负整数对的数量。下面为出错方式:正确方式:出错方式:(满10进1时,应该进位1,但是错误的进位了2位)思路:考虑n=12345。我们把它拆成交替的数字。12‾34‾5→135,241\underline{2}3\underline{4}5 \rightarrow135,2412345→135,24. 现在的问题相当于找到加起来是135的一对数原创 2021-09-27 11:52:17 · 227 阅读 · 0 评论 -
E - Arithmetic Number(构造)
AtCoder Beginner Contest 234题意输入一个整数n(n≤1e17n \leq1e17n≤1e17)。输出一个满足如下条件的最小的整数。任意相邻的位差值相等例如:234,369,86420,17,95,8,11,777如下不满足:751,919,2022,246810,2356set<ll> ans;void gouzao(){ for (int fi = 1; fi <= 9; fi++)//首位 for (int d = -9; d &l原创 2022-01-09 00:30:52 · 417 阅读 · 0 评论