First clear solution for Toothpicks by kazuki.h - python coding challenges

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

First solution in Clear category for Toothpicks by kazuki.h

def toothpicks(step):
    result, edges, points, switch = 1, {(1, 0), (-1, 0)}, {(0, 0)}, False
    
    while step > 1:
        points |= edges
        new_edges, discard_edges = set(), set()
        
        for (px, py) in edges:
            for q in [(px+switch, py+(not switch)), (px-switch, py-(not switch))]:
                if q in points: pass
                elif q in new_edges: discard_edges.add(q)
                else: new_edges.add(q) 
        
        new_edges -= discard_edges
            
        step -= 1
        result += len(edges)
        edges = new_edges
        points |= discard_edges 
        switch = not switch
        
    return result

March 28, 2023

Comments:

kazuki.h on March 28, 2023, 7:57 a.m.
<p>I wanted to write the program recursively, but for some reason the variables were initialized each time, so I could not.</p>

List, list and list again

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.