Quantcast
Channel: CodeChef Discuss - latest questions
Viewing all articles
Browse latest Browse all 39796

minimun sum

$
0
0

given a N*N matrix .. we have to choose N-1 elements elements such that all from diffrent row and diffrent column. and sum of elements are minimized.. any problem releted to this in codechef will also be helpful.or editorial of that problem..


Viewing all articles
Browse latest Browse all 39796

Trending Articles



<script src="https://jsc.adskeeper.com/r/s/rssing.com.1596347.js" async> </script>