## Search found 284 matches

Sat Jun 22, 2002 11:59 pm
Forum: Volume 1 (100-199)
Topic: 138 - Street Numbers
Replies: 93
Views: 7243
dawynn: You mean you have intermediate values that exceed the range, right? Because the resulting numbers fit perfectly, even in "int". So it depends on how you get there, maybe we could see how you do it?
Thu Jun 20, 2002 8:08 pm
Forum: Volume 1 (100-199)
Topic: 101 - The Blocks Problem
Replies: 635
Views: 40074
Don't know how good this is compared to others, but I have several programs of about 50 lines, using doubly-linked lists and recursive functions that are used for different purposes, if I remember right.
Thu Jun 20, 2002 6:15 am
Forum: Volume 7 (700-799)
Topic: 755 - 487--3279
Replies: 115
Views: 28858
Do you handle multiple input correctly?
Wed Jun 19, 2002 12:10 pm
Forum: Volume 1 (100-199)
Topic: 100 - The 3n + 1 problem
Replies: 1394
Views: 185334
In all of the following threads your exact mistake was explicitly discussed, and I didn't even list those where it was only covered in the programs. What exactly do you mean when you say "I searched ..."? It's a bit mean, I remember that it took me seven attempts to solve this problem when I first c...
Wed Jun 19, 2002 10:41 am
Forum: Volume 7 (700-799)
Topic: 755 - 487--3279
Replies: 115
Views: 28858
Anything you haven't mentioned *where*? Do you mean you've asked about this problem before? I couldn't find it in your past posts...
Wed Jun 19, 2002 10:34 am
Forum: Volume 1 (100-199)
Topic: 100 - The 3n + 1 problem
Replies: 1394
Views: 185334
You might want to read one of the older threads about this problem, because your mistake has been discussed already over and over again...
Wed Jun 19, 2002 5:16 am
Forum: Volume 1 (100-199)
Topic: 136 - Ugly Numbers
Replies: 156
Views: 18845
BTW = By The Way And sorry for my offensiveness. Every once in a while I get tired and say mean things I shouldn't. But you really asked some questions that you could've easily answered yourself, I think. Try finding things out yourself, otherwise you'll always depend on others to help you... for ex...
Wed Jun 19, 2002 5:12 am
Forum: Other words
Topic: I want access to the judge data
Replies: 2
Views: 1907
Ok, so I'll just rely on the good old techniques...

The problem I mentioned is 10034, where the problem statement asks to print blank lines between testcases and when you do so, you'll get WA. Leave them out and you'll get PE. Write one blank line at the end of the output and you'll get AC.
Wed Jun 19, 2002 2:04 am
Forum: Volume 1 (100-199)
Topic: 136 - Ugly Numbers
Replies: 156
Views: 18845
That's not quite correct, I believe? You did see a difference, because you removed the space before the ".". Btw, I just got your program accepted as is. Please read one of the many many other threads where email problems were already discussed...
Wed Jun 19, 2002 1:53 am
Forum: Other words
Topic: I want access to the judge data
Replies: 2
Views: 1907

### I want access to the judge data

A while ago somebody asked in a poll whether the judge should tell us the testcase where we fail. I voted "no". Now I changed my mind, partly because once more I came across a problem where the judge data is just plain wrong. I'm currently more active at TopCoder, where I can see the test data and a...
Tue Jun 18, 2002 8:14 am
Forum: Volume 1 (100-199)
Topic: 136 - Ugly Numbers
Replies: 156
Views: 18845
RTFM: http://acm.uva.es/problemset/replies.html Sorry, don't want to offend anybody, but this is really getting annoying and some people are wasting their time here and some newbies exploit this and just don't care. I already stopped reading threads about specific problems two days ago. Exception: i...
Tue Jun 18, 2002 6:42 am
Forum: Volume 103 (10300-10399)
Topic: 10304 - Optimal Binary Search Tree
Replies: 24
Views: 12581
I think that's a wrong interpretation. For example, let i=3 and j=7 and let root[3,6]=4 and root[4,7]=6. Then we try 4 to 6 as root[3,7]. We might end up with 5, even though it is not the root of any of the two subproblems.
Tue Jun 18, 2002 4:46 am
Forum: Volume 103 (10300-10399)
Topic: 10304 - Optimal Binary Search Tree
Replies: 24
Views: 12581
Can anybody explain exercise 15.5-4 of CLRS to me? I don't ask for a solution, I just can't understand the first sentence. This "always" and "for all" and stuff is weirdly mixed... (Later the same day) Found it out myself. The hint means that in order to find root[i,j] you only have to try all nodes...
Tue Jun 18, 2002 2:59 am
Forum: Other words
Topic: creating an online bulletin board system
Replies: 14
Views: 5152
One thing that really screams for Java is an online contest with an arena applet, containing lots of cool stuff, completely done in Java. You could call it TopCoder, for example. Oops, I just realized that this already exists... But maybe you have an idea that could use similar technology, for examp...
Sat Jun 15, 2002 11:59 pm
Forum: Volume 1 (100-199)
Topic: 136 - Ugly Numbers
Replies: 156
Views: 18845
Is this the correct process? There isn't "the" correct process. You sound a little bit as if there's only one approach to solve the problem. Yes, yours will easily work if you make the exponents larger. Of course you will also produce some ugly numbers that are too large and therefore not really ne...