Advertisement
Dang_Quan_10_Tin

WPUMPS (CSPTST 2022-2023)

Oct 4th, 2022 (edited)
124
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.38 KB | None | 0 0
  1. #define task "WPUMPS"
  2. #include <iostream>
  3. #include <cstdio>
  4.  
  5. using namespace std;
  6.  
  7. using ll = long long;
  8. using ld = long double;
  9.  
  10. constexpr int N = 3e3 + 5;
  11. constexpr ll mod = 1e9 + 7;
  12. int n, m;
  13. ll a[N], b[N];
  14. ll rgt[N];
  15.  
  16. void Read()
  17. {
  18.     cin >> n;
  19.  
  20.     for (int i = 1; i <= n; ++i)
  21.         cin >> a[i];
  22.  
  23.     cin >> m;
  24. }
  25.  
  26. ll C(int k, int n)
  27. {
  28.     if (k > n)
  29.         return 0;
  30.  
  31.     ll ans = rgt[k];
  32.  
  33.     for (int i = 0; i < k; ++i)
  34.         ans = ans * (n - i) % mod;
  35.  
  36.     return ans;
  37. }
  38.  
  39. ll Cal(int m, int n)
  40. {
  41.     return C(min(n - 1, m - 1), m + n - 2);
  42. }
  43.  
  44. ll Pow(ll a, ll b)
  45. {
  46.     ll ans(1);
  47.  
  48.     for (; b; b >>= 1)
  49.     {
  50.         if (b & 1)
  51.             ans = ans * a % mod;
  52.         a = a * a % mod;
  53.     }
  54.  
  55.     return ans;
  56. }
  57.  
  58. void Solve()
  59. {
  60.     rgt[0] = 1;
  61.  
  62.     for (int i = 1; i <= n + 1; ++i)
  63.         rgt[i] = rgt[i - 1] * Pow(i, mod - 2) % mod;
  64.  
  65.     for (int i = 1; i <= n; ++i)
  66.     {
  67.         ll v = Cal(m, i);
  68.  
  69.         for (int j = 1; j + i - 1 <= n; ++j)
  70.             (b[j + i - 1] += a[j] * v) %= mod;
  71.     }
  72.  
  73.     for (int i = 1; i <= n; ++i)
  74.         cout << b[i] << " ";
  75. }
  76.  
  77. int32_t main()
  78. {
  79.     ios_base::sync_with_stdio(0);
  80.     cin.tie(0);
  81.     cout.tie(0);
  82.  
  83.     if (fopen(task ".INP", "r"))
  84.     {
  85.         freopen(task ".INP", "r", stdin);
  86.         freopen(task ".OUT", "w", stdout);
  87.     }
  88.  
  89.     Read();
  90.     Solve();
  91. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement