How to solve GRUMPMA from Dcode19

[sudipt1999]

CodeChef: Practical coding for everyone

Can anybody tell me what approach should we be taking to solve this problem!
Thanks for the help ! Thank you!

[yashpreet1999]

GRUMPMA - Unofficial Editorial

This is an unofficial editorial and I may have complicated or simplified the problem. PROBLEM LINK: Contest Practice DIFFICULTY: Easy PREREQUISITES: Basic DP PROBLEM: You are given an array of N integers and two integers K and M. Find the number of subsequences of the array of length K such that: S[i] % M = i % M (for each i from 1 to k) You need to print the answer modulo (10 ^ 9) + 7 QUICK EXPLANATION: We will maintain an array from 1 to k which will store the value …

Check his editorial its good!

[sudipt1999]

Thanks a lot!

[yashpreet1999]

your welcome

[sachin_yadav]

Hi @sudipt1999
For more explained solution. You can refer to the editorial here at

GRUMPMA - Editorial

PROBLEM LINK: Practice Division1 Division2 Author: Sachin Yadav Tester: Kishen Gowda Editorialist: Dishank Goel DIFFICULTY: EASY PREREQUISITES: Dynamic Programming PROBLEM: Given an array A of N non-negative integers and two integers K and M. Find the number of subsequences of array A of length K which satisfies the following property: Suppose the subsequence is S = S_1S_2 \ldots S_K, then for all i such that 1 \leq i \leq K, S_i \% M = i \% M should hold true, where S_i denotes the…