a salesman travel from sindth to punjab province. He may visit either n=2,3,4,5 or 6 cities of punjab. For every number of cities n he may adopt different roots.
Some roots will be longer and other shorter. Develop a Cpp program.
aroshkhan 0 Newbie Poster
richieking 44 Master Poster
aroshkhan 0 Newbie Poster
aroshkhan 0 Newbie Poster
Ancient Dragon 5,243 Achieved Level 70 Team Colleague Featured Poster
aroshkhan 0 Newbie Poster
Schol-R-LEA 1,446 Commie Mutant Traitor Featured Poster
aroshkhan commented: haha great (Y) +0
aroshkhan 0 Newbie Poster
aroshkhan 0 Newbie Poster
Ancient Dragon 5,243 Achieved Level 70 Team Colleague Featured Poster
aroshkhan 0 Newbie Poster
ddanbe 2,724 Professional Procrastinator Featured Poster
Ancient Dragon 5,243 Achieved Level 70 Team Colleague Featured Poster
aroshkhan 0 Newbie Poster
Ancient Dragon 5,243 Achieved Level 70 Team Colleague Featured Poster
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.