с++ есть 7 задач

Create s structure Train with the following fields:

  1.Number of the train(ID)

  2.Destination point(Location)

  3.Time of departure(Time)

Than try to find the if it's possible to go to the given destination location and output the time of departure.

Note: Pointer,dynamic and structures have to be used by default.

Input:

First line contains n(0 < n < 1001).

Then n lines inputed in given format:

  First - train's ID[int type]

  Second - destination address[char*]

  Third - departure time[char*]

Output:

Ouput the information in the following format ID_DESTINATION_TIME

It's guaranty that it will be only one train to the one city.

If there is no case to go by train output "Impossible".

первая задача