摘要：
This is a problem from ZOJ 2432.To make it easyer,you just need output the length of the subsequence. InputEach sequence is described with M - its len 阅读全文
摘要：
题目链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3755 题目大意： 意思不难理解，就是找到以某个字符串为前缀的最小的斐波拉契数列，并输出是第几个 阅读全文