You are viewing a single comment's thread. Return to all comments →
I am missing something why is below two pieces of code different
count += rem[k/2] * (k%2 == 0) ? (rem[k/2] - 1) / 2 : rem[k/2] - i;
and
if( k%2 == 0) count += (rem[k/2] * (rem[k/2]-1)) / 2; else count += rem[k/2] * (rem[k-i]);
Seems like cookies are disabled on this browser, please enable them to open this website
Divisible Sum Pairs
You are viewing a single comment's thread. Return to all comments →
I am missing something why is below two pieces of code different
and