//fill in gaps thanks //should work for even and odd number of rings #include #include using namespace std; int main() { vector t[3]; int n; cout << "Please enter the number of rings to move: "; cin >> n; cout << endl; // The initial value of to depends on whether n is odd or even int from = 0, to = _____, candidate = 1, move = 0; // Initialize the towers for(int i = n + 1; i >= 1; --i) t[0].push_back(i); t[1].push_back(n+1); t[2].push_back(n+1); while (t[1].size() < n+1) { // while t[1] does not contain all of the rings cout << "Move #" << ++move << ": Transfer ring " << candidate << " from tower " << char(from+'A') << " to tower " << char(to+'A') << " "; // Move the ring from the "from tower" to the "to tower" (first copy it, then delete it from the "from tower") _____ _____ // from = the index of the tower with the smallest ring that has not just been moved: (to+1)%3 or (to+2)%3 if (_____) from = _____ else from = _____ // candidate = the ring on top of the t[from] tower candidate = _____ // to = the index of the closest tower on which the candidate can be placed: (from+1)%3 or (from+2)%3 // (compare the candidate with the ring on the closer tower; which tower is "closer" depends on whether n is odd or even) if (_____) to = _____ else to = _____ } return 0; }