龍木

codeforces

c#(1) 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)

/ 注册

全部文章 / codeforces （共130篇）

E. Tree Shuffling

链接：https://codeforces.ml/contest/1363/problem/E Ashish has a tree consisting of nn nodes numbered 11 to nn rooted at node 11. The ii-th node in the t...

2020-09-15

0 536

C. A Cookie for You

链接：https://codeforces.ml/contest/1371/problem/C Anna is a girl so brave that she is loved by everyone in the city and citizens love her cookies. She ...

2020-09-15

0 557

D. Grid-00100

链接：https://codeforces.ml/contest/1371/problem/D A mad scientist Dr.Jubal has made a competitive programming task. Try to solve it! You are given int...

2020-09-15

0 535

D. Zero Remainder Array

链接：https://codeforces.com/contest/1374/problem/D You are given an array aa consisting of nn positive integers. Initially, you have an integer x=0x=0...

2020-09-15

0 0

C. Pluses and Minuses

链接：https://codeforces.ml/contest/1373/problem/C You are given a string ss consisting only of characters + and -. You perform some process with this s...

2020-09-15

0 657

E. Maximum Subsequence Value

链接：https://codeforces.ml/contest/1365/problem/E Ridhiman challenged Ashish to find the maximum valued subsequence of an array aa of size nn consistin...

2020-09-15

0 489

D. Solve The Maze

链接：https://codeforces.ml/contest/1365/problem/D Vivek has encountered a problem. He has a maze that can be represented as an n×mn×m grid. Each of the...

2020-09-15

0 0

C. Rotation Matching

链接：https://codeforces.ml/contest/1365/problem/C After the mysterious disappearance of Ashish, his two favourite disciples Ishika and Hriday, were eac...

2020-09-15

0 586

C. Palindromic Paths

链接：https://codeforces.com/contest/1366/problem/C You are given a matrix with nn rows (numbered from 11 to nn) and mm columns (numbered from 11 to mm)...

2020-09-15

0 516

D. Two Divisors

链接：https://codeforces.com/contest/1366/problem/D You are given nn integers a1,a2,…,ana1,a2,…,an. For each aiai find its two divisors d1>1d1>1 ...

2020-09-15

0 369