-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathFIBOSUM-21766438-src.cpp
59 lines (59 loc) · 1.15 KB
/
FIBOSUM-21766438-src.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
54
55
56
57
58
59
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#define p 1000000007
using namespace std;
void multiply(vector<long int>* a,vector<long int>* b,int n)
{
vector <long int> output[n],b_[n];int i,j,k;
for(i=0;i<n;i++)for(j=0;j<n;j++){output[i].push_back(a[i][j]);b_[i].push_back(b[i][j]);a[i][j]=0;}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
for(k=0;k<n;k++)a[i][k]=(a[i][k]+(output[i][j]*b_[j][k])%p)%p;
}
}
}
void mat_expo(int n,long int e,vector<long int> *a)
{
int i=0,j=0;
vector <long int> out[n];
vector <long int> tmp[n];
for(i=0;i<n;i++)
{
for(j=0;j<n;j++){out[i].push_back(0); tmp[i].push_back(a[i][j]);}
out[i][i]=1;
}
while(e)
{
if(e&1)multiply(out,tmp,n);
multiply(tmp,tmp,n);
e>>=1;
}
for(i=0;i<n;i++)for(j=0;j<n;j++)a[i][j]=out[i][j];
}
void display(int n,int m,vector<long int> *a)
{
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)cout<<a[i][j]<<" ";
cout<<"\n";
}
}
int main()
{
int t,l,r;long int ans=0;
cin>>t;
while(t--)
{
vector<long int> a[2]={{0,1},{1,1}},b[2]={{0,1},{1,1}};
cin>>l>>r;
mat_expo(2,r+1,a);
mat_expo(2,l,b);
ans=(a[1][1]-b[1][1]+p)%p;
cout<<ans<<"\n";
}
return 0;
}