https://www.codechef.com/LRNDSA07/problems/GDSUB

[pie_3]

CodeChef: Practical coding for everyone

Can anyone help me with this problem?

[ssjgz]

GDSUB - Editorial

PROBLEM LINKS : Contest : Division 1 Contest : Division 2 Practice Setter : Naman Bansal Tester : Istvan Nagy Editorialist : Anand Jaisingh DIFFICULTY : Easy PREREQUISITES : Basic Dynamic Programming PROBLEM : You are given a sequence of integers of length N, consisting of \approx 1000 distinct values. Now, you need to find the number of subsequence of length K of this sequence, such that each pair of elements in the selected subsequence is pair-wise distinct. QUICK EXPLANATION : A q…

[pie_3]

thanks sir