# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
9720 | jaehadad | Phibonacci (kriii2_P) | C++14 | 0 ms | 1676 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<cstdio>
#include<cassert>
#include<cstring>
#include<map>
#include<set>
#include<time.h>
#include<algorithm>
#include<stack>
#include<queue>
#include<utility>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
using namespace std;
typedef vector<vector<long long> > Matrix;
const int MOD = 1000 * 1000 * 1000 + 7;
Matrix operator * (const Matrix& a, const Matrix& b) {
int n = a.size();
Matrix ret(n, vector<long long>(n));
for(int k = 0; k < n; ++k)
for(int i = 0; i < n; ++i)
for(int j = 0; j < n; ++j)
ret[i][j] = (ret[i][j] + a[i][k] * b[k][j]) % MOD;
return ret;
}
Matrix eye(int n) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |