Sareja and gcd test case explanation

general
,
1

hi!
i have one serious doubt on this problem in DEC14 can anyone give me the correct explanation to this problem.

PS: if your answer reveals strategy than plz dont.

1 Like
2

No of ways of picking N elements from the set {1 to M} (also the permutation of numbers should be considered) such that each element can be picked greater than or equal to once and gcd of elements is D .

i think this explains sufficiently .

2 Likes
3

and there can be repitition of numbers

4

@acodebreaker, not only combinations, but also permutations of the selected numbers.

5

i forget that in hurry , thnx , corrected :slight_smile:

6

[2,2,2,4,4] and [4,4,2,2,2] are two different arrays am I right in this case??

7

could you explain the case for d=1???

8

yes, you are right :slight_smile:

9

In SEAGCD large memory has been used by some of the coders. Does that imply that large arrays and data structures
are possible.??

10

think it yourself , no help during the contest