# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
9275 | myungwoo | Phibonacci (kriii2_P) | C++14 | 0 ms | 1088 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<stdio.h>
#define mod 1000000007
typedef long long lld;
struct term {
lld a, b;
term operator* (const term& c){
term k;
k.a = a*c.b+b*c.a, k.b = b*c.b;
k.a += a*c.a, k.b += a*c.a;
return k;
}
term operator% (const lld c){
term k;
k.a%=c, k.b%=c;
return k;
}
}pn, pnk, dap;
struct MAT{
lld m[2][2];
MAT operator * (const MAT &ot)const{
MAT ret={0, };
int i, j, k;
for (i=0;i<2;i++) for (j=0;j<2;j++) for (k=0;k<2;k++)
ret.m[i][j] = (ret.m[i][j]+(lld)m[i][k]*ot.m[k][j]%mod)%mod;
return ret;
}
} P[40];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |