# Answer to Question #38291 in C++ for Salman Rana

Question #38291

Problem:

A salesman travels from one to another state. he may visit either n=2,3,4,5 or 6 cities of punjab.

For every number of cities he may adopt different routes.

Some routes will be longer and other rwill be shorter.

We neeed to design a C++ Program.

*TO DISPLAY EACH ROUTE FOR PARTICULAR NUMBER OF CITIES "n".

*TO DISPLAY SHORTEST AND LONGEST ROUTE

Hint:

1:Develop a menu using switch

2: Enter tthe distance using two dimentional array.

I have made the switch menu but i dont know how to do it if anyone can help me out

A salesman travels from one to another state. he may visit either n=2,3,4,5 or 6 cities of punjab.

For every number of cities he may adopt different routes.

Some routes will be longer and other rwill be shorter.

We neeed to design a C++ Program.

*TO DISPLAY EACH ROUTE FOR PARTICULAR NUMBER OF CITIES "n".

*TO DISPLAY SHORTEST AND LONGEST ROUTE

Hint:

1:Develop a menu using switch

2: Enter tthe distance using two dimentional array.

I have made the switch menu but i dont know how to do it if anyone can help me out

Expert's answer

## Comments

## Leave a comment