标签：pac div http blog printf i++ can nbsp acm
http://acm.xidian.edu.cn/problem.php?id=1115
x^n+y^n = (x^(n-1)+y^(n-1))*(x+y)-(x^(n-2)+y^(n-2))*x*y。
中间多加几个%MOD。
#include<iostream> #include<cstring> #include<cstdio> #include<algorithm> #include<cmath> #define MOD 1000000007 using namespace std; int a,b,n; long long ans[10005]; int main() { ans[0] = 2; while(~scanf("%d%d%d",&a,&b,&n)) { ans[1] = a; for(int i = 2;i <= n;i++) ans[i] = ((ans[i-1]*a-ans[i-2]*b%MOD)+MOD)%MOD; printf("%lld\n",ans[n]); } return 0; }
标签：pac div http blog printf i++ can nbsp acm
原文地址：http://www.cnblogs.com/zhurb/p/6034625.html
