OJ Board

Hi,
it compiles fine at uva, got tle instead:
4053997 2005-10-20 21:37:53 Time Limit Exceeded 10.031 384 18742 C 100 - The 3n + 1 problem
peace, csn

hi,
consider the collection : 4,1,0,0,0,0.
write a program that solves the problem
without reducing and compare the results
on random generated data.
good luck.

Hi,
When i solved the problem with dp, got ac in ~0.2,
then switched to exhaustive search (without sophisticated pruning)
and got better time. So the judge's data is weak enough to try this way...
Csaba Noszaly

Hi
Isn't it an IDE related question? It works on my box except that it
doesn't print any newline char. I tested it under GNU/Linux with g++.
( and my "IDE" is bash+gcc+mc )
Csaba Noszaly.

Hello,
Nowadays i use a (small) subset of a language C,
but i don't know it well. Sometimes before i used
BASIC and PASCAL. Anyway, you can try your
language knowledge at http://spoj.sphere.pl .
Csaba Noszaly.

Lawrence!
it can be done with sorting.
i used hibrid sort: quicksort + insertion.
but hashing is better for this as your
result shows.
csaba noszaly

to BiK
i think that the brute force
O(nn) approach mentioned by
Lawrence (aka ..) can easily get
accepted with the current input
and time limit. I used "pure" c
(no asm,register etc.) and O(nn).
csaba noszaly

helo
i hope that this one is correct:

http://morse.inf.unideb.hu/~noszaly/xxx ... _10722.tgz

csn.

helo!

ah yes now i see the point: never move from pascal to c++ ...

peace,
csaba noszaly

helo Jackie!

Did you verified your assumptions or simply changed from non-Dijkstra
to Dijkstra? I just tested the input of uva/10436 and found that you are
right because there is a map with a query such that a source has at least two
min cost path to some(!) node, but not to target node, so you ...

helo

anyone who dont like problems involving floating point
numbers ( like me ), can try the following:
read and treat the coordinates as whole numbers,
multiply them by ten. in so doing coincidence of points and collinearity can be tested with integer comparisons. i only used eps=0.00001 for the ...

Helo Omega!

Gnu/linux and gcc is a good choice! If you
solve problems for uva, you have to compile
your sources with "-ansi" or better with
"-ansi -pedantic -Wall" option:
$gcc -ansi -Wall -pedantic source.c
If you like // type comments , you can use the
cpp preprocessor with "-fpreprocessed ...

helo tobi!
this a multiple input problem, see
the explanation at the heading
of volumes.
have a nice life,
csaba

helo tobi!

try this one:
http://morse.inf.unideb.hu/~noszaly/xxx/io/uva_613.tgz

csaba

helo shamim!

http://morse.inf.unideb.hu/~noszaly/xxx/io/uva_604.tgz

good luck,
csaba