![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
暴力
sigh_
这个作者很懒,什么都没留下…
展开
-
HDU_6274 Master of Sequence(二分)
Master of Sequence Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description There are two sequencesa1,a2,⋅⋅⋅,ana_1, a_2, · · · , a_na1,a2,⋅⋅⋅,an, b1,b2,⋅⋅⋅,bnb_1, b_2, · · · , b_nb1,b2,⋅⋅⋅,bn. Let S(t原创 2020-10-21 21:56:44 · 80 阅读 · 0 评论 -
CodeForces_1375E Sum of Digits(暴力+贪心)
Sum of Digits time limit per test:2 seconds memory limit per test:512 megabytes Problem Description Let f(x)f(x)f(x) be the sum of digits of a decimal number x. Find the smallest non-negative integer xxx such that f(x)+f(x+1)+⋯+f(x+k)=nf(x)+f(x+1)+⋯+f(x+k)原创 2020-07-06 21:44:48 · 313 阅读 · 0 评论 -
CodeForces_1360H Binary Median(数论+暴力)
Binary Median time limit per test:2 seconds memory limit per test:256 megabytes Problem Description Consider all binary strings of length mmm (1≤m≤601≤m≤601≤m≤60). A binary string is a string that consists of the characters 0 and 1 only. For example, 0110原创 2020-05-25 17:00:51 · 450 阅读 · 0 评论