随笔分类 -  Codeforces

上一页 1 2
Educational Codeforces Round 84 (Rated for Div. 2)
摘要：Educational Codeforces Round 84 (Rated for Div. 2) 阅读全文
posted @ 2020-03-24 11:07 ~Lanly~ 阅读(309) 评论(0) 推荐(1) 编辑
Codeforces Round #618 (Div. 2)
摘要：Codeforces Round #618 (Div. 2) 阅读全文
posted @ 2020-02-10 18:43 ~Lanly~ 阅读(194) 评论(0) 推荐(0) 编辑
Educational Codeforces Round 76 (Rated for Div. 2)
摘要：Educational Codeforces Round 76 (Rated for Div. 2) 阅读全文
posted @ 2020-02-09 19:44 ~Lanly~ 阅读(151) 评论(0) 推荐(0) 编辑
Educational Codeforces Round 75 (Rated for Div. 2)
摘要：Educational Codeforces Round 75 (Rated for Div. 2) 阅读全文
posted @ 2020-02-06 21:13 ~Lanly~ 阅读(210) 评论(0) 推荐(1) 编辑
Codeforces Round #592 (Div. 2)
摘要：Codeforces Round #592 (Div. 2) 阅读全文
posted @ 2020-02-04 11:52 ~Lanly~ 阅读(222) 评论(0) 推荐(0) 编辑
Codeforces Round #616 (Div. 2)
摘要：Codeforces Round #616 (Div. 2) 阅读全文
posted @ 2020-02-03 22:27 ~Lanly~ 阅读(194) 评论(0) 推荐(0) 编辑
Educational Codeforces Round 74 (Rated for Div. 2)
摘要：Educational Codeforces Round 74 (Rated for Div. 2) 阅读全文
posted @ 2020-02-02 18:50 ~Lanly~ 阅读(198) 评论(0) 推荐(0) 编辑
Educational Codeforces Round 81 (Rated for Div. 2)
摘要：Educational Codeforces Round 81 (Rated for Div. 2) 阅读全文
posted @ 2020-01-30 15:43 ~Lanly~ 阅读(281) 评论(0) 推荐(1) 编辑
Educational Codeforces Round 80 (Rated for Div. 2)
摘要：Educational Codeforces Round 80 (Rated for Div. 2) 阅读全文
posted @ 2020-01-15 15:06 ~Lanly~ 阅读(263) 评论(0) 推荐(1) 编辑
Codeforces Round #613 (Div. 2)
摘要：Codeforces Round #613 (Div. 2) 阅读全文
posted @ 2020-01-11 20:53 ~Lanly~ 阅读(748) 评论(0) 推荐(3) 编辑
Codeforces Round #612 (Div. 2)
摘要：Codeforces Round #612 (Div. 2) 阅读全文
posted @ 2020-01-06 20:18 ~Lanly~ 阅读(492) 评论(0) 推荐(1) 编辑
Hello 2020
摘要：Hello 2020! 阅读全文
posted @ 2020-01-05 19:24 ~Lanly~ 阅读(298) 评论(0) 推荐(0) 编辑
Good Bye 2019
摘要：Good bye 2019. 阅读全文
posted @ 2019-12-30 21:27 ~Lanly~ 阅读(295) 评论(0) 推荐(2) 编辑
Educational Codeforces Round 79 (Rated for Div. 2)
摘要：A. New Year Garland (CF 1279 A) 题目大意 给定红绿蓝三种颜色灯的数量，问能否摆成一排，使得相邻颜色不相同。 解题思路 植树问题。考虑数量最多为n的颜色的灯俩俩不相邻，那么其他颜色的灯的数量和要大于n−1即可，大过n−1的灯直接插到里面就好了。 神奇的代码 阅读全文
posted @ 2019-12-30 20:21 ~Lanly~ 阅读(282) 评论(0) 推荐(0) 编辑
Educational Codeforces Round 78 (Rated for Div. 2)
摘要：Educational Codeforces Round 78 (Rated for Div. 2) 阅读全文
posted @ 2019-12-20 20:49 ~Lanly~ 阅读(490) 评论(4) 推荐(1) 编辑
Codeforces Round #606 (Div. 2, based on Technocup 2020 Elimination Round 4)
摘要：A. Happy Birthday, Polycarp! (CF 1277 A) 题目大意 问1到n中有多少个数是由一个数字组成的数 解题思路 很显然只有11,22,33,44,55,66等诸如此类的数，则一共有（位数-1）*9+首位-1+（n是否大于以首位数字构成，长度 阅读全文
posted @ 2019-12-14 23:21 ~Lanly~ 阅读(419) 评论(0) 推荐(1) 编辑

上一页 1 2
点击右上角即可分享
微信分享提示
🚀
回顶
➖
收起
  1. 1 404 not found REOL
404 not found - REOL
00:00 / 00:00
An audio error has occurred.