UVa OJ Board

Could any one give the output of this input? Thanks in advance

It seems that the problem description of 10017 is wrong. Each line will contain two integers n, m. n, lying within the range [1,250], will denote the number of disks and m, belonging to [0, ] , will be the number of the last move, you may assume that m will also be less than 2^16 Does the bold part ...

Oh yes, you are right, I am using the old link.
Thanks for the work

Hi,

Can you try check my account (9339)?
I have updated the link in my user info,
but it can't be showed in
http://acm.uva.es/problemset/usersjudge.php?user=9339

Sad to say, I am busy in working, hope I have more time to solve problem

Wai

Thanks

Could anyone tell me what this means??

This number will always be less than 2 to the 30th.

By the way, the answer will always >= 1, right?

Hi, Here is my output, I think it is the same as you. Paragraph 1 Line 1: A (-19 whitespace) Line 2: B (-1 whitespace) Line 3: C ... C (0 whitespace) Line 4: D ... D (0 whitespace) Line 5: ABCD (-356 whitespace) Paragraph 2 Line 1: AAA ... AAA (70 whitespace) Line 2: AAA (-188 whitespace) Line 3: BB...

Sorry I am not detail enough. After I update the "Homepage" in my profile, I still read the old value when I read my info in "Author ranklist".

Btw, I don't get what you mean "children".....

Hi Carlos,

It seems that the "Homepage:" entry in user profile can't be updated. Is it not supported now? Thanks

Wai

Although I get AC, I am still confused. For first input: -1.2 1.2 0.1 -2 1 0.05 So in the graph, I is { -1.2, -1.1, -1.0, ..., 1.1, 1.2 } 25 rows R is { -2, -1.95, -1.9, ..., 0.9, 0.95, 1.00} 61 columns But the sample output has 25 rows and 60 columns only. I try to submit a program that will genera...

Try this:
http://acm.uva.es/cgi-bin/OnlineJudge?S ... :60::30863

Hi eveyone,

Just want to remind all onething, if you have got AC on this problem, try also 10031.
If your program isn't too slow, just change the input/output format is ok....
Because I just re-use my code of 10031 :p

I got AC, but took over 6 seconds.. I basically use O(n^3) to find out all the sets of colinear points, none of which is a subset of any other colinear points. ie if i have trees(1 3 5), then i don't consider trees(1 3). Then I run a O(n^2*2^n) dp. Is there any better solution than this.. .. obviou...

Oh yes, my program misses this case, thanks Per

Could anyone got AC help verify this: There will always be a non-zero probability that a generated maze will be solvable. I write a program that do this thing: 1. read case 2. make a maze, a sqaure has berrier on it only if the input probability is 1.0 3. use BFS to find a route from top left to bot...