CODEVS1281 Xn数列 (矩阵乘法+快速乘)

真是道坑题，数据范围如此大。

首先构造矩阵 [ f[0] , 1] * [ a,0 ] ^n= [ f[n],1 ]

[ c,1 ]

注意到m, a, c, x0, n, g<=10^18，所以要有类似于二进制分解的方法进行快速乘，防止爆范围。

Program CODEVS1281;
type arr=array[..,..] of int64;
Program CODEVS1281;
var a,b:arr;
    m,k1,k2,x0,n,mo,p:int64;
function quick(x,y:int64):int64;
var ans:int64;
begin
  ans:=;
  while y> do
    begin
      if y mod = then ans:=(ans+x) mod m;
      y:=y div ;
      x:=x* mod m;
    end;
    exit(ans);
end;
operator *(a,b:arr) c:arr;
var i,j,k:longint;
    sum:int64;
begin
  fillchar(c,sizeof(c),);
  for i:= to  do
    for j:= to  do
      begin
        sum:=;
        for k:= to  do
          sum:=(sum+quick(a[i,k],b[k,j]))mod m;
        c[i,j]:=sum;
      end;
  exit(c);
end;
begin
  readln(m,k1,k2,x0,n,mo);
  a[,]:=; a[,]:=; a[,]:=; a[,]:=;
  b[,]:=k1; b[,]:=; b[,]:=k2; b[,]:=;
  while n> do
    begin
      if n mod = then a:=a*b;
      n:=n div ;
      b:=b*b;
    end;
  writeln((quick(x0,a[,])+a[,]) mod m mod mo);
 
end.