http://git.tuvimen.i2p/aoc2024/tree/18/sol2.c
= 0 ) return 0 ; if ( x == mapmaxx -1 && y == mapmaxy -1 ) return 1 ; map [ x ][ y ] = 2 ; int pos [ 4 ][ 2 ] = { { x + 1 , y }, { x -1 , y }, { x , y -1 }, { x , y + 1 } }; for ( size_t i = 0 ; i < 4 ; i ++ ) * ( point * ) farray_inc ( points ) = ( point ){ pos [ i ][ 0 ], pos [ i ][ 1 ]}; return 0 ; } size_t findend () { size_t ret = 0 ; uchar found = 0 ; farray * p1 = farray_init ( sizeof ( point ), 1024 ), * p2 = farray_init ( sizeof (...