题意：一个n个数码位的分数板，每一个数码位都是一个七段数码管，现在给出每个数码位的显示情况，问再点亮k段数码管的话能显示的最大的数是多少，如果不能构成一串数字，就输出 . 答案允许有前导 ，但是有前导 的时候答案长度必须要跟n一致 原题链接：https: codeforces.ml contest problem D 开始感觉是贪心去爆搜，但是显然这会T，所以想了几分钟后就果断放弃了爆搜的想法。后 ...
2020-04-24 11:48 0 625 推荐指数：
D. Nezzar and Board https://codeforces.com/contest/1478/problem/D 题解 题意为给出一个序列xi，你可以任意挑选两个数x，y将2·x-y加入序列中，询问在是否可以在序列中发现数k。 假设我们任意挑选4个数：x，y，p，q ...
D. Yet Another Monster Killing Problem You play a computer game. In this game, you lead a party of 𝑚 heroes, and you have to clear a dungeon ...
D. Irreducible Anagrams time limit per test2 seconds memory limit per test256 megabytes Let's call two strings s and t anagrams of each other ...
D. 1-2-K Game time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Alice and Bob play a game. ...
D. Secret Passwords One unknown hacker wants to get the admin's password of AtForces testing system, to get problems from the next contest. ...
Codeforces Round #599 (Div. 2) D. 0-1 MST Description Ujan has a lot of useless stuff in his drawers, a considerable part of which are his math ...
D. Mishka and Interesting sum 链接: http://codeforces.com/problemset/problem/703/D 题意： 给一个序列 每次询问一个区间 求区间中出现次数为偶数次的数的异或和 代码： ...
题目链接：https://codeforces.com/contest/1453/problem/D 思路 第一步，先推导1,0,0,……，0，就是1后面跟了n-1个0的时候 所需要的期望步数 封闭式推导 \(f_n\)代表从n关开始直接通关需要的步数的期望 n为1的情况，即就只有一个 ...
