1. for (i = 0 ; i < 4 ; i++) for (j = 0 ; j < 5 ; j++) values[i][j] = i + 1; 2. for (i = 0 ; i < 4 ; i++) for (j = 0 ; j < 5 ; j++) values[i][j] = i + j; 3. for (i = 0 ; i < 5 ; i++) for (j = 0 ; j < 5 ; j++) if (i == j) matrix[i][j] = 1; else matrix[i][j] = 0; 4. int isUpper(int matrix[][N], int size) { int i,j; int upper = 1; for (i = 0 ; i < size && upper; i++) for (j = 0 ; j < i ; j++) if (matrix[i][j] != 0) upper = 0; return upper; } 5. int distance[5][5] = {{0,171,115,141,240}, {171,0,103,194,333}, {115,103,0,120,235}, {141,194,120,0,104}, {240,333,235,104,0}}; 6. void getCities(int& first, int& second) { cout << "To determine the mileage between cities, enter the \n"; cout << "numbers of two cities from the following list:\n"; cout << " 1: Albany 4: NY\n"; cout << " 2: Boston 5: Phila\n"; cout << " 3: Hartford\n\n"; cout << "Enter your city numbers ==> "; cin >> first >> second; } 7. getCities(first,second); mileage = distance[first-1][second-1]; cout << "The distance between your two cities is " << mileage << endl;
Email Me |
Office Hours |
My Home Page |
Department Home |
MCC Home Page
© Copyright Emmi Schatz 2004