Waste less time on Facebook — follow Brilliant.
×

Coding

need help...!!! There is a set with N element, the N element consist of k type of object. that is n1 of first type object, n2 second type object, ..., n(k-1) (k-1)th object and the remainder is zero. How many possible way to arrange the element of this set in a row such that the different between two row that we arrange is exactly d element, specially for d=2. "sorry for my english"

Note by Defri Ahmad
4 years, 4 months ago

No vote yet
4 votes

Comments

Sort by:

Top Newest

--_-- ; :D Defri Ahmad · 4 years, 4 months ago

Log in to reply

any one help me please... Defri Ahmad · 4 years, 4 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...