dsaghjkye的博客

#include<stdio.h>#include<stdlib.h>#include<string.h>#include<algorithm>#include<map>#include<queue>#include<math.h>#include<vector>#include<iostream>using namespace std;typedef long long ll;

Fibonacci数列：F(0)=1 , F(1)=1 , F(n)=F(n-1)+F(n-2)我们以前快速求Fibonacci数列第n项的方法是 构造常系数矩阵（一）   Fibonacci数列f[n]=f[n-1]+f[n-2],f[1]=f[2]=1的第n项快速求法（不考虑高精度）解法：考虑1×2的矩阵【f[n-2],f[n-1]】。根据Fibonacci数列

The Fibonacci sequence is the sequence of numbers such that every element is equal to the sum of the two previous elements, except for the first two elements f0 and f1 which are respectively zero and

An Arc of Dream is a curve defined by following function:where a0 = A0 ai = ai-1*AX+AY b0 = B0 bi = bi-1*BX+BY What is the value of AoD(N) modulo 1,000,000,007?Input There are multiple test cases

Another kind of FibonacciTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 2643 Accepted Submission(s): 1055Problem Description As we all kno

Matrix Power SeriesTime Limit: 3000MS Memory Limit: 131072KTotal Submissions: 22895 Accepted: 9544DescriptionGiven a n × n matrix A and a positive integer k,

Little Q wants to buy a necklace for his girlfriend. Necklaces are single strings composed of multiple red and blue beads.Little Q desperately wants to impress his girlfriend, he knows that she will ...