Search found 12 matches
- Thu May 27, 2004 8:10 pm
- Forum: Volume 1 (100-199)
- Topic: 196 - Spreadsheet
- Replies: 42
- Views: 11401
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...
- Mon May 17, 2004 6:01 pm
- Forum: Volume 1 (100-199)
- Topic: 196 - Spreadsheet
- Replies: 42
- Views: 11401
- Fri May 14, 2004 5:41 pm
- Forum: Volume 1 (100-199)
- Topic: 196 - Spreadsheet
- Replies: 42
- Views: 11401
- Thu Apr 29, 2004 3:45 am
- Forum: Volume 1 (100-199)
- Topic: 196 - Spreadsheet
- Replies: 42
- Views: 11401
196 - Spreadsheet
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...
- Tue Apr 13, 2004 10:06 pm
- Forum: Algorithms
- Topic: DFSID
- Replies: 1
- Views: 1543
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...
- Mon Apr 12, 2004 1:10 am
- Forum: Algorithms
- Topic: Stuck on certain DP problems.
- Replies: 15
- Views: 5883
- Tue Apr 06, 2004 6:12 pm
- Forum: Algorithms
- Topic: Stuck on certain DP problems.
- Replies: 15
- Views: 5883
Stuck on certain DP problems.
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 ...
- Tue Apr 06, 2004 6:00 am
- Forum: Other words
- Topic: Are all the problems from volumes 1-8 from acm competitions?
- Replies: 3
- Views: 1324
- Thu Mar 25, 2004 10:04 pm
- Forum: Other words
- Topic: Are all the problems from volumes 1-8 from acm competitions?
- Replies: 3
- Views: 1324
Are all the problems from volumes 1-8 from acm competitions?
I'm confused about the source of the problems. Are the volume C problems the only non-acm (regional or finals) past problems?
- Mon Mar 22, 2004 5:05 pm
- Forum: Volume 1 (100-199)
- Topic: 134 - Loglan-A Logical Language
- Replies: 45
- Views: 5565
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...
- Mon Mar 22, 2004 7:54 am
- Forum: Volume 1 (100-199)
- Topic: 134 - Loglan-A Logical Language
- Replies: 45
- Views: 5565
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 ...
- Mon Mar 22, 2004 3:46 am
- Forum: Volume 1 (100-199)
- Topic: 134 - Loglan-A Logical Language
- Replies: 45
- Views: 5565
134: misleading specification?
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'...