龍木

分类

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篇）

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-09-15

0 509

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-09-15

0 481

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-09-15

0 413

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-09-15

0 0

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-09-15

0 525

B. Nastya and Door

链接：https://codeforces.ml/contest/1341/problem/B On February 14, Denis decided to give a Valentine to Nastya and did not come up with anything better ...

2020-09-15

0 914

C. Nastya and Strange Generator

链接：https://codeforces.ml/contest/1341/problem/C Being upset after this behavior of Nastya, Denis was very sad. Nothing could make the rejected guy ha...

2020-09-15

0 583

D. Nastya and Scoreboard

链接：https://codeforces.ml/contest/1341/problem/C Denis, who managed to buy flowers and sweets (you will learn about this story in the next task), went...

2020-09-15

0 366

C 答题卡

牛牛即将要参加考试，他学会了填答题卡。可惜他竖着的答题卡填成了横着的 : ( 好奇的他想知道对于 n 道题，每道题 n 个选项的答题卡 ( n * n 的矩阵 )，满足横答题卡和竖答题卡图形一致的方案数有多少种。注：每道题只能选择一个选项，即 n * n 的矩阵中只能涂黑 n 个空...

2020-09-15

0 426

A 像鱼

给你一个边长为 n 的用硬币摆成的实心三角形，请问把他倒过来最少需要多少步？例子：这是一个边长为3的硬币三角形只要移动边上的两个硬币，就可以把它到过来（注意是倒过来，不是旋转角度），变成这样：聪明的 Prev1ous秒切了这道题，于是他希望来考考你 Prev1ous 经过计...

2020-09-15

0 423