SEREJA AND LCM https://www.codechef.com/problems/SEALCM

#1

i couldnt understand the problem statement(this is given in the pdf as well) can someone give a small testcase and explain??

#2

@shameek.agarwal
So the problem is :
You are given a integer N. which is the number of elements of the array.
You are given a integer M, each element of the array has to be >=1 and <=M.
The LCM of the proposed array should be be divisible by D i.e the LCM should be the multiple of D.
you will calculate your answer for D=L , L+1 , … R-1,R and get the sum of all the answers and print them.
Explaining the test case would be quite difficult since the number of such possible arrays are quite large.

1 Like
#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.