Considering the elements stored in column order, comment on the LOR and performance of the below code. #define F(i,a,b) for(int i = (int)(a); i <= (int)(b); i++) int main() { int X,Y; //X:number of rows, Y: number of columns X = Y = 10000; //assuming 10000X10000 matrix F(i,1,X-1) { F(j,1,Y-1) { NumWays[i][j] = NumWays[i-1][j] + NumWays[i][j-1]; }} }

Answer rating: 100% (QA)

Answer Not using of 1LL or 1ll when needed A program shows problem if we do... View the full answer