摘要:
题目链接: poj2070 Fibonacci \(Fibonacci\) 数列有: \(F_0=0, F_1=1, F_n=F_{n-1}+F_{n-2}(n\ge 2)\) . 于是 \[ \begin{align} \begin{pmatrix} F_{n+1} & F_n \\ F_n & 阅读全文
posted @ 2021-01-31 20:00
Zewbie
阅读(116)
评论(0)
推荐(0)
摘要:
A. K-divisible Sum /** * Educational Codeforces Round 103 (Rated for Div. 2) * c++11 */ #include <bits/stdc++.h> using namespace std; typedef long lon 阅读全文
posted @ 2021-01-31 15:45
Zewbie
阅读(150)
评论(0)
推荐(0)