题目内容
（请给出正确答案）
A.mc.data[i][j] += data[k][j] * ma.data[i][k];
B. mc.data[i][j] += data[k][i] * ma.data[j][k];
C. mc.data[i][j] += data[j][k] * ma.data[k][i];
D. mc.data[i][j] += data[i][k] * ma.data[k][j];
如果结果不匹配，请 联系老师 获取答案
更多“下列选项中，能填入空白处5的代码是（)A. mc.data[…”相关的问题
A.index = rd.nextInt();
B. index = rd.nextInt(5);
C. index = rd.nextInt(len + 1);
D. index = rd.nextInt(len);
A.flags[i] = true;
B. flags[i] = false;
C. flags[index] = true;
D. flags[index] = false;
A.cols != ma.cols
B. rows != ma.cols
C. rows != ma.rows
D. cols != ma.rows
A.dataStr.length != (rows-1) * (cols-1)
B. dataStr.length != (rows-1) * cols
C. dataStr.length != rows * cols
D. dataStr.length != rows * (cols-1)
下列选项中，能填入空白处2的代码是()
A. data[i % cols][i / cols] = Double.parseDouble(dataStr[i]);
B. data[i/cols][i % cols] = Double.parseDouble(dataStr[i]);
C. data[i/ rows][i % rows] = Double.parseDouble(dataStr[i]);
D. data[i % rows][i /rows] = Double.parseDouble(dataStr[i]);
A.chs[i] = letters[index];
B. chs[i] = letters[i];
C. chs[index] = letters[i];
D. chs[index] = letters[index];
A.int k = 0; k < cols; k++
B. int k = 0; k
C. int k = 0; k
D. int k = 0; k
A.int s = 0, n1 = n; while （n1 > 0） { int t = n1 % 10; s += t * t * t; n1 /= 10; }
B.int s = 0, n1 = n; while （n1 > 0） { int t = n1 / 10; s+= t * t * t; n1 %= 10; }
C.int n1,s; for（n1 = n; n1>0; n1 /= 10） { int t = n1%10; s += t * t * t; }
D.int n1,s = 0; for（n1 = n; n1>0; n1 %= 10） { int t = n1 / 10; s += t * t * t; }
