摘要:
#include int main(){ while(1) { int i, n; int maxday, maxvalue = -1; scanf("%d", &n); if (n == 0) break; for ... 阅读全文
摘要:
矩阵快速幂首先我是用暴力DFS算了一下前20项、找到规律F(n)=F(n-1)+F(n-3)+F(n-4)。接下来运用矩阵快速幂。#include#include#include#includeusing namespace std;int n;int m;int R,C;struct Matrix... 阅读全文