OJ Board

Problem description is not up. Someone should fix this.

You do not get all words of length 4. After a word is found, you need to get to another free square which is not needed.

example
AE..
BC..
......
......

Your code do not accept BCEA as a word.

you need to check the bounds of the indexes for word[k+l-j][l-k+i]

The output k is not the same as the input k.
You should diff your output with the sample output.

1) Ha, Hb, Hc are all positive
2) 1/Ha + 1/Hb - 1/Hc > 0
3) 1/Ha - 1/Hb + 1/Hc > 0
4) -1/Ha + 1/Hb + 1/Hc > 0 [/code]



I used your conditions and worked out the formula:

Let A = the triangle area
We have : A = 1/2 ha * a = 1/2 hb * b = 1/2 hc * c (*)

In Heron's A = 1/4 sqtr( (a + b + c ...

First of all, I'm not competing in these World Finals, I'm a bit too old for that :) I did compete in 2003.
( http://icpc.baylor.edu/dmt/media/indexed/25031830-C6CD3921%5BLO%5D.jpg )

You looked very young and bright in the picture.

We have what you suggested. Maybe, I just need to stop ...

I think he was refering to finding the intersections of n segments in O(n log n + k) where k is the number of intersections, not to the intersection of two segments.
:)
Possibly. I agree that this one is really nasty.

Ha, I was talking about O((n+k) log n). There are 2 annoying cases: 3 or more ...

In general, I wouldn't expect most of these to occur.

Please, tell me what you think might occur. What algorithms should be prewritten ?

Line segment intersection, even with all the special cases.

My team is working on the special cases. This is quite nasty.

In the World Finals the time ...

Hi everyone,

Please, give me your opinion in Computational Geometry in WF.

In WF 2005, Voronoi diagram is actually not needed for problem B. However, would you ever expect in the WF to implement very hard geometry algorithms, such as: polygon trangulation, Delaunay trianglulation, closest/furthest ...

That the input for p10852 contains n < 100 is incorrect. Shouldn't it be fixed ?

"February 29, 1000 is a Thursday"

1000 % 4 == 0
1000 % 100 = 0
1000 % 400 != 0

1000 is not a leapyear, is it ?

Sorry, I don't really get this. Could you explain, please ?

Tricks to solve it fast are very cool. but Optimized DP is good enough to get accepted, not very fast around .3 second.

Running time : O(sum)

a[] is the input
t[] is the boolean function.

for (i = 1; i <= 6; i++)
if (a )
for (j = sum; j >= 0; j--)
if (t[j])
for (k = 1; k <= a ; k++)
if (j ...

Got Accepted !!!!

http://acm.pku.edu.cn/JudgeOnline/showp ... em_id=1511
This is the same problem, but I got accepted there.

This is really annoying !!!

I lost 20 submissions for this problem and coded it twice. I use priority_queue dijkstra, but keep getting WA.

Could you guys post some input for me to check ? Thank you,

Even using scanf it took like 1.7s to just read inputs, how do people get accepted in 0.5s ?