| ENG RUS | Timus Online Judge |
Discussion of Problem 1451. Beerhouse TaleDenis Koshman Hints [2] // Problem 1451. Beerhouse Tale 14 Aug 2008 21:59 EPS=1e-8 precision for =0 comparisons is ok. Output 10 digits after decimal point is ok (6 digits gave WA41). The point to find is called Fermat point, check at mathworld.wolfram.com Vit Demidenko Re: Hints // Problem 1451. Beerhouse Tale 19 Jan 2011 12:31 Yea, Fermat point.... or simple ternary search :) ASK Re: Hints // Problem 1451. Beerhouse Tale 7 Apr 2018 01:49 Outputting 6 decimal points works just fine. There is no need for epsilon tweaking: it can be solved with fractions (Python 3) except one Decimal (getcontext().prec=10) needed for sqrt(3). YuFeng WA #2 [1] // Problem 1451. Beerhouse Tale 17 Jul 2017 19:41 who knows the Test2 ?? Mahilewets Re: WA #2 // Problem 1451. Beerhouse Tale 17 Jul 2017 19:44 I don't know the test I know exactly Because I have verified it myself That ternary search gives a solution Even C float type is enough And something about 200 iterations in each loop YuFeng No subject // Problem 1451. Beerhouse Tale 17 Jul 2017 19:38 Edited by author 17.07.2017 19:41 dibrov.bor[SumySU] all points on line [1] // Problem 1451. Beerhouse Tale 29 Jan 2008 17:58 what about case when all three points are on line I think it's impossible to find required position as proper as we can't draw circle throw three points on one line Denis Koshman Re: all points on line // Problem 1451. Beerhouse Tale 14 Aug 2008 18:52 Why do you think about the circle? The answer is obvious in such case, and it's the central point. Samsonov Alex [USU] WA1? [1] // Problem 1451. Beerhouse Tale 2 Apr 2007 01:00 Interesting. My solution gives correct answer on the sample test, but gets WA1 on Timus. Is the first test sample or not? Or, probably, there are some big differences between MSVC and Intel C++ Compiler? Samsonov Alex [USU] Re: WA1? // Problem 1451. Beerhouse Tale 2 Apr 2007 01:12 Sorry, I found my bug. Dmitry 'Diman_YES' Kovalioff Changes in the problem (+) [1] // Problem 1451. Beerhouse Tale 19 Jan 2007 14:17 Some tests were added. The checker precision was decreased. Look the statement for some changes in "Output" paragraph. The problem has been rejudged. Some authors lost AC, and some get. Many thanks to Fyodor Menshikov for new tests and help during the investigation. Edited by author 19.01.2007 17:43 svr Re: Changes in the problem (+) // Problem 1451. Beerhouse Tale 20 Jan 2007 09:39 After changes especially after diminishing of precision problem became absolutely simple and solvable numerically by strict search on sequence of grids in double type Last variant was very interesting due 1.e-8
|