Обсуждение @ 1513. Басня о лимоне @ Timus Online Judge

Problem "lemon tale"

Послано deepesh 16 дек 2006 14:58

In this question if N=K=10000, then the number of combinations would be 2^10000. Can you tell me if there is any assumption in the question that the result fits into an integer.

Re: Problem "lemon tale"

Послано Kirin Vladislav 16 дек 2006 16:28

long arihmetic

Re: Problem "lemon tale"

Послано deepesh 16 дек 2006 22:29

Hi,

By long arithmetic, do you mean "long long" datatype or some thing else?

If it is not "long long" datatype, do there exist libraries which I can use.

Thank you,
Deepesh

Re: Problem "lemon tale" (-)

Послано Roma Labish[Lviv NU] 16 дек 2006 22:49

Try to read Okulov's book. There is all about long arithmetics.

Re: Problem "lemon tale" (-)

Послано Kaliningrad SU -J_A_MES-HeadLiner 17 дек 2006 01:32

Long arithmetics but time limit. How to avoid TLE? Maybe my algorithm is too slow?

Обсуждение задачи 1513. Басня о лимоне