# i need help

• ### Question

• Armenian schoolchildren have created a robot that moves along the top of the rectangular network of nxm sizes. At the same time it can move,

right
top
up-right
Your task is to find the number of possible roads that will reach the point (n, m) of the robot (0,0).

Input Details:

The n and m are the natural numbers

Exit data

The number of roads that should not exceed 10^18 should be deducted.

Examples.
Friday, April 6, 2018 9:35 AM

### All replies

• Take paper and pencil.

Start by drawing a small network like 3x2, 4x3 or 5x3.

Then answer these three questions first: How many steps has the shortest way? How many the longest? How many of those ways exist?

You can get these by simple drawing them.

Friday, April 6, 2018 10:03 AM
• First, if you want help from the specialists most likely to help then you must write a subject (title) that helps the specialists to decide to look at your question .Saying things like "i need help" will not help you to get good answers.

Next, don't ask for a solution for a total program; you need to do as much as you can and then ask for help about details. This post does not even ask a question.

For this problem, start by selecting an algorithm; something such as is described in the following:

Then try to implement one of the algorithms. When you need help ask a question about something specific.

Sam Hobbs
SimpleSamples.Info

Friday, April 6, 2018 7:22 PM
• Hi tiran,