You are viewing a single comment's thread. Return to all comments →
I have a question.
for (int i=1; i<=k/2 && i!=k; i++) sum += m[i]*m[k-i];
Here, m[i] seems not to have information about the order. Does it meet the constraint of i<j ? Looks like it does not tell (1,5) and (5,1).
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 have a question.
Here, m[i] seems not to have information about the order.
Does it meet the constraint of i<j ?
Looks like it does not tell (1,5) and (5,1).