Search found 43 matches

by Andrew Neitsch
Tue Nov 16, 2004 10:01 pm
Forum: Volume 4 (400-499)
Topic: 481 - What Goes Up
Replies: 82
Views: 13889

There's an O(n log n) algorithm for this.

Super-fast times are usually I/O optimization or tables or something like that. Don't worry about it.
by Andrew Neitsch
Tue Nov 16, 2004 9:55 pm
Forum: Off topic (General chit-chat)
Topic: What kinds of problems do you solve most ?
Replies: 25
Views: 76022

Easy ones.
by Andrew Neitsch
Tue Nov 16, 2004 9:54 pm
Forum: Other words
Topic: Data Structures and Algorithms in Java - Any good?
Replies: 2
Views: 1138

No.
by Andrew Neitsch
Tue Nov 16, 2004 9:51 pm
Forum: Java
Topic: Anyone knows how to speed up JAVA a little bit?
Replies: 9
Views: 7347

Use C.
by Andrew Neitsch
Tue Nov 16, 2004 9:49 pm
Forum: C++
Topic: GCC in windows
Replies: 3
Views: 2144

Go to cygwin.com, click on the setup thingy.
by Andrew Neitsch
Mon Nov 01, 2004 10:34 pm
Forum: Volume 107 (10700-10799)
Topic: 10730 - Antiarithmetic?
Replies: 21
Views: 7256

n^2 log n is way too much. I did this in the contest in three minutes, with 34 lines. I think that the problem setter did not intend for an n^2 log n algorithm to be acceptable.
by Andrew Neitsch
Mon Nov 01, 2004 10:13 pm
Forum: Off topic (General chit-chat)
Topic: ICPC Java
Replies: 4
Views: 2166

In Rocky Moutain Regionals, we had the full API from a link on the desktop, and there was a FAQ entry giving a full solution to one of the practice problems in Java, so that you could see how to do the File I/O. It took us longer to get a test Java BigInteger sample to work at the practice than to s...
by Andrew Neitsch
Wed Sep 08, 2004 4:38 am
Forum: Volume 4 (400-499)
Topic: 466 - Mirror, Mirror
Replies: 13
Views: 2551

I don't believe you. I've done the same thing, where I was convinced the input was wrong, that all I had to do was change one line in my input routine to go from WA to AC; but I contacted the people who run the judge, and they checked, and the input was fine. If there really is a problem, email the ...
by Andrew Neitsch
Tue Sep 07, 2004 11:31 pm
Forum: Volume 4 (400-499)
Topic: 466 - Mirror, Mirror
Replies: 13
Views: 2551

I highly doubt that the input is incorrect. If you email problemset@acm.uva.es, they can check it for you, but at least 93% of all such claims are absurdly false.
by Andrew Neitsch
Tue Sep 07, 2004 11:27 pm
Forum: Volume 4 (400-499)
Topic: 481 - What Goes Up
Replies: 82
Views: 13889

I have not read your code or post, but there is an O(n log n) dynamic programming solution for this problem, which uses linear space.
by Andrew Neitsch
Thu Sep 02, 2004 6:23 pm
Forum: Volume 2 (200-299)
Topic: 229 - Scanner
Replies: 11
Views: 5691

Do you know why it is a special corrector problem?
by Andrew Neitsch
Wed Sep 01, 2004 7:00 pm
Forum: Volume 7 (700-799)
Topic: 726 - Decode
Replies: 36
Views: 9844

Your integer compare is stupid. If the two numbers are equal, and you add 1 to each, they will still be equal.

Just do return *(int*)a-*(int*)b; to sort in ascending order.
by Andrew Neitsch
Wed Aug 25, 2004 10:35 pm
Forum: Algorithms
Topic: Problems understanding dynamic programming
Replies: 6
Views: 2134

You have a function best(int n,set of intervals). If the given set of intervals covers the 0th through n-1th numbers, then best(n,set of intervals) is the minimum, over all intervals (call each one I in turn) containing the nth number, of best(n+1,set of intervals \[Union] I). best(int n,set of inte...
by Andrew Neitsch
Wed Aug 25, 2004 8:46 pm
Forum: Algorithms
Topic: Problems understanding dynamic programming
Replies: 6
Views: 2134

I have not done the minimal set problem, and have only thought about it for two minutes, but here is how I would do it Have a function best(next number to consider,chosen set of intervals) = minimum over all intervals I that cover the next number to consider, of best(next number to consider+1,chosen...
by Andrew Neitsch
Wed Aug 25, 2004 3:18 am
Forum: Other words
Topic: Search the board ...
Replies: 4
Views: 2159

I blame that fact that it is open source software, which we all know is crap. I'm glad you have made a post about 10265--that it can be found by looking for 'toroidal'--and that your post is found when searching for 10265. I have experienced similar things with this lousy php software many times. Pe...

Go to advanced search