Search found 2 matches

by rainmaker
Thu Mar 08, 2007 9:41 am
Forum: Volume 111 (11100-11199)
Topic: 11186 - Circum Triangle
Replies: 18
Views: 7430

Need help

Hello. I got TLE in last contest. I tried it using O(n^3) algorithm.
I've heard that there are O(n^2) and O(nlogn) algorithm.
I've thought of it since last contest, but I don't know about that.
Would you kindly give me some hints about O(n^2) or O(nlogn)?
Or you can PM me.

Thanks.
by rainmaker
Mon Mar 05, 2007 2:22 am
Forum: Volume 111 (11100-11199)
Topic: 11186 - Circum Triangle
Replies: 18
Views: 7430

Please help..

Hello. I want to know O(n^2) and O(n) algorithm about this problem.
Would you give me some hint?
Thanks

Go to advanced search