# Edsger Hates Getting Wet

Computer Science Level pending

Edsger Dogstra is playing soccer with his friends but someone kicked the ball far away. He has to get the ball, but the soccer field is full of puddles. He hates to step in the puddles, and wants to take the shortest distance where possible.

Help him find the number of different paths of minimum length to reach the ball, where he doesn't step in the puddles!

The soccer field is a $$25 \times 25$$ square grid, $$\boxed{\#}$$ characters are puddles and $$\boxed{.}$$ characters are free grass; Edsger starts in the upper left cell and the ball is in the lower right cell and he can only move on adjacent cells (not diagonally).

It is always possible reach the ball moving only right and down.

The soccer field.

×