lerping creative solution for Shooting Range by veky - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

lerping solution in Creative category for Shooting Range by veky

def shot(*a):
    A, B, C, D = (x + y * 1j for x, y in a)
    X, Y, Z = A - B, D - C, A - C
    j = lambda E, F: (E * F.conjugate()).imag
    n = j(X, Y)
    try:
        r = j(Z, Y) / n
        s = min(r, 1 - r)
        assert s >= 0 > j(Z, X) * n
        return round(200 * s)
    except (ZeroDivisionError, AssertionError):
        return -1

Aug. 28, 2014

Comments:

Sim0000 on Aug. 29, 2014, 3:07 a.m.
Complex!

nickie on Aug. 30, 2014, 7:13 p.m.
I think Sim000 meant that the solution is complex for Veky's standards... Definitely not for the rest of us. :-)

veky on Aug. 30, 2014, 10:56 p.m.
Actually, what I tried to achieve here is "complete factorization" of code: no step and no common subexpression is written twice, not even "return -1". :-) [If someone wants to nitpick about selective asserts, line 9 can be changed to "1 / (s >= 0 > j(Z, X) * n)". :-D] "Simplex" is a weak pun on the method used by the solution, where r is used as the parameter in parametrization of convex hull of two wall points. Solution can be viewed as considering the convex hull of three points (which would make it more nontrivially simplex-like), but then it would have two cases, and that's too complex. :-)

veky on Aug. 29, 2014, 3:47 a.m.
Simplex. ;-)

Ylliw on Feb. 8, 2019, 2:54 p.m.
nice

Blizzard

0 %

You ClassRoom Demo is Ready With the new tool CheckiO ClassRoom, you will be able to analyze your students' progress, have your own leaderboard, change missions order on the map, and so on.