脂环 - 博客园

2020年7月20日

Codeforces Round #657 (Div. 2) C. Choosing flowers（贪心/前缀和/二分/枚举）

摘要： Vladimir would like to prepare a present for his wife: they have an anniversary! He decided to buy her exactly nn flowers. Vladimir went to a flower s 阅读全文

posted @ 2020-07-20 15:59 脂环阅读(270) 评论(0) 推荐(0) 编辑

Codeforces Round #657 (Div. 2) B. Dubious Cyrpto（暴力/数学）

摘要： Pasha loves to send strictly positive integers to his friends. Pasha cares about security, therefore when he wants to send an integer nn , he encrypts 阅读全文

posted @ 2020-07-20 00:23 脂环阅读(438) 评论(0) 推荐(1) 编辑

2020年7月19日

Codeforces Round #657 (Div. 2) A. Acacius and String（暴力）

摘要： Acacius is studying strings theory. Today he came with the following problem. You are given a string ss of length nn consisting of lowercase English l 阅读全文

posted @ 2020-07-19 21:07 脂环阅读(449) 评论(0) 推荐(0) 编辑

QT入门-QMainWindow类2

摘要： 1）添加工具栏：右键点击菜单栏下方选择AddToolBar，然后将最下方的那些QAction拖到相应位置即可。右键工具栏可以添加分隔符。 2）工具栏是可以上下左右停靠的。将其moveable属性取消勾选则变成不可移动的。allowedAreas为允许停靠的位置 3）浮动窗口对应控件的Dock 阅读全文

posted @ 2020-07-19 16:58 脂环阅读(212) 评论(0) 推荐(0) 编辑

Codeforces Round #656 (Div. 3) E. Directing Edges（拓扑排序）

摘要： You are given a graph consisting of nn vertices and mm edges. It is not guaranteed that the given graph is connected. Some edges are already directed 阅读全文

posted @ 2020-07-19 01:46 脂环阅读(403) 评论(2) 推荐(0) 编辑

2020年7月18日

Codeforces Round #656 (Div. 3) D. a-Good String（前缀和/递归）

摘要： You are given a string s[1…n]s[1…n] consisting of lowercase Latin letters. It is guaranteed that n=2kn=2k for some integer k≥0k≥0 . The string s[1…n]s 阅读全文

posted @ 2020-07-18 17:09 脂环阅读(384) 评论(0) 推荐(0) 编辑

Codeforces Round #656 (Div. 3) C. Make It Good

摘要： You are given an array aa consisting of nn integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from 阅读全文

posted @ 2020-07-18 16:59 脂环阅读(178) 评论(0) 推荐(0) 编辑

Codeforces Round #656 (Div. 3) B. Restore the Permutation by Merger

摘要： A permutation of length nn is a sequence of integers from 11 to nn of length nn containing each number exactly once. For example, [1][1] , [4,3,5,1,2] 阅读全文

posted @ 2020-07-18 16:48 脂环阅读(456) 评论(0) 推荐(0) 编辑

Codeforces Round #656 (Div. 3) A. Three Pairwise Maximums（思维/构造）

摘要： You are given three positive (i.e. strictly greater than zero) integers xx , yy and zz . Your task is to find positive integers aa , bb and cc such th 阅读全文

posted @ 2020-07-18 16:47 脂环阅读(505) 评论(0) 推荐(0) 编辑

EOJ Monthly 2020.7 A. 打字机（前缀和+思维）

摘要： Cuber QQ 长期在网络上与他人对线，一天，他发明了一台神奇的打字机。这台打字机只能处理由 a,b,X 构成的字符串。具体来说，打字机能够执行如下三种操作。 • 操作1：将任意一个 X 替换为 aX 。 • 操作2：将任意一个 X 替换为 aXbX 。 • 操作3：删除任意一个 X 。打字机启阅读全文

posted @ 2020-07-18 10:50 脂环阅读(200) 评论(0) 推荐(0) 编辑

Loading

脂环

公告