Doubt in 1889B (Codeforces Round 906 Div 1.)
Difference between en1 and en2, changed 74 character(s)
Problem Statement: [this](https://mirror.codeforces.com/contest/1889/problem/B)↵
Is there a way to prove that if we are not able to connect the vertices to 1 in the greedy order that has been suggested, then there exists no other answer?↵
↵
Thanks.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English PimpedButterfly 2024-04-19 18:46:44 74
en1 English PimpedButterfly 2024-04-19 18:28:01 211 Initial revision (published)