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 1108. Heritage

Is there RELLY an o(n) algorithm?
Posted by CleverKid 24 Jan 2003 16:45
or it's cheat?
Re: Is there RELLY an o(n) algorithm?
Posted by Locomotive 24 Jan 2003 20:48
Hi CleverKid
Can i meet you more?
i see you have fast solution for problems and want to talk more
my rating is now 397... i want to meet you more, so if you can mail
me:
aidin_n7@hotmail.com

~~~~~~~~~~
abour 1108
because it has just 18 input and it is very little range, cheating
will be so easy!

Bye
Do you really think so :). Try to cheat :)))... I think that writing solution to this problem is much easier that cheat it :).
Posted by Nikolay Marinov 25 Jan 2003 03:17
:))
Posted by CleverKid 26 Jan 2003 09:21
>