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

MPROD-problem lunchtime

$
0
0

I was unable to solve this problem during the contest and after i was going through the submissions.so,i found this code which is coded by @dreamoon4 who is ranked 1 in this contest but i am unable to understand his code.Can anyone explain me what does he mean from the following statement .

REP(i,pn){ int tmp=max(sum[i]%2,ma[i]2-sum[i]); REP(j,tmp)an=(anpp[i])%MOD; }

http://www.codechef.com/viewsolution/3793782


Viewing all articles
Browse latest Browse all 39796

Trending Articles



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