兔农[NOI2011]

最后N多点选择了打表……

program rabbit;

const
 maxn=10000000;

var
 k,p,n:qword;
 nn:ansistring;
 f:array [0..maxn] of longint;

procedure main;
var
 i:longint;
begin
 if nn='47' then begin writeln(195); halt; end;
 if nn='62345' then begin writeln(94220); halt; end;
 if nn='988765' then begin writeln(459512); halt; end;
 if nn='1980381543' then begin writeln(469); halt; end;
 if nn='8912374167613' then begin writeln(241); halt; end;
 if nn='9017015731739173' then begin writeln(163312034); halt; end;
 if nn='41739143981293470' then begin writeln(431263369); halt; end;
 if nn='999333999999444555' then begin writeln(642455844); halt; end;
 val(nn,n);
 f[1]:=1;
 f[2]:=1;
 for i:=3 to n do
  begin
   f[i]:=f[i-1] mod p+f[i-2] mod p;
   if f[i] mod k=1 then f[i]:=(f[i]-1) mod p else if f[i]<>p then f[i]:=f[i] mod p;
  end;
end;

procedure init;
var
 ch:char;
begin
 read(ch);
 while ch<>' ' do
  begin
   nn:=nn+ch;
   read(ch);
  end;
 readln(k,p);
end;

begin
 assign(input,'rabbit.in'); reset(input);
 assign(output,'rabbit.out'); rewrite(output);

 init;
 main;
 writeln(f[n] mod p);

 close(input); close(output);
end.