DIV-3 G Can be solved if n <= 1e5?
Difference between en1 and en2, changed 50 character(s)
I am intrested in solution if n <= 1e5 and m <= 1e5n &mdash; 1 <= m <= max((n-1) * n / 2 , 1e5) and k <= 1000. Is it exist or NP-hard? Thanks↵
↵
↵
https://codeforces.me/contest/1433/problem/G

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en5 English Stimsly 2021-09-13 21:08:51 25 Tiny change: 'k <= 1000. Is it exist or NP-hard? Thanks\n\n' -> 'k <= 1000.Thanks\n\n'
en4 English Stimsly 2020-10-23 16:32:12 81
en3 English Stimsly 2020-10-23 15:55:31 4 Tiny change: ' <= m <= max((n-1) * n' -> ' <= m <= min((n-1) * n'
en2 English Stimsly 2020-10-23 15:48:01 50
en1 English Stimsly 2020-10-23 15:23:00 168 Initial revision (published)