Atcoder Beginner Contest 51 — B — Sum of Three Integers

Revision en1, by Mister_Rainbow, 2021-08-05 20:20:41

Hello everyone!

Today I was trying to solve ABC-51 Problem B. link to problem....

The editorial mentions a O(k^2) solution by looping through all possible values of x and y and figuring if a valid z exists for that x and y.

This solution had passed because the limits were not very tight. I was curious to know if there exists a faster way to solve this problem if the constraints are big!

Tags #abc, #help, #optimization


  Rev. Lang. By When Δ Comment
en1 English Mister_Rainbow 2021-08-05 20:20:41 526 Initial revision (published)