Sponsored
Use these hints if you're stuck. Try solving on your own first.
There are n choices for when the first robot moves to the second row.
Can we use prefix sums to help solve this problem?
Solve with full IDE support and test cases
