It seems like the individual flashes aren’t bright enough to navigate. However, you might have a better option: the flashes seem to be synchronizing!

In the example above, the first time all octopuses flash simultaneously is step 195:

After step 193:
5877777777
8877777777
7777777777
7777777777
7777777777
7777777777
7777777777
7777777777
7777777777
7777777777

After step 194:
6988888888
9988888888
8888888888
8888888888
8888888888
8888888888
8888888888
8888888888
8888888888
8888888888

After step 195:
0000000000
0000000000
0000000000
0000000000
0000000000
0000000000
0000000000
0000000000
0000000000
0000000000

Assignment

If you can calculate the exact moments when the octopuses will all flash simultaneously, you should be able to navigate through the cavern. What is the first step during which all octopuses flash? Determine this in the following way:

• Write a function steps that takes the pathname (char*) of a text file containing the energy level of each octopus in a 10 by 10 grid. The function must return the first step (int) during which all octopuses flash.

Example

In this interactive session we assume the text files octopuses01.txt¹ and octopuses02.txt² to be located in the current directory.

> steps("octopuses01.txt")
195
> steps("octopuses02.txt")
324

Epilogue

Alexandre Grison (@algrison³) animated his solution.