//////////////////////////////////////////////////////////////// ////**************CHALLENGE:Finger Counting *************** ////****************Author: Petros Simidyan**************** //***************** // #include #include #include using namespace std; #define CLEAR cin.clear(); cin.ignore(1000, '\n'); bool isLeft = 1, isDown = 0; //vector with the names of fingers vector hand = { "Thumb", "Index", "Middle", "Ring", "Baby" }; typedef unsigned long ulong; //the recursive methode tests all cases for the finger counting //and return index of vector Hand int recSolution(const ulong count, bool& isLeft, bool& isDown) { //are we searching on left hand, upward? if (count > 5 && isLeft && !isDown) { isLeft = 0; return recSolution(count - 5, isLeft, isDown); } //are we searching on right hand, upward? if (count > 5 && !isLeft && !isDown) { isDown = 1; return recSolution(count - 5, isLeft, isDown); } if (count > 4 && !isLeft&&isDown) { isLeft = 1; return recSolution(count - 4, isLeft, isDown); } if (count > 4 && isLeft&&isDown) { isDown = 0; return recSolution(count - 4, isLeft, isDown); } if (!isDown&&count <= 5) return count; if (isDown&&count <= 4) return 5 - count; } void printSolution(const ulong input) { int i = recSolution(input, isLeft, isDown); cout << hand[i - 1] << " finger "; if (isLeft) cout << "(Left)" << endl; else cout << "(Right)" << endl; } int main() { ulong input; while (true) { cout << "Please give a positiv integer number:" << endl; //making sure, that the input is positiv if (cin.peek() == '-') { cout << "The given integers should be positiv!" << endl; CLEAR } else { cin >> input; //checking, that the input is an integer if (cin.fail()) { cout << "Wrong input!" << endl; cout << "Your input is not an integer!" << endl; CLEAR } else printSolution(input); } } return 0; }