1.矩阵列求和
import java.util.Scanner;
public class ColumnSum {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int rowNum = input.nextInt();
int columNum = input.nextInt();
int [][]a=new int [rowNum][columNum];
int[] columnSum = new int[columNum];
//请在指定位置填写代码。
for(int i=0;i
2.商品收银
import java.util.Scanner;
public class Goods {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int customerNum = input.nextInt();
int[][] goods = new int[customerNum][];
//请在指定位置填写代码。
for(int i=0;i



