Advertisement
a53

palind

a53
Oct 9th, 2018
127
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.05 KB | None | 0 0
  1. #include <iostream>
  2. #define Kmax 10
  3. #define MOD 1000000007
  4. using namespace std;
  5. int c[2][Kmax];
  6.  
  7. void pdcomb(int n) /// folosesc doar doua linii (0 si 1)
  8. {
  9. for(int i=0;i<=Kmax;++i)
  10. c[0][i]=c[1][i]=0;
  11. c[0][0]=c[1][0]=1; /// coloana 0
  12. for(int i=1;i<=n;++i)
  13. {
  14. for(int j=1;j<=i;++j)
  15. c[1][j]=(c[0][j]+c[0][j-1]);
  16. for(int k=0;k<=i;++k)
  17. c[0][k]=c[1][k];
  18. }
  19. }
  20.  
  21. unsigned long long int P(int a,int b)
  22. {
  23. if(b==0)
  24. return 1ULL;
  25. else
  26. if(b%2==0)
  27. return P((1ULL*a*a),b/2);
  28. else
  29. return 1ULL*a*P((a*a),b/2);
  30. }
  31.  
  32. int main()
  33. {
  34. int n,m,k;
  35. unsigned long long int sol;
  36. cin>>n;
  37. while(n--)
  38. {
  39. cin>>m>>k;
  40. if(m%2)
  41. ++m;
  42. pdcomb(k);
  43. if(k==1)
  44. cout<<1<<'\n';
  45. else
  46. {
  47. sol=0;
  48. for(int i=0;k>2*i;++i)
  49. sol+=(1ULL*c[1][i]*P(k-2*i,m));
  50. cout<<(sol/P(2,k-1))%MOD<<'\n';
  51. }
  52. }
  53. return 0;
  54. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement