14
Last seen 7 years ago
Member for 7 years, 4 months, 23 days
Difficulty Normal
An economist who wants to code.
First-makoto_yamagata
1
very nice!
now I understand how to factor EFFICIENTLY (comparing with my solution...)
thanks :)
More
nice, very short!
the only thing scratching my eyes is (k not in [grid[i/3*3][j/3*3], grid[i/3*3+1][j/3*3], grid[i/3*3+2][j/3*3], grid[i/3*3][j/3*3+1], grid[i/3*3+1][j/3*3+1], grid[i/3*3+2][j/3*3+1], grid[i/3*3][j/3*3+2], grid[i/3*3+1][j/3*3+2], grid[i/3*3+2][j/3*3+2]])
you could optimize this:
k n
More
very very nice!
it might me slower than long and boring code, but it looks very nice.
More
"Choose word order by flooding grid"
this was my idea, but I didn't know how to do this:)
I sorted by number of intersections instead.
More
my first idea was to re-determine % as, for example, && - but it was unnecessary =)
More
