UVa OJ Board

Actually it does. Maybe you missed it because it is stated at the last paragraph:

"If more than one order of brown, green, and clear bins yields the minimum number of movements then the alphabetically first string representing a minimal configuration should be printed."

I'm glad it helped

I thought that output should be the smallest lexicographically, so if there is 2 configuration ( e.g. : BGC and BCG yield the same size ), "BCG" should be printed ...

I hope it helps

I used my AC-ed source code to test data I generated randomly and I some differences. Looks like your answer is not minimal enough. I hope it helps. Input : 12848 19770 21137 28663 9067 27681 19994 1430 19738 21409 10918 28079 27748 18094 18605 25346 31081 14515 11339 25614 8929 29300 17281 1993 146...

I've passed all input from previous threads, so I'm wondering if anyone could help me ? thanks

hehehe .. I'm sorry for my laziness, but actually my point is having : r/P,o/G,y/S,g/A,b/N is the same as having : o/G,r/P,g/A,y/S,b/N As you can see above, the important thing is the couple x/y , where x is color of the bin, and y is type of the waste, thus, the position itself in the line doesn't ...

You program should consider that :

r/P,y/A
and
y/A,r/P

is the same configuration.

I hope it helps

Try this following input : r/P,o/G,y/S,g/A,b/N r/G,o/S,y/A,g/P,b/N r/G,o/S,y/A,g/P,b/N e # The correct one should produce : 2 while yours : 1 I guess you have missing the idea from the description : "From these data he wishes to determine the city whose allocation scheme (if imposed on the rest of t...

Try the following input:
r/G,o/P,y/S,g/A,b/N
r/P,o/S,y/G,g/A,b/N
r/G,o/P,y/S,g/A,b/N
e
#

your program produces :
3

the correct one should produces :
1

All the tricky input I know is that name should be read ( including space(s) ) until character '$'

hope it helps

I guess the problem is you send the problem as C source code.

In C, we can only declare variable on the top of scope A, so doing this :

for ( int i = 0 ; ... bla bla bla

would be illegal ..

hope it helps

I'm stuck on this problem.

Can somebody show me the output for this :
0
0
0 0 0

thank you

I am having problem on this and am looking for your help.

I couldn't figure out why for this input :

2 4 4 2 1 1 11 11

the output is :

T

because, as far as I know, the line would be inside the rectangle ... or have I made mistake somewhere?

thank you

Yes, please. I have several question : 1. Does a word in the dictionary can be used more than once to form an anagram ? e.g. : dictionary : A input : AA output : A A <-- is it possible ? 2. Is it possible to have 2 identic words in a dictionary ? e.g. : dictionary : A A BBB input : AA output : ???? ...

I got WA ... please help ...

any special case ?
Anybody can give me more sample input ?

thanks in advanced ...

For your convenience, I just paste my output here: Hand: TH KD AH JH QH Deck: 9H 8H 6C TC QC Best hand: straight-flush Hand: JS 7D 9S AS 7C Deck: TS 8S QS 2S 4D Best hand: straight-flush Hand: 2S 6S 3S AC 6H Deck: 5S 4S QS 7C TS Best hand: straight-flush Hand: 9C KH 6C JH 3C Deck: 2C 5C 4C AC 6D Bes...