We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Mathematics
  3. Fundamentals
  4. Matrix Tracing
  5. Discussions

Matrix Tracing

  • [deleted] + 1 comment

    Prerequisites to solve this problem

    1.fast exponentiation

    #define ll long long int
#define mod %1000000007
ll fastexpo(ll a, ll n)
{
    ll ret=1;
    ll b=a;
    while(n)
    {
        if(n&1)ret=(ret*b)mod;  //if(n==odd)	
        b=(b*b)mod;		
        n>>=1; 			// n/=2
    }
    return (ll)ret;
}

    2.X^(-1) mod(p) can be written as X^(p-2) mod(p)