← Back to List

11444번: 피보나치 수 6 ↗

Solutions

C++14
761 B | 761 chars
#include <iostream>
#include <vector>
#define Mod 1000000007
using namespace std;
typedef vector< vector <unsigned long long> > v2;

v2 s = {{1,1},{1,0}};

v2 multi(v2 A, v2 B) {
    v2 ret ={{0,0},{0,0}};
    for(int x =0; x<2; x++)
        for(int y= 0; y<2; y++)
            for(int z=0;z<2; z++) {
                ret[x][y] += (A[x][z] * B[z][y]) % Mod;
                ret[x][y] %= Mod;
            }
    return ret;
}

v2 multiple(unsigned long long N) {
    if(N==1) return s;
    else {
        v2 L = multiple(N/2);
        if(N%2==0) return multi(L,L);
        return multi(s,multi(L,L));
    }
}

unsigned long long N;
int main() {
    cin >> N;
    if(N==0) {
        cout<<0;
        return 0;
    }
    v2 r = multiple(N);
    cout<<r[0][1]%Mod;
}