ZSTU 3194 复数的幂 二分幂

#include <cstdio>
#include <cstring>
#define LL __int64
LL a, b, n, mod;
struct complex
{
LL a, b;
complex(){}
complex(LL a, LL b):a(a%mod),b(b%mod){}
complex operator *(const complex &p)
{
return complex((a*p.a-b*p.b)%mod, (a*p.b+b*p.a)%mod);
}
};
void gao(LL n, complex &p)
{
if(n == 1)
{
p = complex(a%mod, b%mod);
return;
}
complex q;
gao(n>>1, q);
p = q * q;
if(n & 1)
{
complex t = complex(a%mod, b%mod);
p = p * t;
}
}
int main()
{
int i, j;
while( ~scanf("%I64d%I64d%I64d%I64d", &a, &b, &n, &mod))
{
if(!n)
{
printf("1 0\n");
continue;
}
complex p;
gao(n, p);
if(p.a < 0) p.a += mod;
if(p.b < 0) p.b += mod;
printf("%I64d %I64d\n", p.a, p.b);
}
return 0;
}