# Light OJ: 1070 – Algebraic Problem

(These solution idea is form : http://blog.csdn.net/u013532224/article/details/46862465
and LightOj forum.)

```
/*

Solution Idea:

Meaning of the questions:
You p = a + b, q = ab

Calculating (a ^ n + b ^) mod2 ^ 64

practice:

mod 2 ^ 64 so open unsigned long long, llu on the line, reaches the upper limit will be automatically modulo.

Then the formula is. I was pushing the law found in the formula.

a ^ 2 + b ^ 2 = (a + b) * (a + b) -2 * a * b

a ^ 3 + b ^ 3 = (a ^ 2 + b ^ 2) * (a + b) -a * b (a + b)

a ^ 4 + b ^ 4 = (a ^ 3 + b ^ 3) * (a + b) -a * b (a ^ 2 + b ^ 2)

now --

1.a^n + b^n = (a^(n-1)+b^(n-1))*(a+b) - a*b*(a^(n-2)+b^(n-2))

2.  Xn = a^n + b^n

3 . Xn = pXn-1 + qXn-2

(p q)      (Xn-1)         (pXn-1 + qXn-2)         (Xn  )
4.         x               =                      =
(1 0)      (Xn-2)         ( Xn-1 +  0  )          (Xn-1)

5 . from this

(p q)^(n-1)     (X1)     (Xn   )
x          =
(1 0)           (X0)     (Xn-1)

*/

#include &lt;bits/stdc++.h&gt;

#define pii              pair &lt;int,int&gt;
#define pll              pair &lt;long long,long long&gt;
#define sc               scanf
#define pf               printf
#define Pi               2*acos(0.0)
#define ms(a,b)          memset(a, b, sizeof(a))
#define pb(a)            push_back(a)
#define MP               make_pair
#define db               double
#define ll               long long
#define EPS              10E-10
#define ff               first
#define ss               second
#define sqr(x)           (x)*(x)
#define D(x)             cout&lt;&lt;#x &quot; = &quot;&lt;&lt;(x)&lt;&lt;endl
#define VI               vector &lt;int&gt;
#define DBG              pf(&quot;Hi\n&quot;)
#define MOD              1000000007
#define CIN              ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define SZ(a)            (int)a.size()
#define sf(a)            scanf(&quot;%d&quot;,&amp;a)
#define sfl(a)           scanf(&quot;%lld&quot;,&amp;a)
#define sff(a,b)         scanf(&quot;%d %d&quot;,&amp;a,&amp;b)
#define sffl(a,b)        scanf(&quot;%lld %lld&quot;,&amp;a,&amp;b)
#define sfff(a,b,c)      scanf(&quot;%d %d %d&quot;,&amp;a,&amp;b,&amp;c)
#define sfffl(a,b,c)     scanf(&quot;%lld %lld %lld&quot;,&amp;a,&amp;b,&amp;c)
#define stlloop(v)       for(__typeof(v.begin()) it=v.begin();it!=v.end();it++)
#define loop(i,n)        for(int i=0;i&lt;n;i++)
#define loop1(i,n)       for(int i=1;i&lt;=n;i++)
#define REP(i,a,b)       for(int i=a;i&lt;b;i++)
#define RREP(i,a,b)      for(int i=a;i&gt;=b;i--)
#define TEST_CASE(t)     for(int z=1;z&lt;=t;z++)
#define PRINT_CASE       printf(&quot;Case %d: &quot;,z)
#define CASE_PRINT       cout&lt;&lt;&quot;Case &quot;&lt;&lt;z&lt;&lt;&quot;: &quot;
#define all(a)           a.begin(),a.end()
#define intlim           2147483648
#define infinity         (1&lt;&lt;28)
#define ull              unsigned long long
#define gcd(a, b)        __gcd(a, b)
#define lcm(a, b)        ((a)*((b)/gcd(a,b)))

using namespace std;

/*----------------------Graph Moves----------------*/
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1};   // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1};  // Kings Move
//const int fx[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move
//const int fy[]={-1,  1, -2,  2, -2,  2, -1,  1}; // Knights Move
/*------------------------------------------------*/

//int Set(int N,int pos){return N=N | (1&lt;&lt;pos);}
//int reset(int N,int pos){return N= N &amp; ~(1&lt;&lt;pos);}
//bool check(int N,int pos){return (bool)(N &amp; (1&lt;&lt;pos));}
/*------------------------------------------------*/

/*----------------------Matrix-----------------------*/

// int MOD=
// ll MOD=

struct matrix
{
ull mat[2][2];
int row,col;

matrix()
{
memset(mat,0,sizeof mat);
}
matrix(int a, int b)
{
row=a,col=b;
memset(mat,0,sizeof mat);
}

matrix operator*(const matrix &amp;p) const
{
assert(col == p.row);
matrix temp;
temp.row = row;
temp.col = p.col;
for (int i = 0; i &lt; temp.row; i++)
{
for (int j = 0; j &lt; temp.col; j++)
{
ll sum = 0;
for (int k = 0; k &lt;col;  k++)
{
sum += ((mat[i][k]) * (p.mat[k][j]));
//                    sum%=MOD;
}
temp.mat[i][j] = sum;
}
}
return temp;
}
matrix operator+ (const matrix &amp;p) const
{
assert(row==p.row &amp;&amp; col==p.col);
matrix temp;
temp.row=row;
temp.col=col;
for(int i=0;i&lt;temp.row;i++)
{
for(int j=0;j&lt;temp.col;j++)
temp.mat[i][j]=((mat[i][j])+(p.mat[i][j]));
}
return temp;
}

matrix identity()
{
matrix temp;
temp.row=row;
temp.col=col;
for(int i=0;i&lt;row;i++)
temp.mat[i][i]=1;
return temp;
}

matrix pow(ll pow)
{
matrix temp=(*this);
matrix ret=(*this).identity();
while(pow)
{
if(pow % 2==1)
ret=ret*temp;
temp=temp*temp;
pow/=2;
}
return ret;
}

void show()
{
printf(&quot;-----------------------------\n&quot;);
for(int i=0;i&lt;row;i++)
{
for(int j=0;j&lt;col;j++)
printf(&quot;%llu &quot;,mat[i][j]);
printf(&quot;\n&quot;);
}
printf(&quot;-----------------------------\n&quot;);
}

};

/*--------------------------Matrix End---------------------*/

int main()
{

///freopen(&quot;in.txt&quot;,&quot;r&quot;,stdin);
///freopen(&quot;out.txt&quot;,&quot;w&quot;,stdout);

int t;
sf(t);
TEST_CASE(t)
{
ll p,q,n;
sfffl(p,q,n);
matrix base(2,2);
base.mat[0][0]=p;
base.mat[0][1]=-q;
base.mat[1][0]=1;

matrix temp(2,1);
temp.mat[0][0]=p;
temp.mat[1][0]=2;

//        base.show();

base=base.pow(n-1);
//        base.show();
//        temp.show();
base=base*temp;
//        ull ans=(base.mat[0][0]*temp.mat[0][0])-(base.mat[0][1]*temp.mat[1][0]);

//        base.show();

ull ans=base.mat[0][0];

if(n==0) ans=2;

PRINT_CASE;
printf(&quot;%llu\n&quot;,ans);

}

return 0;
}

```
1 1 vote
Article Rating
Subscribe
Notify of