| Title |
User |
Message |
Date Posted |
| ordinal expected |
Hzhang |
i know how to do this but the largest ordinal thing is longint... |
Nov 20, 2013 - 8:54:14 pm UTC |
| Re: Re: Need help! |
jargon |
Your solution is practically cheating :P Congratulations nonetheless on doing this problem in Python. |
Oct 13, 2012 - 5:50:21 pm UTC |
| Re: Re: Need help! |
PeaCe |
It's possible in python btw. Took a while but got it... |
Oct 12, 2012 - 10:11:17 pm UTC |
| Re: Re: Need help! |
ImbaCalvin |
I only know Python and Visual Basic... crying... |
May 29, 2012 - 3:16:01 pm UTC |
| Re: Re: Need help! |
jargon |
You are correct in that the maximal difference between M and N is 5 000 000. Despite bumping the memory limit up to 128 MiB, your program still gets MemoryError on the last case, and it TLEs on the fo... |
May 29, 2012 - 1:34:50 pm UTC |
| Re: Re: Need help! |
ImbaCalvin |
A 5 million elements long list of boolean doesn't crash in my computer in either Python 2.6.5 or Python 2.7.2 though, and isn't the maximum difference between N and M is 5 million? |
May 28, 2012 - 2:06:37 pm UTC |
| Re: Need help! |
jargon |
They're just segfaults: Traceback (most recent call last): File "./a", line 13, in result=[True]*(L-K) MemoryError |
May 27, 2012 - 9:26:36 pm UTC |
| Need help! |
ImbaCalvin |
Can you let me know what am I doing wrong for my very last try? I got IR for case 4 and case 5, and I want to know the detail of the invalid return. Thanks a lot |
May 24, 2012 - 7:44:15 pm UTC |
| Re: c++ |
Daniel |
You may want to read the 'help' section. |
Dec 25, 2011 - 4:46:36 pm UTC |
| c++ |
XZNZ |
what is SIGSEGV? |
Dec 25, 2011 - 3:51:42 pm UTC |
