Search found 15 matches

by ThanhNhan
Tue Jan 08, 2008 12:45 am
Forum: Volume 113 (11300-11399)
Topic: 11384 - Help is needed for Dexter
Replies: 8
Views: 4681

problem description

Problem description is not up. Someone should fix this.
by ThanhNhan
Tue Mar 28, 2006 5:36 am
Forum: Volume 6 (600-699)
Topic: 604 - The Boggle Game
Replies: 33
Views: 10077

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.
by ThanhNhan
Tue Mar 28, 2006 5:32 am
Forum: Volume 105 (10500-10599)
Topic: 10504 - Hidden squares
Replies: 14
Views: 6243

you need to check the bounds of the indexes for word[k+l-j][l-k+i]
by ThanhNhan
Tue Mar 28, 2006 3:01 am
Forum: Volume 109 (10900-10999)
Topic: 10976 - Fractions Again?!
Replies: 11
Views: 5791

The output k is not the same as the input k.
You should diff your output with the sample output.
by ThanhNhan
Tue Feb 28, 2006 11:44 am
Forum: Volume 105 (10500-10599)
Topic: 10522 - Height to Area
Replies: 32
Views: 15354

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) *(-a + b + c...
by ThanhNhan
Tue Nov 29, 2005 10:04 pm
Forum: Algorithms
Topic: needed World final view from experts !!!
Replies: 7
Views: 1819

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 worrying.
by ThanhNhan
Tue Nov 29, 2005 9:53 pm
Forum: Algorithms
Topic: needed World final view from experts !!!
Replies: 7
Views: 1819

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 seg...
by ThanhNhan
Tue Nov 29, 2005 2:32 am
Forum: Algorithms
Topic: needed World final view from experts !!!
Replies: 7
Views: 1819

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 limits are ...
by ThanhNhan
Mon Nov 28, 2005 11:38 am
Forum: Algorithms
Topic: needed World final view from experts !!!
Replies: 7
Views: 1819

needed World final view from experts !!!

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 V...
by ThanhNhan
Thu Aug 18, 2005 5:29 am
Forum: Volume 108 (10800-10899)
Topic: 10852 - Less Prime
Replies: 24
Views: 14033

10852 input

That the input for p10852 contains n < 100 is incorrect. Shouldn't it be fixed ?
by ThanhNhan
Thu Mar 24, 2005 12:17 pm
Forum: Volume 6 (600-699)
Topic: 602 - What Day Is It?
Replies: 56
Views: 22178

"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 ?
by ThanhNhan
Sun Mar 20, 2005 9:55 pm
Forum: Algorithms
Topic: I want a proof or a counter example
Replies: 19
Views: 4591

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 + i * k > ...
by ThanhNhan
Mon Feb 07, 2005 8:24 am
Forum: Volume 7 (700-799)
Topic: 721 - Invitation Cards
Replies: 25
Views: 8601

Got Accepted !!!!
by ThanhNhan
Mon Feb 07, 2005 6:02 am
Forum: Volume 7 (700-799)
Topic: 721 - Invitation Cards
Replies: 25
Views: 8601

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

This is really annoying !!!
by ThanhNhan
Mon Feb 07, 2005 12:22 am
Forum: Volume 7 (700-799)
Topic: 721 - Invitation Cards
Replies: 25
Views: 8601

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 ?

Go to advanced search