Ankush08's blog

By Ankush08, history, 5 weeks ago, In English

Hi Community , I came across these problems and had absolutely no clue on how to approach these at all. Any guidance or Help would be appreciated .

Problems are attached in image form

P1 : Bruce Banner is interested in number of arrays , A[1] , A[2] , ... A[n](1 <= A[i] <= M , A[i] — integer ) such that LCM of all its elements is divisible by number D. Please find sum of answer to the problems with D = L , D = L+1 .... D = R .

please output it modulo 10^9 + 7 ;

Constraints : n < 5*10^6 1 <= L <= R <= M <= 10000

 
 
 
 
  • Vote: I like it
  • -5
  • Vote: I do not like it

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by Ankush08 (previous revision, new revision, compare).