| Title |
User |
Message |
Place |
Date Posted |
| what's the first test case? |
zhxl0903 |
I got all of them right, except for that one... |
wc96p6 |
Jan 09, 2009 - 11:57:16 pm UTC |
| Re: Is pascal longint larger enough for this program? |
jargon |
Yes. |
wc96p6 |
Jan 09, 2009 - 8:36:11 pm UTC |
| Is pascal longint large enough for this program? |
zhxl0903 |
|
wc96p6 |
Jan 09, 2009 - 7:32:48 pm UTC |
| Don't worry |
SourSpinach |
Though it says n and m can be up to 32, they're never actually both that big - in one case, one is big and the other is small, and in the final case they're both 10. |
ccc06s2p6 |
Jan 09, 2009 - 5:04:08 pm UTC |
| Re: Re: hmm.. |
zhxl0903 |
nvm I just did it with real , and it worked Thanks anyways! :) |
wc01p6 |
Jan 09, 2009 - 3:35:52 am UTC |
| Re: hmm.. |
bbi5291 |
Actually, longint goes up to 2147483647, so it is big enough. |
wc01p6 |
Jan 09, 2009 - 3:31:17 am UTC |
| hmm.. |
zhxl0903 |
So, the second test case is too large for Pascal longint...? |
wc01p6 |
Jan 09, 2009 - 3:18:18 am UTC |
| Re: which sort? |
hansonw1 |
You have to be a bit creative with the insertion. |
ccc05s5 |
Jan 08, 2009 - 2:36:00 am UTC |
| which sort? |
seyonv |
Would an insertion sort run in time for all test cases or is a binary search the only one that will |
ccc05s5 |
Jan 08, 2009 - 2:07:50 am UTC |
| Re: Re: Re: conditions? |
dAedaL |
"You may assume that 30 >= n > 0, 8 > k >= 0, and n >= k" Maybe read the problem statement more carefully next time. |
ccc96s3 |
Jan 08, 2009 - 1:39:56 am UTC |
