0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-12-25 07:51:58 +00:00
OI-codes/AcWing/205/205.cpp

76 lines
1.2 KiB
C++

#include <cstring>
#include <iostream>
using std::cin;
using std::cout;
const char endl = '\n';
const int N = 10;
const int mod = 10000;
class Matrix {
private:
int data[N][N];
public:
Matrix() {
memset(data, 0x00, sizeof(data));
}
int* operator[](int i) {
return data[i];
}
Matrix operator*(Matrix b) const {
Matrix c;
int n = 2;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
for (int k = 1; k <= n; k++) {
c[i][j] = (c[i][j] + data[i][k] * b[k][j] % mod) % mod;
}
}
}
return c;
}
} base, ans;
Matrix binpow(Matrix a, int k) {
Matrix res;
res[1][1] = 1;
res[1][2] = 1;
while (k) {
if (k & 1) res = res * a;
a = a * a;
k >>= 1;
}
return res;
}
int n;
int main() {
std::ios::sync_with_stdio(false);
while (cin >> n, ~n) {
if (n <= 2) {
cout << !!n << endl;
continue;
}
Matrix tmp;
tmp[1][1] = 1, tmp[1][2] = 1;
tmp[2][1] = 1, tmp[2][2] = 0;
cout << binpow(tmp, n - 2)[1][1] << endl;
}
return 0;
}