Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- using namespace std;
- long long m=10000000007;
- long long FibonacciMod(long long n){
- int a1 = 1, a2 = 1;
- if(n==1||n==2) return 1;
- long long i=3,a;
- while(i<=n){
- a=a1+a2;
- a1=a2;
- a2=a;
- i++;
- }
- return a;
- }
- int main(){
- long long t;
- cin>>t;
- while(t--){
- long long n;
- cin>>n;
- cout<< FibonacciMod(n%m)<< endl;
- }
- return 1;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement