"Or"game(579D) problem 
Difference between en1 and en2, changed 42 character(s)
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]

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English masaow 2020-01-26 09:41:08 42 Tiny change: '/problem/D] can be s' -> '/problem/D[problem:579D]] can be s'
en1 English masaow 2020-01-26 09:38:12 331 Initial revision (published)