ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1566. Triangular Postcards

Can anyone offer some tricky datas?
Posted by SerailHydra 6 Oct 2007 15:09
Re: Can anyone offer some tricky datas?
Posted by A. Babenko, A. Mansurov Kyr-Rus Slav U 6 Oct 2007 15:47
1000 1000 2
1000 1000 1
NO
NO? I thought it is YES.
Posted by Tural Neymanov 3 Jan 2008 00:32
Are you sure?
Can you explain, why?
Re: Can anyone offer some tricky datas?
Posted by Yashar Abbasov 3 Jan 2008 19:48
Yeah exactly why NO? If you put them as two triangles with two equal sides with 1000 mm long then the answer will be YES. And the bases should be 2 and 1.
Re: Can anyone offer some tricky datas?
Posted by timus__dimus 14 Aug 2011 02:02
ans: NO

[height of postcard] sqrt(999999.75) > [height of envelope] sqrt(999999)
with the bases 1 and 2.

Edited by author 14.08.2011 02:04

Edited by author 14.08.2011 02:04

Edited by author 14.08.2011 02:06
Re: Can anyone offer some tricky datas?
Posted by timus__dimus 16 Aug 2011 13:42
3 4 5
2.7784887979 3.6878177829 4.2

ans: YES
Re: Can anyone offer some tricky datas?
Posted by bsu.mmf.team 16 Aug 2011 14:59
This test is incorrect, sides of triangles must be integer numbers.

Edited by author 16.08.2011 14:59
Re: Can anyone offer some tricky datas?
Posted by timus__dimus 16 Aug 2011 15:35
Yes. But it checks the case when the edges don't have to be aligned at a common vertex instead centrally.

Edited by author 16.08.2011 15:35
Re: Can anyone offer some tricky datas?
Posted by timus__dimus 16 Aug 2011 15:36
Can you help me with WA16?