Question

ok guyz a friend of mine needs help with the code: see the attachment

Answer 1

@malihe i have put your code here

Answer 2

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.

Answer 3

@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 :)