原文: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