随笔分类 -  codeforces

摘要:Codeforces Round #638 (Div. 2) B. Phoenix and Beauty 正确解法: n个数分别为ai,往里面任意加数(正数)使连续k个字串的和都相同。 如果n个数里面出现数的次数大于k,那么就不能成立。 如果n个数里面出现的数等于k,把这些数按一定顺序输出n次就可。 阅读全文
posted @ 2020-05-23 17:30 kaike 阅读(190) 评论(0) 推荐(0) 编辑
摘要:E. Restorer Distance Description You have to restore the wall. The wall consists of NN pillars of bricks, the height of the ii-th pillar is initially 阅读全文
posted @ 2020-05-19 18:56 kaike 阅读(344) 评论(0) 推荐(0) 编辑
摘要:Educational Codeforces Round 5 D. Longest k-Good Segment Description The array a with n integers is given. Let's call the sequence of one or more cons 阅读全文
posted @ 2019-07-04 10:00 kaike 阅读(182) 评论(0) 推荐(0) 编辑
摘要:E. Two Teams Description There are 𝑛n students standing in a row. Two coaches are forming two teams — the first coach chooses the first team and the 阅读全文
posted @ 2019-04-20 15:06 kaike 阅读(209) 评论(0) 推荐(0) 编辑
摘要:C. Serval and Parenthesis Sequence Description Serval soon said goodbye to Japari kindergarten, and began his life in Japari Primary School. In his fa 阅读全文
posted @ 2019-04-19 17:04 kaike 阅读(220) 评论(0) 推荐(0) 编辑
摘要:Codeforces Round #550 (Div. 3) D. Equalize Them All Description You are given an array aa consisting of nn integers. You can perform the following ope 阅读全文
posted @ 2019-04-16 12:01 kaike 阅读(384) 评论(2) 推荐(0) 编辑
摘要:A. Game 23 Description Polycarp plays "Game 23". Initially he has a number 𝑛n and his goal is to transform it to 𝑚m. In one move, he can multiply 𝑛 阅读全文
posted @ 2019-03-21 17:20 kaike 阅读(434) 评论(0) 推荐(0) 编辑
摘要:A. Vova and Train Description Vova plans to go to the conference by train. Initially, the train is at the point 11 and the destination point of the pa 阅读全文
posted @ 2019-03-20 12:13 kaike 阅读(429) 评论(0) 推荐(0) 编辑
摘要:Codeforces Round #531 (Div. 3) B. Array K-Coloring Description You are given an array aa consisting of nn integer numbers. You have to color this arra 阅读全文
posted @ 2019-01-12 12:41 kaike 阅读(437) 评论(0) 推荐(0) 编辑
摘要:[CF]Codeforces Round #529 (Div. 3) C. Powers Of Two Description A positive integer xx is called a power of two if it can be represented as x=2yx=2y, w 阅读全文
posted @ 2018-12-28 15:34 kaike 阅读(526) 评论(0) 推荐(0) 编辑
摘要:第一次这么晚呀,从晚上十点半开始打,打到凌晨一点回寝,被自己感动到了QAQ 虽然只写了两道水题呵呵哒,要补题,要写DP,要写搜索。 C. Prefixes and Suffixes Description Ivan wants to play a game with you. He picked s 阅读全文
posted @ 2018-12-19 17:02 kaike 阅读(443) 评论(1) 推荐(0) 编辑
摘要:第一次参加cf比赛,水了一发写了三道水题实在不想写了,然后Rating就低了,好难过哈哈哈哈。 cf#521(div.3) D:Cutting Out Description You are given an array ss consisting of nn integers. You have 阅读全文
posted @ 2018-11-17 21:21 kaike 阅读(310) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示