Submission #54 :: njudge

2021-01-09 15:47:37

pascal

Accepted 40/40

10ms

8280 KiB

Program torony;
  const maxn=1000000;
        maradek=20210108;
  var n: integer;
      t: array[1..maxn] of integer;
      i: integer;
      
   Function tt(n: integer): integer;
   begin
     if t[n]<0 then
     begin
       if n=1 then t[n]:=0
       else if n=2 then t[n]:=2
       else if n=3 then t[n]:=2
       else t[n]:=(2*tt(n-2)+2*tt(n-3)) mod maradek;
     end;
     tt:=t[n];
   end;
begin
  readln(n);
  for i:=1 to n do t[i]:=-1;
  writeln(tt(n));
end.

	Sum	Test	Verdict		Time	Memory
base	40/40
		1	Accepted	0/0	1ms	1124 KiB
		2	Accepted	0/0	1ms	1120 KiB
		3	Accepted	2/2	1ms	1088 KiB
		4	Accepted	2/2	1ms	1088 KiB
		5	Accepted	3/3	1ms	1096 KiB
		6	Accepted	3/3	1ms	1228 KiB
		7	Accepted	3/3	10ms	8280 KiB
		8	Accepted	3/3	6ms	5256 KiB
		9	Accepted	3/3	1ms	1176 KiB
		10	Accepted	3/3	1ms	1248 KiB
		11	Accepted	3/3	8ms	8036 KiB
		12	Accepted	3/3	8ms	7832 KiB
		13	Accepted	4/4	8ms	7300 KiB
		14	Accepted	4/4	8ms	5796 KiB
		15	Accepted	2/2	1ms	1264 KiB
		16	Accepted	2/2	1ms	1136 KiB