原文:Codeforces Round #599 (Div. 2) D. 0-1 MST(bfs+set)

Codeforces Round Div. D. MST Description Ujan has a lot of useless stuff in his drawers, a considerable part of which are his math notebooks: it is time to sort them out. This time he found an old dus ...

2019-11-07 02:06 0 434 推荐指数:

查看详情

D. Nezzar and Board - Codeforces Round #698 (Div. 2)

D. Nezzar and Board https://codeforces.com/contest/1478/problem/D 题解 题意为给出一个序列xi,你可以任意挑选两个数x,y将2·x-y加入序列中,询问在是否可以在序列中发现数k。 假设我们任意挑选4个数:x,y,p,q ...

Fri Jan 29 19:55:00 CST 2021 2 454
Codeforces Round #637 (Div. 2) D. Nastya and Scoreboard

题意:一个n个数码位的分数板,每一个数码位都是一个七段数码管,现在给出每个数码位的显示情况,问再点亮k段数码管的话能显示的最大的数是多少,如果不能构成一串数字,就输出-1. 答案允许有前导0,但是有前导0的时候答案长度必须要跟n一致 原题链接:https://codeforces ...

Fri Apr 24 19:48:00 CST 2020 0 625
 
粤ICP备18138465号  © 2018-2025 CODEPRJ.COM