ACM,再见！

http://acm.hdu.edu.cn/showproblem.php?pid=1021Problem DescriptionThere are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2). InputInp

http://poj.org/problem?id=3744

http://acdream.info/problem?pid=1116Problem Descriptiongive you a string, please output the result of the following function mod 1000000007n is the length of the stringf() is the funct

http://acm.nefu.edu.cn/JudgeOnline/problemshow.php?problem_id=457

代码如下：#include #include #include using namespace std;typedef long long LL;const int N = 2,M=2,P=2;const int MOD=1000000007;struct Matrix{ LL m[N][N];};Matrix A={1,1, 1,0};

题目大意：判断有多少个长度为n的字符串

http://acm.nefu.edu.cn/JudgeOnline/problemshow.php?problem_id=459descriptionLele now is thinking about a simple function f(x).If x < 10 f(x) = x.If x >= 10 f(x) = a0 * f(x-1)

问题描述：给定n个矩阵：A1,A2,...,An，其中Ai与Ai+1是可乘的，i=1，2...，n-1。确定计算矩阵连乘积的计算次序，使得依此次序计算矩阵连乘积需要的数乘次数最少。输入数据为矩阵个数和每个矩阵规模，输出结果为计算矩阵连乘积的计算次序和最少数乘次数。      问题解析：由于矩阵乘法满足结合律，故计算矩阵的连乘积可以有许多不同的计算次序。这种计算次序可以用加括号的方式来确定。

http://acm.nefu.edu.cn/JudgeOnline/problemshow.php

http://poj.org/problem?id=2778DescriptionIt's well known that DNA Sequence is a sequence only contains A, C, T and G, and it's very useful to analyze a segment of DNA Sequence，For example, if

http://acm.hdu.edu.cn/showproblem.php?pid=5015Problem DescriptionIn our daily life we often use 233 to express our feelings. Actually, we may say 2333, 23333, or 233333 ... in the same meani

http://acm.hdu.edu.cn/showproblem.php?pid=4965Problem DescriptionOne day, Alice and Bob felt bored again, Bob knows Alice is a girl who loves math and is just learning something about matrix

http://acm.hit.edu.cn/hoj/problem/view?id=1864

http://poj.org/problem?id=3070

http://acm.hdu.edu.cn/showproblem.php?pid=3117

http://acm.hit.edu.cn/hoj/problem/view?id=2060As we know , the Fibonacci numbers are defined as follows: """"Given two numbers a and b , calculate . """"InputThe input contains s

http://acm.hit.edu.cn/hoj/problem/view?id=2255

http://acm.hdu.edu.cn/showproblem.php?pid=1588

http://acm.hdu.edu.cn/showproblem.php?pid=1757

http://acm.hdu.edu.cn/showproblem.php?pid=3509

http://acm.hdu.edu.cn/showproblem.php?pid=2814Problem DescriptionIn mathematics, the Fibonacci numbers are a sequence of numbers named after Leonardo of Pisa, known as Fibonacci (a contracti

http://acm.hdu.edu.cn/showproblem.php?pid=2243Problem Description背单词，始终是复习英语的重要环节。在荒废了3年大学生涯后，Lele也终于要开始背单词了。一天，Lele在某本单词书上看到了一个根据词根来背单词的方法。比如"ab",放在单词前一般表示"相反，变坏，离去"等。于是Lele想，如果背了N个词根