This project is the same as Programming Project 13, except that in this project your program will use a more sophisticated method for choosing die answer to a question. When your program reads a question, it counts the number of characters in die question and stores the number in a variable named count. It then responds with answer number count % ANSWERS. The first answer in the file is answer number 0, the next is answer number 1, then 2, and so forth. ANSWERS is defined in a constant declaration, as shown next, so that it is equal to die number of answers in the answer file:
const int ANSWERS = 8;
This way you can change the answer file so that it contains more or fewer answers and you need change only the constant declaration to make your program work correctly for a different number of possible answers. Assume that the answer listed first in die file will always be the following, even if the answer file is changed:
I’m not sure, but I think you will find the answer in Chapter #N.
When replacing the two characters #N with a number, use the number (count % NUMBER_OF_CHAPTERS + 1), where count is the variable discussed above, and NUMBER_OF_CHAPTERS is a global named constant defined to be equal to the number of chapters in this book.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.