ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1009. K-based Numbers

I want to know correct algorithm of this problem can you help,
Posted by Levani Kasradze 2 Sep 2004 02:32
Can you tell me hint?
Re: I want to know correct algorithm of this problem can you help,
Posted by Liu Guyue 28 Aug 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,
Posted by zzzlll 3 Jan 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,
Posted by yuxiaolei 9 Feb 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,
Posted by svr 9 Feb 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,
Posted by svr 10 Feb 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,
Posted by Bobur 2 Dec 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.