Блог пользователя Spectacular_Lemma

Please Help Me to solve this DP Question !!!
Автор Spectacular_Lemma, история, 15 месяцев назад, По-английски

I request you to share any Idea to solve this Question.

Given an target Integer T , Find all possible arrays of Length N such that product of elements in the array is less than or equal to T. Find ans to the modulo 10^9+7.

Constrains : N<=200 T<=10^9

->array [1,1,2] is considered different from [1,2,1].

Any suggestion or idea (rather than code) will be highly appreciated.

Thank You

  • Проголосовать: нравится
  • 0
  • Проголосовать: не нравится

»
15 месяцев назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится
  1. You will have at most 30 non-one elements.
  2. The resulting multiplication of elements will be N1 * N2 * K, where N1, N2 <= T. After that you can read the editorial for https://codeforces.me/contest/1801/problem/F, and that may help.
→ Ответить