C ++ implementation to find the maximum product of the digit sum of the consecutive pairs of the subsequence of the length K
#include <bits/stdc++.h> NEW_LINE using namespace std ; const int MAX = 100 ; int dp [ 1000 ] [ MAX ] [ MAX ] ;