wust_cyl的博客

问题描述:已知 F（n）=3 * F（n-1）+2 * F（n-2）+7 * F（n-3），n>=3，其中F（0）=1，F（1）=3，F（2）=5，对于给定的每个n，输出F（0）+ F（1）+ …… + F（n） mod 2009。Input第一行是一整数m，代表总共有m个cases。Output对于每个case，输出一行。格式见样例，冒号后有一个空格。

问题描述:Our bear's forest has a checkered field. The checkered field is an n × n table, the rows are numbered from 1 to n from top to bottom, the columns are numbered from 1 to n from left to right

问题描述:We define a sequence  F⋅ F0=0,F1=1;⋅ Fn=Fn−1+Fn−2 (n≥2).Give you an integer k, if a positive number n can be expressed byn=Fa1+Fa2+...+Fak where 0≤a1≤a2≤⋯≤ak this positive numbe

问题描述:A sequence S n is defined as:Sn=[(a+sqrt(b))^(n)] % m,其中[ ] 表示向下取整.Input　There are several test cases, each test case in one line contains four positive integers: a, b, n, m. Where 015,

问题描述:Dumbear likes to play the Chinese Rings (Baguenaudier). It’s a game played with nine rings on a bar. The rules of this game are very simple: At first, the nine rings are all on the bar. The f

问题描述:M斐波那契数列F[n]是一种整数数列，它的定义如下： F[0] = a F[1] = b F[n] = F[n-1] * F[n-2] ( n > 1 ) 现在给出a, b, n，你能求出F[n]的值吗？Input输入包含多组测试数据； 每组数据占一行，包含3个整数a, b, n（ 0 Output对每组测试数据请输出一个整

问题描述:一句话题目:让你求(sqrt(2)+sqrt(3))^(2*n) mod 1024.InputThe first line of input gives the number of cases, T. T test cases follow, each on a separate line. Each test case contains one positive int

问题描述:Panda has received an assignment of painting a line of blocks. Since Panda is such an intelligent boy, he starts to think of a math problem of painting. Suppose there are N blocks in a line and

问题描述:数列A满足An = An-1 + An-2 + An-3, n >= 3 ,编写程序，给定A0, A1 和 A2, 计算A99Input输入包含多行数据 每行数据包含3个整数A0, A1, A2 (0 数据以EOF结束Output对于输入的每一行输出A99的值Sample Input1 1 1Sample Output

题目来源:点击打开链接题目题意:题目给我们n个数和r次操作。接在输入n行，表示每次将第i个数变成它后面几个位置的和。重复r次。题目分析:我们按照题目的输入构造01矩阵，0表示不加上这个数，1表示加上。然后矩阵快速幂加速。代码如下:#include#include#include#includeusing namespace std;const int mod=1000;