Обсуждение @ 1009. K-ичные числа @ Timus Online Judge

I want to know correct algorithm of this problem can you help,

Послано Levani Kasradze 2 сен 2004 02:32

Can you tell me hint?

Re: I want to know correct algorithm of this problem can you help,

Послано Liu Guyue 28 авг 2005 10:02

i don't know it , either ...

who can help us?

Re: I want to know correct algorithm of this problem can you help,

Послано zzzlll 3 янв 2007 23:23

[code deleted]

Edited by moderator 13.02.2007 20:49

Re: I want to know correct algorithm of this problem can you help,

Послано yuxiaolei 9 фев 2007 13:35

i=N/2
<<Sum[j=0->i,C(j,N-j)*(K-1)^(N-j)]

Re: I want to know correct algorithm of this problem can you help,

Послано svr 9 фев 2007 20:48

[solution deleted]

Edited by moderator 13.02.2007 20:50

Re: I want to know correct algorithm of this problem can you help,

Послано svr 10 фев 2007 17:24

N+K<18 therefore it's enough int F[18],S[18]
without longarithm

Re: I want to know correct algorithm of this problem can you help,

Послано Bobur 2 дек 2007 21:24

I think it is algoritm true, but...
    var
      n, k : integer;

begin
   read(n, k);
   n := TRUNC(k*exp((n-1)*ln(k-1)));
   writeLn(n);
end.

Обсуждение задачи 1009. K-ичные числа