anonymous
  • anonymous
ok guyz a friend of mine needs help with the code: see the attachment
Computer Science
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
schrodinger
  • schrodinger
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
anonymous
  • anonymous
@malihe i have put your code here
anonymous
  • anonymous
problem is basically as under: n are the cities of a country and we specify that,what the graph shows is the distance between cities and if it is -1 there is not straight path between 2 cities.in the first part they ask us to choose one or more cities ,that more cities have direct path with that,it prints city's number and number of roads that end to that city.
anonymous
  • anonymous
@farmdawgnation sir plz look in to the code cauz i m trying to help my friend @malihe she is new to the site the problem is bit tricky for me i hope you'll look into it thank you sire :)

Looking for something else?

Not the answer you are looking for? Search for more explanations.