鏈接: https: codeforces.com contest problem C 題意: You are an environmental activist at heart but the reality is harsh and you are just a cashier in a cinema. But you can still do something You have n ti ...
2019-10-07 13:29 0 385 推薦指數：
Codeforces Round #602 (Div. 2, based on Technocup 2020 Elimination Round 3) A. Math Problem 題意：有t組數據，每組數據給出n個范圍[Li,Ri]，求與n個范圍都有交集的最小范圍[Ans_L,Ans_R ...
A.Math Problem（CF 1262 A） 題目大意：給定n條線段，求一條線段，使得這個線段能夠跟所有給定的線段都相交（端點值一樣也算相交），最小化它的長度，可以是0. 很顯然找出這n條線 ...
Codeforces Round #692 (Div. 2, based on Technocup 2021 Elimination Round 3) 從傳智杯到牛客到cf, 一條龍, 腦子有點呆 A - In-game Chat B - Fair Numbers 1~9的公倍數 ...
一、整體流程 做了A和B。 大膽猜想，直接寫碼…… 二、具體題目 A. Windblume Ode (1)讀題 ①場上：從樣例解釋中發現，輸出時的順序無關緊要，換句話講，輸出1 2 3 ...
F2. Wrong Answer on test 233 (Hard Version) Your program fails again. This time it gets "Wrong answ ...
Codeforces Round #759 (Div. 2, based on Technocup 2022 Elimination Round 3) 個人題解 比賽鏈接：Codeforces Round #759 (Div. 2, based on Technocup 2022 ...
Great Graphs 題意 給你一個數組\(d\)，\(d[i]\)表示從節點\(1\)到其他各個節點的最短路的長度，然后你可以對這個圖進行加邊（可以是負邊），但不允許存在一個權值和為負數的回 ...
There is a river of width n">nn. The left bank of the river is cell 0">00 and the right bank is c ...
