Search found 137 matches

by C8H10N4O2
Mon Apr 22, 2002 1:02 am
Forum: Volume 1 (100-199)
Topic: 140 - Bandwidth
Replies: 49
Views: 7863

Just to clarify, I have the book and have read it several times. I was trying to devise a novel algorithm:P
by C8H10N4O2
Mon Apr 22, 2002 12:59 am
Forum: Volume 5 (500-599)
Topic: 501 - Black Box
Replies: 35
Views: 16301

If you are serious about Computer Science, you should pick up a couple of algorithm books (Dijkstra, Skienka, the MIT introduction one). They should give you some basic idea of the tools at your disposal. Then you should be able to apply the right one or even DEVELOP it. After all, Computer Science ...
by C8H10N4O2
Mon Apr 22, 2002 12:57 am
Forum: Volume 102 (10200-10299)
Topic: 10258 - Contest Scoreboard
Replies: 87
Views: 34925

Here is the pseudo code for my input routine:

1. Read N.
2. Loop from 1 to N: while fgets is not null, check if length is 0 or 1 (if so, terminate input set), sscanf the buffer char array
3. Process each input data set.
by C8H10N4O2
Mon Apr 22, 2002 12:54 am
Forum: Volume 1 (100-199)
Topic: 104 - Arbitrage
Replies: 223
Views: 14797

Sorry, I do not understand. How do you accomplish 3D Floyd-Warshall with a 2D matrix? Please enlighten me to your technique.
by C8H10N4O2
Mon Apr 22, 2002 12:49 am
Forum: Volume 1 (100-199)
Topic: 110 - Meta-Loopless Sorts
Replies: 92
Views: 8187

Multiple input is BLUE icon:)
by C8H10N4O2
Thu Apr 18, 2002 10:43 am
Forum: Volume 101 (10100-10199)
Topic: 10110 - Light, more light
Replies: 76
Views: 26749

That program ONLY took me 7 hours in JAVA:O I am starting to see why without the good classes, JAVA is horribly complicated and slow. Although the error checking compiler is quite nice. It is much more strict than C++ and won't let you access out of bounds and such. The other thing I noticed is that...
by C8H10N4O2
Thu Apr 18, 2002 10:38 am
Forum: Volume 1 (100-199)
Topic: 140 - Bandwidth
Replies: 49
Views: 7863

You mean the Algorithm Design Manual? I will check it out when I get back from Cali. Thanks for the tip.
by C8H10N4O2
Wed Apr 17, 2002 11:02 pm
Forum: Volume 1 (100-199)
Topic: 140 - Bandwidth
Replies: 49
Views: 7863

I permutate and then check the bandwidth. It takes forever since my bandwidth checker is O(26^2). Any ideas on how to check bandwidth faster?
by C8H10N4O2
Wed Apr 17, 2002 9:25 pm
Forum: Volume 101 (10100-10199)
Topic: 10110 - Light, more light
Replies: 76
Views: 26749

Good point. Should have used JAVA long or unsigned int. Thanks.
by C8H10N4O2
Wed Apr 17, 2002 4:52 pm
Forum: Volume 101 (10100-10199)
Topic: 10110 - Light, more light
Replies: 76
Views: 26749

10110 - Light, more light

Works for all test cases. Don't know why it WAs. Some help from them JAVA people would be nice. [java]import java.io.*; import java.lang.*; class Main { public static void main(String args[]) { StringBuffer B; String S; int N,Length,i; char c; while(true) { try { B=new StringBuffer(); while((c=(char...
by C8H10N4O2
Wed Apr 17, 2002 12:47 pm
Forum: Volume 4 (400-499)
Topic: 413 - Up and Down Sequences
Replies: 22
Views: 5470

Thanks a lot. I just found out that my ISP's mail server is horribly distorting my code. I am resubmitting a lot of stuff. It wasn't on my end:P
by C8H10N4O2
Wed Apr 17, 2002 5:37 am
Forum: Other words
Topic: How to get Experienced programmer
Replies: 5
Views: 2441

I think you should be able to input your ID number in the member preferences and have it look your stats up:o) 50 problems solved=experienced, 100=veteran, 250=expert, 500=guru
by C8H10N4O2
Wed Apr 17, 2002 5:35 am
Forum: Volume 4 (400-499)
Topic: 413 - Up and Down Sequences
Replies: 22
Views: 5470

413 Up and Down Sequences

Can anyone help me figure out what is wrong with my code? It works for all the standard tests I can think of. ::This is a repost:: [cpp]#include <cstdio> #include <vector> #include <cstring> using namespace std; const int UP=1; const int DOWN=2; const int UK=3; int Trend,LastTrend,C,LD,LU,NU,ND; vec...
by C8H10N4O2
Wed Apr 17, 2002 5:30 am
Forum: Volume 1 (100-199)
Topic: 116 - Unidirectional TSP
Replies: 226
Views: 37482

Sure thing. Lexicographically means in order.
Thus:
1 2 3 4 is lexicographically smaller than 4 2 1 3.

Think of it as alphabetical or numerical sorting. If all the solutions were put in an array, and then sorted, which would be first.
by C8H10N4O2
Wed Apr 17, 2002 5:28 am
Forum: Other words
Topic: New posts/messages not announced?
Replies: 2
Views: 1730

The view things since last works for "last page load" if you stay logged on (i.e. cookie). Thus, on one specific page, it said "new message". But it resets the flag on next page shown. Another reason to logout often.

Go to advanced search