min :-D creative solution for The Greatest Common Divisor by StefanPochmann - python coding challenges

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

min :-D solution in Creative category for The Greatest Common Divisor by StefanPochmann

def greatest_common_divisor(*A):
    while len(A) > 1:
        m = min(A)
        A = {a%m or m for a in A}
    return m

April 15, 2015

Comments:

StefanPochmann on April 15, 2015, 5:21 p.m.
Inspired by <a href="http://www.checkio.org/mission/gcd/publications/coells/python-3/max/">coells' "max"</a>

tigerhu3180 on April 24, 2018, 5 p.m.
clear code

tigerhu3180 on April 24, 2018, 5:01 p.m.
so clear...

veky on Dec. 21, 2021, 3:17 a.m.
It's fascinating that A changes type from first iteration into the following ones, and nobody bats an eye. :-D A fine duck you have there. ;-)

StefanPochmann on Dec. 21, 2021, 10:04 p.m.
Ohhhh.... I just had two epiphanies. Been wondering about the "ducklings" in your not-yet-published solution. Just realized "duck typing" and "ugly duckling". Hope CheckO will publish it soon.

veky on Dec. 22, 2021, 11:28 a.m.
Ahhh... I should probably spell out my metaphors a bit more. :-)

StefanPochmann on Dec. 22, 2021, 11:34 a.m.
If the duck typing aspect is relevant in your code, maybe the code spells that out :-). Man, having to wait so long is annoying. The task page says "blocked for a day or two" and it's much longer.

veky on Dec. 22, 2021, 11:36 a.m.
Actually no, that's just connected to the uglyness of the numbers and the beauty of the solution. :-D The code is standard heapq-hesitancy, with just a bit of a twist in order to be interesting. :-]

StefanPochmann on Dec. 22, 2021, 11:43 a.m.
I'm looking forward to our beauty contest then. (Though my heap solution is based on someone else's, can't claim it for myself).

veky on Dec. 23, 2021, 5:35 a.m.
All the code in the Universe is based on someone else's. At some point you just stop being nervous about it. :-D

StefanPochmann on Dec. 23, 2021, 6:48 a.m.
Maybe. After recently watching <a href="https://www.youtube.com/watch?v=AiKCi5TLI9o">this documentary</a>, I'm not even sure I'd want to have a completely original idea.

veky on Dec. 23, 2021, 3:52 p.m.
That nondocumentary has a nice idea, though of course it isn't original. 😛

lxf42 on June 5, 2022, 4:39 p.m.
love this solution, at first I thought how does this work, it looked so unintuitive, but it's a great algorithm

Ice Base

0 %

PyCharm The Python IDE for Professional Developers. Enjoy productive Python, web and scientific development with PyCharm. Download it now!