题意:给以你一个递推公式,f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.求f(n)。
方法:大体一看感觉和F序列相同,但是用递归发现栈溢出,用循环发现内存超限。这才发现不是想象中的水题。无奈问了下度娘,发现结果是49一循环,所以改了一下AC。
附上所有代码。
AC:
#include <iostream>
#include <iomanip>
#include <string>
#include <cstring>
#include <cstdio>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>
#include <ctime>
using namespace std;
int buf[60];
int main()
{
#ifdef Local
freopen("a.in", "r", stdin);
#endif
int A = 0, B = 0, n = 0;
while (cin >> A >> B >> n && A+B+n)
{
n %= 48;
if (1 == n || 2 == n)
cout << 1 << endl;
else
{
buf[0] = buf[1] = 1;
for (int i = 2; i < n; i++)
buf[i] = (A*buf[i-1] + B*buf[i-2]) % 7;
cout << buf[n-1] << endl;
}
}
return 0;
}
栈溢出:
#include <iostream>
#include <iomanip>
#include <string>
#include <cstring>
#include <cstdio>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>
#include <ctime>
using namespace std;
long long int fun(int n, int A, int B)
{
if (1 == n || 2 == n)
return 1;
else
return (A*fun(n-1, A, B) + B*fun(n-2, A, B)) % 7;
}
int main()
{
#ifdef Local
freopen("a.in", "r", stdin);
#endif
int A = 0, B = 0, n = 0;
while (cin >> A >> B >> n && A+B+n)
{
long long int ans = fun(n, A, B);
cout << ans << endl;
}
}
内存超限:
#include <iostream>
#include <iomanip>
#include <string>
#include <cstring>
#include <cstdio>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>
#include <ctime>
using namespace std;
int buf[10000000];
int main()
{
#ifdef Local
freopen("a.in", "r", stdin);
#endif
int A = 0, B = 0, n = 0;
while (cin >> A >> B >> n && A+B+n)
{
if (1 == n || 2 == n)
cout << 1 << endl;
else
{
buf[0] = buf[1] = 1;
for (int i = 2; i < n; i++)
buf[i] = (A*buf[i-1] + B*buf[i-2]) % 7;
cout << buf[n-1] << endl;
}
}
return 0;
}
虽然前两次WA了,但是还是贴出来吧,大晚上的旁边也木有草稿纸。。(懒了不想拿),还是应该贯彻那句话,不卡你个几天不要百度,罪过罪过。以为HDOJ水题多,大错特错,前几题就这么有水平,栽了。。