OJ Board

Hey Dominik:

Regarding problem #10315-Poker Hands. Is this how you solve it, like you start off with "straight flush" and work your way through to "pair". In case of a tie or if none of these above work, you compare the card for the "high card".

I was wondering if there is any other way to solve ...

Lendlice,

The problem states..."differences between successive elements take on
ALL possible values between 1 thru N-1. For example,

1 4 2 3 is "Jolly" because it takes the differences {3,2,1} which satisfies all the values between N-1 (=3) through 1.

Therefore, you must keep track of ...

Thanks a lot La-Z-Boy. I should have paid attention to that clause. I got AC (finally).

I appreciate your help.

Shahid:

Do this trick: read the input with %s first and then do a %c. So you will only read the words and then in the second scanf u will read the white space or newline with the %c. This will reduce a lot of code as well.

Like this:

while(scanf("%s", word)==1)
{
scanf("%c", &ctrl ...

thanks LA-Z-Boy. That's what I have too. Just cant figure out why I am not getting AC. it seems like an easy problem to me...

can u please give me some test cases?

input: down
won

output: won or now ?

I am guessing it would be "now" since in the sample second test case ..

input: walking down
output: nw (and not wn)

I am just curious, for some reason I keep getting WA on this problem.