-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path10518.cpp
53 lines (51 loc) · 1.08 KB
/
10518.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
#include <iostream>
using namespace std;
void mulMatrix(long long a[][2],long long b[][2],long long p)
{
long long c[2][2];
for(int i=0;i<2;i++)
{
for(int j=0;j<2;j++)
{
c[i][j]=0;
for(int k=0;k<2;k++)
{
c[i][j]=(c[i][j]+(a[i][k]*b[k][j])%p)%p;
}
}
}
for(int i=0;i<2;i++)
{
for(int j=0;j<2;j++)
a[i][j]=c[i][j];
}
}
long long fib(long long k,long long p)
{
long long matrix[2][2],ans[2][2];
ans[0][0]=ans[0][1]=ans[1][0]=matrix[0][0]=matrix[0][1]=matrix[1][0]=1;
matrix[1][1]=ans[1][1]=0;
while(k)
{
if(k&1)
{
mulMatrix(ans,matrix,p);
}
k>>=1;
mulMatrix(matrix,matrix,p);
}
return ans[1][0];
}
int main()
{
long long n,b;
int kase(0);
while(cin>>n>>b)
{
if(!n&&!b)
break;
long long f=fib(n,b);
cout<<"Case "<<++kase<<": "<<n<<" "<<b<<" "<<(f*2-1+b)%b<<endl;
}
return 0;
}