← Back to List

7677번: Fibonacci ↗

Solutions

C++14
904 B | 904 chars
#include <iostream>
#include <vector>

#define Mod 10000

using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef vector< vector <ull> > 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(ull 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));
    }
}

ull getfibo(ull n) {
    if(n==0) return 0;
    v2 ret = multiple(n);
    return ret[0][1]%Mod;

}

ull N;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> N;
    while(N!=-1) {
        cout << getfibo(N)<<"\n";
        cin >> N;
    }
}