循环
老鼠哎大米
这个作者很懒,什么都没留下…
展开
-
HDU 1005 Number Sequence
Problem Description A number sequence is defined as follows: f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7. Given A, B, and n, you are to calculate the value of f(n).原创 2013-10-22 20:22:57 · 475 阅读 · 0 评论 -
hdu 1015 Safecracker
Problem Description === Op tech briefing, 2002/11/02 06:42 CST === "The item is locked in a Klein safe behind a painting in the second-floor library. Klein safes are extremely rare; most of them,原创 2014-02-10 10:41:13 · 440 阅读 · 0 评论