摘要: 链接:https://blog.csdn.net/g_congratulation/article/details/52734306 对于矩阵乘法与递推式之间的关系: 如:在斐波那契数列之中 fi[i] = 1*fi[i-1]+1*fi[i-2] fi[i-1] = 1*f[i-1] + 0*f[i 阅读全文
posted @ 2018-04-15 15:58 jealous-boy 阅读(148) 评论(0) 推荐(0)
摘要: 题目链接:51Nod 1242 斐波那契数列的第N项 斐波那契数列的定义如下: F(0) = 0 F(1) = 1 F(n) = F(n - 1) + F(n - 2) (n >= 2) (1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, …) 阅读全文
posted @ 2018-04-12 20:05 jealous-boy 阅读(161) 评论(0) 推荐(0)
摘要: 链接:https://www.51nod.com/onlineJudge/questionCode.html#!problemId=1179 题目来源: SGU 基准时间限制:1 秒 空间限制:131072 KB 分值: 40 难度:4级算法题 题目来源: SGU 基准时间限制:1 秒 空间限制:1 阅读全文
posted @ 2018-04-10 18:56 jealous-boy 阅读(201) 评论(0) 推荐(0)
摘要: VJ上交题地址:https://vjudge.net/problem/UVA-401 Description A regular palindrome is a string of numbers or letters that is the same forward as backward. Fo 阅读全文
posted @ 2018-04-09 20:47 jealous-boy 阅读(240) 评论(0) 推荐(0)
摘要: 注意题意就没有什么问题。 https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=94&page=show_problem&problem=430 #include<stdio.h>#include 阅读全文
posted @ 2018-04-03 19:37 jealous-boy 阅读(87) 评论(0) 推荐(0)