Discussion @ 1537. Ents @ Timus Online Judge

AlMag Damn, Always WA#15 (-) [11] // Problem 1537. Ents 3 Mar 2007 13:38

Victor Barinov (TNU) WA15 too. May be something wrong? [10] // Problem 1537. Ents 3 Mar 2007 13:47

Victor Barinov (TNU) Re: WA15 too. May be something wrong? [9] // Problem 1537. Ents 3 Mar 2007 14:03

Try test
1 1

AlMag Re: WA15 too. May be something wrong? [8] // Problem 1537. Ents 3 Mar 2007 14:19

0
true?

Index Tree Re: WA15 too. May be something wrong? [7] // Problem 1537. Ents 3 Mar 2007 14:22

I also get 0. But WA15

Edited by author 03.03.2007 14:22

Edited by author 03.03.2007 14:22

Edited by author 03.03.2007 14:22

AlMag Re: WA15 too. May be something wrong? [6] // Problem 1537. Ents 3 Mar 2007 14:26

YES!!!!!!!
Try this test
2 1

)))))

Last_Vikings Re: WA15 too. May be something wrong? // Problem 1537. Ents 3 Mar 2007 15:38

Thank You. WE GOT AC!!!

Chernov Andrey [Vladimir SU] Re: WA15 too. May be something wrong? [4] // Problem 1537. Ents 3 Mar 2007 15:39

Thanks, AlMag!

Narek Saribekyan Re: WA15 too. May be something wrong? [3] // Problem 1537. Ents 3 Mar 2007 15:42

Sorry

Edited by author 03.03.2007 15:44

Narek Saribekyan Re: WA15 too. May be something wrong? [2] // Problem 1537. Ents 3 Mar 2007 15:46

Thanks to AlMag

Piratek-(akaDK) Re: WA15 too. May be something wrong? [1] // Problem 1537. Ents 24 Jul 2007 21:52

Why Wa 15

{$Apptype console}

Const
Find = 12344321;

Type Longint = int64;

Var
a , b : array [1..10000000] of longint;
N , k : longint;

Function Ans(x : longint):longint;
begin
   if b[x] = Find then begin Ans := a[x]; exit; end;
   b[x] := Find;
   if odd(x) then a[x] := Ans(x - 1) else a[x] := (Ans(x div 2) + Ans(x - 1)) mod k;
   Ans := a[x];
end;

Begin
Read(N , K);
// if k = 1 then k := Trunc(1e14);
b[2] := Find; a[2] := 1;
if n < 2 then write(0) else Write(Ans(N));
readln;
readln;
end.

Borisov Oleg Re: WA15 too. May be something wrong? // Problem 1537. Ents 28 Oct 2007 14:19

a[2] := 1 mod K;

Discussion of Problem 1537. Ents