The problem[ [https://mirror.codeforces.com/contest/579/problem:579/D] can be solved using a simple greedy approach by precalculating prefix ors and suffix ors but I wanted to solve it using DP in which we multiply an array element at most K times ranging from 0 to k. But it fails on test 23. ↵
Thanks in advance...↵
my solution : [submission:69268483]
Thanks in advance...↵
my solution : [submission:69268483]