////////////////////////////////////////////////////////////// //***************CHALLENGE:GRID WALKING********************** //****************Author: Petros Simidyan********************* ////////////////////////////////////////////////////////////// #include #include #include using namespace std; //little function for euclidian distance inline double euclidDist(int x, int y) { return pow(x*x + y*y, 0.5); } double resultCounter(const string & input) { int xCounter = 0, yCounter = 0; for (int i = 0; i < input.size(); i++) { switch (tolower(input[i])) { case 'n': xCounter++; break; case 's': xCounter--; break; case 'e': yCounter++; break; case 'w': yCounter--; break; default://ignoring all other charackters break; } } return euclidDist(xCounter, yCounter); } int main() { string input; double output; while (true) { cout << "Please give the string to indicate the path travelled!" << endl; getline(cin, input); output = resultCounter(input); cout << "The distance between the original and final position is: " << output << endl; } return 0; }