UVA 10655 Contemplation! Algebra
Given the value of a+b and ab you will have to find the value of an+bn
Input
The input file contains several lines of inputs. Each line except the last line contains 3 non-negative integers p, q and n. Here p denotes the value of a+b and q denotes the value of ab. Input is terminated by a line containing only two zeroes. This line should not be processed. Each number in the input file fits in a signed 32-bit integer. There will be no such input so that you have to find the value of 00.
Output
For each line of input except the last one produce one line of output. This line contains the value of an+bn. You can always assume that an+bnfits in a signed 64-bit integer.
可以推出a ^ n + b ^ n = (a + b)[a ^ ( n - 1) + b ^ (n - 1)] - ab[a ^ (n - 2) + b ^ (n - 2)]
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 | #include <cstdio> #include <cstring> #include <cmath> #include <vector> #include <iostream> #include <algorithm> using namespace std; #define LL long long struct matrix { LL f[2][2]; }; matrix mul(matrix a,matrix b) { LL i,j,k; matrix c; memset (c.f,0, sizeof (c.f)); for (i=0;i<2;i++) for (j=0;j<2;j++) for (k=0;k<2;k++) c.f[i][j]+=a.f[i][k]*b.f[k][j]; return c; } matrix ksm(matrix e,LL n) { matrix s; s.f[0][0]=s.f[1][1]=1; s.f[0][1]=s.f[1][0]=0; while (n) { if (n&1) s=mul(s,e); e=mul(e,e); n=n>>1; } return s; } matrix e; int main() { LL p,q,n; while (cin>>p>>q>>n) { if (n==0) { cout<<2<<endl; continue ; } e.f[0][0]=p;e.f[0][1]=1; e.f[1][0]=-q;e.f[1][1]=0; e=ksm(e,n-1); LL ans; ans=p*e.f[0][0]+2*e.f[1][0]; cout<<ans<<endl; } return 0; } |
今年输的,明年全都要赢回来
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步