一个题:
输入:
t m n -> t组 m * n 的矩阵 grid,
* 每组调用 func(grid) 函数打印出这个矩阵的所有元素和
*
* 输入:
* 3 2 3
* 1 2 3
* 4 5 6
* 7 8 9
* 1 1 1
* 2 2 2
* 3 3 3
* 输出:|23 22 13|
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
while (in.hasNext()) {
int t = in.nextInt();
int m = in.nextInt();
int n = in.nextInt();
int[] res = new int[t];
int index = 0;
while (t > 0) {
t--;
int[][] grid = new int[m][n];
for (int i = 0; i < m; ++i) {
for (int j = 0; j < n; j++) {
grid[i][j] = in.nextInt();
}
}
res[index++] = func(grid);
}
for(int k = 0; k < res.length; k++){
if(k == 0){
System.out.print(res[k]);
}else{
System.out.print(" " + res[k]);
}
}
}
in.close();
}
private static int func(int[][] grid) {
int sum = 0;
for(int i = 0; i < grid.length; i++){
for(int j = 0; j < grid[0].length; j++){
sum += grid[i][j];
}
}
return sum;
}
}