-
Notifications
You must be signed in to change notification settings - Fork 1
/
07677.cpp
41 lines (35 loc) · 844 Bytes
/
07677.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
#include <iostream>
#include <vector>
#define MOD 10000
using namespace std;
using Matrix = vector<vector<int>>;
Matrix matmul(const Matrix& a, const Matrix& b) {
Matrix c(2, vector<int>(2));
for (int i=0; i<2; i++) for (int j=0; j<2; j++) for (int k=0; k<2; k++) {
c[i][j] = (c[i][j] + a[i][k] * b[k][j]) % MOD;
}
return c;
}
Matrix matpow(Matrix base, long long exp) {
Matrix ret(2, vector<int>(2));
for (int i=0; i<2; i++) ret[i][i] = 1;
while (exp) {
if (exp & 1) ret = matmul(ret, base);
base = matmul(base, base);
exp >>= 1;
}
return ret;
}
bool solve(void) {
int n; cin >> n;
if (n == -1) return false;
Matrix ans = matpow({{1, 1}, {1, 0}}, n);
cout << ans[0][1] << "\n";
return true;
}
int main(void) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
while (solve());
return 0;
}