- Strength to Increase Rep
- +0
- Strength to Decrease Rep
- -0
- Upvotes Received
- 1
- Posts with Upvotes
- 1
- Upvoting Members
- 1
- Downvotes Received
- 0
- Posts with Downvotes
- 0
- Downvoting Members
- 0
4 Posted Topics
 | Re: Reverse Digits What does this do? [QUOTE]num=GetInteger();[/QUOTE] you would need a scanf here...  |
| | The above is undefined behavior in C?C++ [URL="https://www.securecoding.cert.org/confluence/display/cplusplus/EXP34-C.+Do+not+depend+on+order+of+evaluation+between+sequence+points"]https://www.securecoding.cert.org/confluence/display/cplusplus/EXP34-C.+Do+not+depend+on+order+of+evaluation+between+sequence+points[/URL] This code in Java & C# is defined, I would be: [code]int i,j=4; i=j++*++j*j--;[/code] i = 4(5) *(6)6 * 6(5) = 144- Which is what I got when running the program in Java...  |
| | Wanted to verify that this actually does check for all wins- if so I need to a statement that a tie does still exist and where to add it...Opinions and suggestions please.. method displayHandName() writes out the hand found. [CODE] public static void determineWinner(int[] finalHands, int[][] hands) throws IOException { … |
| | I have a program evaluating a straight hand in poker: Here is my code: [code=cplusplus] int numInRank[14]; cin.get(rankCh); switch (toupper(rankCh)) { case '-1': exit(0); case '?': rank = 0; break; case 'A': rank = 1; break; case '2': rank = 2; break; case '3': rank = 3; break; case '4': … |
The End.