This should ask for print out the sum, not return it, right?
@Jestin, Yes, Corrected. Thanks!
Hi. Can you help me?
Look at my submission (number 1.).
For INPUT is shows OK, but for OTHER INPUT is shows incorrect.
@Lukas, the challenge now shows the complete I/O table so you can see what you got wrong.
thanks, I see it now.
I did think that I can turn 11 to 1 only one time.
Because there is written : "....you should "convert" ONE 11 to 1 and return a.....".
My english is not perfect.
I believe row 7 is incorrect:
11 11 2 11 11 4
How can the correct output be 20 if you are only allowed ONCE to change 11 to 1?
@David, as many 11's as necessary should be converted to 1's to prevent the sum from being exceeded.
In row 3, how can you change the 11 to 1 if you only know that the sum will exceed 21 after the next draw?
Does this means that you initially count it as an 11 but then, as 10 and 5 appear,
you come back and count it as a 1? I don't know the real rules of the game but sounds like cheating to me. :P
@Pierre, in this version of Blackjack, the Ace always has the optimal value, regardless of order (your program ensures this!)
I've come up with a solution that is incorrect when I run the code. However when I go into debug, the outputs are all correct. Could this be looked into please?
Your recent submission prints incorrect numbers such as 14 instead of 16 for the third case.
int  cards=new int;
cards[a]+=1;// might have to switch to +=a;
Can I get a hint to what I'm doing wrong with my code? Thanks
It looks like you're making it more complicated than necessary. To figure out the score, you just need the total sum and the number of elevens. You can then determine how many (If any) elevens
should be converted to ones. First make sure you can get the correct sum, and then work on adjusting the elevens.