left_right_2022

分类

题解(45)

/ 注册

全部文章（共13篇）

Codeforces 1519B.The Cake Is a Lie

题意：初始时在(1,1)，目标(n,m)位于(x,y)时，每一步只有两种情况：走到(x,y+1)，代价为x走到(x+1,y)，代价为y问从(1,1)到(n,m)能否花费代价恰好为k 只需判断n×m-1是否等于k大胆猜测小心使用不用证明其实我们发现，从(x,y)走到(x+1,y+1)只有两种走法，且代...

贪心数学

2021-04-30

0 842

ZZUACM 2021 省赛训练 1 F-Topforces Strikes Back

One important contest will take place on the most famous programming platform (Topforces) very soon!The authors have a pool of n problems and should c...

贪心数学

2021-04-23

0 482

ZZUACM 2021 省赛训练 1 D-Candy Box (easy version)

This problem is actually a subproblem of problem G from the same contest.There are n candies in a candy box. The type of the i-th candy is ai (1≤ai≤n)...

贪心

2021-04-23

0 419