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 1352. Mersenne Primes

Funny!
Posted by Katy 8 Jul 2006 17:35
I' ve got 0, 001 second result.
This is an easy problem - impossible to solve without cheating but here yuo can find this useful list: http://primes.utm.edu/mersenne/index.html#known
;)
Re: Funny!
Posted by Igor Goroshko 8 Jul 2006 19:51
All necessary numbers are given in task (for all n>8), so the only task is to find first 7 numbers!!!
So, this problem can be solved without cheating :)

PS. Thanks for Link!

Edited by author 08.07.2006 19:52
Re: Funny!
Posted by Katy 9 Jul 2006 23:54
it depends on what you understand as cheating;)
But it is no other way to solve this task other then using control c control v;)))