知足常乐的博客

address ： http://poj.org/problem?id=3070 DescriptionIn the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 2 for n ≥ 2. For example, the first ten terms of the Fibonacci sequence ar

address : http://acm.hdu.edu.cn/showproblem.php?pid=1575Problem Description A为一个方阵，则Tr A表示A的迹（就是主对角线上各项的和），现要求Tr(A^k)%9973。Input 数据的第一行是一个T，表示有T组数据。 每组数据的第一行有n(2 <= n <= 10)和k(2 <= k < 10^9)两个数据。接下来

address : http://acm.hdu.edu.cn/showproblem.php?pid=2604 Problem Description Queues and Priority Queues are data structures which are known to most computer scientists. The Queue occurs often in our

address : http://acm.hdu.edu.cn/showproblem.php?pid=1757 Problem Description Lele now is thinking about a simple function f(x).If x < 10 f(x) = x. If x >= 10 f(x) = a0 * f(x-1) + a1 * f(x-2) + a2 *

address :http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3497In chapter 4 of the game Trails in the Sky SC, Estelle Bright and her friends are crossing Mistwald to meet their final enemy,

传送门：http://acm.hdu.edu.cn/showproblem.php?pid=5690Problem Description F(x,m) 代表一个全是由数字x组成的m位数字。请计算，以下式子是否成立：F(x,m) mod k ≡ cInput 第一行一个整数T，表示T组数据。 每组测试数据占一行，包含四个数字x,m,k,c1≤x≤ 9 1≤m≤ 10100≤c < k ≤ 10