programing-puzzles/day3.py at master · Sebenicz/programing-puzzles · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
def check_square(pos):
    square = 1
    power = 1

    while power < pos:

        power = square**2
        square +=2

    square = (square // 2) - 1

    return square


def get_list_of_steps_in_square(square):
    steps = square * 2
    steps_list = []
    half_steps = square
    step = steps

    for i in range(steps):

        steps_list.append(step)

        if i < half_steps:
            step -= 1

        elif i >= half_steps:
            step += 1

    return steps_list


def get_steps(pos):
    sqr = check_square(pos)
    step_list = get_list_of_steps_in_square(sqr)
    highest_pos_from_lower_square = ((sqr*2) -1) ** 2
    step = pos - highest_pos_from_lower_square
    step = step % (sqr*2)

    return step_list[step]


def spiral_until_at_least(n):
    NEIGHBORS = [(1,0), (1,1), (0,1), (-1,1), (-1,0), (-1,-1), (0,-1), (1,-1)]
    DIRECTION = [(1,0), (0,1), (-1,0), (0,-1)]
    spiral = {}
    spiral[(0,0)] = 1
    x,y = 0,0
    steps_in_row = 1
    second_direction = False
    nstep = 0
    step_direction = 0

    while True:
        dx, dy = DIRECTION[step_direction]
        x, y = x + dx, y + dy
        total = 0

        for neighbor in NEIGHBORS:
            nx, ny = neighbor

            if (x+nx, y+ny) in spiral:
                total += spiral[(x+nx, y+ny)]

        if total > n:
            return total

        spiral[(x,y)] = total
        nstep += 1

        if nstep == steps_in_row:

            nstep = 0
            step_direction = (step_direction + 1)% 4

            if second_direction:

                second_direction = False
                steps_in_row += 1

            else:
                second_direction = True

def main():
    inp = int(input("Enter the position: "))
    print(get_steps(inp))
    print(spiral_until_at_least(inp))

if __name__ == '__main__':
    main()