OJ Board

Thanks shuniu. I tried your input and as far as I can tell it's the same as your output. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 2700 3127 200 300 400 500 600 700 800 900 1000 1100 1200 1300 1400 1500 1600 1700 1800 1900 2000 2100 2200 2300 2400 2500 2600 2700 2...

Thanks

I'll try putting in newlines.

*echoes*

OK, this problem is driving me crazy. As far as I can see my program gives the correct answer for every test case I can think of but the judge gives me WA EVERY time. Here's my output for some input 4 10 10 48 39 30 =A1+A2+A3 99 33 39 =A5+A6+A7 =A4+A8 =A9 75 77 39 =B1+B2+B3 33 42 45 =B5+B6+B7 =B4+B8...

I assume that in this case the ID means 'iterative deepening'. Firstly, a 'depth bounded' dfs only searches to a particular depth. Iterative deepening involves successive calls to a depth bounded dfs with a larger bound each time. Like breath first search (and unlike ordinary dfs) it'll find the sha...

Wow!

Thanks alot for the many helpful replies. Also thanks gvcormac for the 'dividing coins' pseudocode. These problems are easily stated but surprisingly difficult to solve in time without a good algorithm. Often, it is easy to see where dp might apply but not so easy to actually follow through.

Problems that ask you to partition a set into two mutually disjoint subsets such that the difference between the cumulative weights of the items in each subset is as small as possible. I have an idea of what ought to be done but I can never convince myself of the DP formulation. Examples are: 10032 ...

Thanks alot for the information!

I'm confused about the source of the problems. Are the volume C problems the only non-acm (regional or finals) past problems?

Does your program have any problems with the following: 1) Extra spaces between words 2) Extra spaces at the END of the sentence (before the period) 3) Extra spaces at the START of the sentence 4) Extra letters AFTER the period 5) Extra spaces AFTER the period etc. No 4. will trick my program. Howe...

I suspect there are such cases. Let me explain why. The test for predicates is the most complicated so in my first attempt I simply tested for MOD, A, BA, DA, LA, and NAM then I assumed PREDA if it was none of the above. That is reasonable if all words have to fit in one of those classes. However I ...

I did 134 (loglan) and got a WA the first time. This line of the problem statement was the culprit. "You can assume that all words will be correctly formed." It shouldn't say that becuase the judge's test cases contain words that are neither MOD, A, BA, LA, DA, NAM or PRED (example 'zaoya'). If all ...