Advertisement
Guest User

Untitled

a guest
Feb 20th, 2020
109
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.79 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. #define ll long long
  3. using namespace std;
  4. const int e=1e3+7;
  5. ll f[e];
  6. ll x,y,a,b,mod;
  7. ll dp[e][e];
  8. int main()
  9. {
  10. ll t;
  11. cin>>t;
  12. while(t--)
  13. {
  14. cin>>x>>y>>a>>b>>mod;
  15. f[1]=1;
  16. f[2]=1;
  17. for(ll i=3;i<=500;i++)
  18. {
  19. f[i]=(f[i-1]+f[i-2])%mod;
  20. }
  21. a=a%mod;
  22. b=b%mod;
  23. for(ll i=1;i<=x;i++)
  24. {
  25. dp[i][0]=i;
  26. }
  27. for(ll i=1;i<=y;i++)
  28. {
  29. dp[0][i]=i;
  30. }
  31. for(ll i=1;i<=x;i++)
  32. {
  33. for(ll j=1;j<=y;j++)
  34. {
  35. dp[i][j]=(a*dp[i-1][j]+b*dp[i][j-1]+f[__gcd(i,j)])%mod;
  36. }
  37. }
  38. cout<<dp[x][y]%mod<<endl;
  39. }
  40. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement