| Title |
User |
Message |
Date Posted |
| Wow... |
Foundation |
What a monster problem programming BigInts for the first time is.... So many tiny bugs... :P At least one gains programming stamina from overexertion... |
Jul 13, 2009 - 10:29:12 pm UTC |
| Re: Partial Points |
bbi5291 |
Did you bother to READ? All but one (or was it two) of the test cases require essentially no effort to solve. Just giving partial points for them would be too much. |
Apr 07, 2009 - 2:12:13 am UTC |
| Partial Points |
bleung91 |
Whatever happened to that? |
Apr 07, 2009 - 2:10:04 am UTC |
| Re: Hints - PLEASE???? |
hansonw1 |
There is no "easy" way to do this. You have to find a way to multiply numbers of any length. Try doing "A plus B 2" first. |
Jan 01, 2009 - 9:57:38 pm UTC |
| Hints - PLEASE???? |
Bob |
|
Jan 01, 2009 - 9:00:55 pm UTC |
| Re: Re: is there an antilog "function" in pascal |
hansonw1 |
No, it would be too easy then. The answer for the last case won't fit in real or even extended. |
Jan 01, 2009 - 8:50:07 pm UTC |
| Re: Re: is there an antilog "function" in pascal |
Bob |
So close to getting 15 points... Can you make it 15 partial points instead?? |
Jan 01, 2009 - 8:38:23 pm UTC |
| Re: is there an antilog "function" in pascal |
bbi5291 |
Yes, it's called exp, and computes the exponential of its argument, that is, exp(x) = ex. However, using logs/antilogs no longer works for this problem... |
Jan 01, 2009 - 8:29:34 pm UTC |
| is there an antilog "function" in pascal |
Bob |
|
Jan 01, 2009 - 8:13:59 pm UTC |
| Test data updated |
bbi5291 |
This problem used to be solvable using a long double to store p, since you only need a handful of digits, so a new test case has been added, with 1 |
Jan 01, 2009 - 7:25:18 pm UTC |
