相关链接
题目传送门：http://www.lydsy.com/JudgeOnline/problem.php?id=4294
神犇题解：http://www.cnblogs.com/clrs97/p/4854720.html
解题报告
做这题，我们需要有一个前置结论：
Fibonacci数列在$\bmod 10^n$的时候，循环节为$6 \times 10^n$
至于这个结论怎么证明，我也不知道
不过这个结论可以用这里的知识自己搞出来：传送门
那么知道了这个结论之后
我们就可以从低位到高位DFS了
每一层只会尝试$0 \sim 9$，虽然看起来会$T$
不过复杂度是玄学，所以跑得飞快
楼下是疯子。哈哈
Hi there, You have performed a great job. I’ll certainly digg it and for my part suggest to my friends. I’m sure they will be benefited from this website.
This is really interesting, You are a very skilled blogger. I’ve joined your rss feed and look forward to seeking more of your excellent post. Also, I have shared your website in my social networks!