龍木

分类

c#(1) codeforces(130) dp(2) map(2) RMQ(1) 一些神奇的东西(1) 三分(1) 前缀和(1) 区间dp(1) 博弈(2) 大数(1) 平面几何(1) 并查集(1) 快数幂(1) 总结(1) 打表(1) 找规律(4) 数学(8) 暴力(1) 最小公约数(1) 最小生成树(1) 未归档(31) 杭电(4) 浅谈(8) 深度优先搜索(1) 牛客(10) 组合数(1) 网络流最大流(2) 题解(3)

/ 注册

全部文章（共613篇）

E. Count The Blocks

链接：https://codeforces.ml/contest/1327/problem/E You wrote down all integers from 00 to 10n−110n−1, padding them with leading zeroes so their lengths ...

2020-05-28

0 440

D. Carousel

链接：https://codeforces.ml/contest/1328/problem/D The round carousel consists of nn figures of animals. Figures are numbered from 11 to nn in order of ...

2020-05-28

0 479

B. Dreamoon Likes Permutations

链接:https://codeforces.ml/contest/1330/problem/B The sequence of mm integers is called the permutation if it contains all integers from 11 to mm exact...

2020-05-28

0 669

C. Dreamoon Likes Coloring

链接：https://codeforces.ml/contest/1330/problem/C Dreamoon likes coloring cells very much. There is a row of nn cells. Initially, all cells are empty ...

2020-05-28

0 713

F. Kate and imperfection

链接：https://codeforc.es/contest/1333/problem/F Kate has a set SS of nn integers {1,…,n}{1,…,n}. She thinks that imperfection of a subset M⊆SM⊆S is eq...

2020-05-28

0 398

D. Anti-Sudoku

链接：https://codeforces.ml/contest/1335/problem/D You are given a correct solution of the sudoku puzzle. If you don't know what is the sudoku, you can ...

2020-05-28

0 434

E1. Three Blocks Palindrome (easy version)

链接：https://codeforces.ml/contest/1335/problem/D The only difference between easy and hard versions is constraints. You are given a sequence aa consi...

2020-05-28

0 480

E2. Three Blocks Palindrome (hard version)

链接：https://codeforces.ml/contest/1335/problem/E2 The only difference between easy and hard versions is constraints. You are given a sequence aa cons...

2020-05-28

0 538

C. Linova and Kingdom

链接：https://codeforces.ml/contest/1337/problem/C Writing light novels is the most important thing in Linova's life. Last night, Linova dreamed about a...

2020-05-28

0 553

C2. Increasing Subsequence (hard version)

链接：https://codeforces.ml/contest/1157/problem/C2 The only difference between problems C1 and C2 is that all values in input of problem C1 are distinc...

2020-05-28

0 505