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 1509. Domino Recognition

Give me PLEASE test 46 (I think it is n=2)
Posted by Hayk 11 Nov 2006 13:07
I can't take this no more!!!!!!!!!!!!
PLEASE!!!!
Somebody!
Anybody!!

Tell me, what is the test#46

Or maybe you can say(and explain) Is the answer always
0 2
1 1
when n==2;
Re: Give me PLEASE test 46 (I think it is n=2)
Posted by Nechaev Ilya (Rybinsk SAAT) 12 Nov 2006 01:36
For n==2 this answer is not always right. Check 1 ≤ L ≤ 100 for cases 0 2 and 1 1.

Edited by author 12.11.2006 01:39
Re: Give me PLEASE test 46 (I think it is n=2)
Posted by Hayk 12 Nov 2006 21:50
Yes, I have checked.
if n==2:
1 1  always is correct answer, but
0 2 is correct when the distance between that two points is less or equal than 50*sqrt(2.0);

is it right?

P.S.
And the other trivial cases are:
n=1  : 0 1
n=11 : 5 6
n=12 : 6 6
Re: Give me PLEASE test 46 (I think it is n=2)
Posted by Hayk 12 Nov 2006 21:55
Ya viju u tebya AC s pervogo raza i bez proverki na tochnost'?!?!?!

Da ti mojno skazat' volshebnik.
Budu blogadaren, esli otkroesh tvoyu taynu.:)

P.S. Pogovorim na radnom yazike:)
Re: Give me PLEASE test 46 (I think it is n=2)
Posted by Nechaev Ilya (Rybinsk SAAT) 13 Nov 2006 02:26
1 1 is not always correct. For test:

2
0 0
0 0.9

Аnswer is 0 2 only.

А волшебство тут не причем. Просто так получилось что я сравниваю только числа, которые либо заведомо отличаются на величину много большую точности (и она никак не может повлиять на результат сравнения), либо целые числа.
THANK YOU!!!!!!!
Posted by Hayk 13 Nov 2006 23:57
Друг, СПАСИБО ТЕБЕ БОЛЬШОЕ!!!!!!

Очень, очень ...n раз.... очень тебе благадарен!
(здесь n-> {почти бесконечности} )
Thank you!
Posted by Fyodor Menshikov 21 Jan 2007 15:39
Nechaev Ilya, thank you very much for case n=2!
Re: Thank you!
Posted by AlexF [USTU Frogs] 5 Oct 2007 21:07
+1) Thanks!