Search:

Thanks for the help. It wasn't as hard as I thought it would be. ^^; I've been able to come up with the following so far:



// points.cpp
#include <iostream.h>

int main()
{
int p[6] =...

Yes, they can be. I thought about using an array and something with recursion, but I just can't figure it out. :o

How can I use C++ to solve the following problem?

List how many ways the numbers 9, 13, 17, 25, 31, and 35 can be added exactly 6 times to equal 100.