Programming Project > Gymnasium Simnas - WRT 102 Gymnasium Simnas - WRT 102 Create s structure Train

downloaded from

Scholarfriends

https://scholarfriends.com Downloaded by: writerforacademic@gmail.com | https://scholarfriends.com/singlePaper/273163/programming-project-gymnasium-simnas-wrt102-gymnasium-simnas-wrt-102-create-s-structure-train Distribution of this document is illegal.

#1

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".

#include <iostream> #include <cstring> using namespace std;

struct Train { int ID; char *dest;

char *time; };

void toUppercase(char *str){ int n = strlen(str); for (int i = 0; i < n; i++) { str[i] = toupper(str[i]); } }

int findDestination(Train *tr, int n, char* key) { int ind = -1; for (int i = 0; i < n; i++) { if (strcmp(key, tr[i].dest) == 0){ ind = i; break; } } return ind; }

int main() { int n; cin >> n; Train *tr = new Train[n]; for (int i = 0; i < n; i++) { tr[i].dest = new char[15];

tr[i].time = new char[6]; cin >> tr[i].ID >> tr[i].dest >> tr[i].time; toUppercase(tr[i].dest); } char *x = new char[15]; cin >> x; toUppercase(x); int ind = findDestination(tr,n,x);

if (ind != -1) { cout << tr[ind].ID << "_" << tr[ind].dest << "_" << tr[ind].time << endl; } else { cout << "Impossible" << endl; } for (int i = 0; i < n; i++) { delete[] tr[i].dest; delete[] tr[i].time; } delete[] x; delete[] tr;

return 0; }