Hello everyone, is there anyone who can help me with my homework??
Please help me, thanks...
Problem 109 - Project Euler
Hello everyone, is there anyone who can help me with my homework??
Please help me, thanks...
Problem 109 - Project Euler
What have you tried and what help do you need?
Look up a C++ Reference and learn How To Ask Questions The Smart WayOriginally Posted by Bjarne Stroustrup (2000-10-14)
actually, I am junior developer. This is my first year at programming and university. So, I didn't understand how to set up an algorithm and how to solve this problem. Our teacher gave us this problem as a final project.
Question about the problem.
I am guessing they want the sums of the number of ways to checkout from 99 to 1, correct?
Tim S.
"...a computer is a stupid machine with the ability to do incredibly smart things, while computer programmers are smart people with the ability to do incredibly stupid things. They are,in short, a perfect match.." Bill Bryson
This is a final project?!
end of term project. 15% effect on our grade point average.
How many distinct ways can a player checkout with a score less than 100?
Well... 38182
yes it is. how can i reach the answer?
Write a program to calculate it
I just figure out they want the number of possible values of the last three darts.
This is a much different problem then I thought it could be.
Tim S.
"...a computer is a stupid machine with the ability to do incredibly smart things, while computer programmers are smart people with the ability to do incredibly stupid things. They are,in short, a perfect match.." Bill Bryson
I'd start by counting out the possible add-on dart positions to a bullseye and set up formula using multiplication and/or power of said count, then I would do similar for the other reds and finally add them together, after that I would probably start looking for holes in my data and/or formula that would lead to an inaccurate result as the start is after all just rough math. Remember that red indicates double so at least one of the darts would have to land on red at the end, the rest can be either single or double so the count of positions will be multiplied against itself to get the initial count for bullseye and then once again for every other red, then the previous result would be added on to give a ballpark count of how many distinct ways a player can end on a double with less than 100 points, the only positions you need to really pay attention to is the inner 2, the rest won't bring the score to 100 or above
Edit: Don't forget that outside the rings also counts as a position, just has the value 0
