这是我写的 public static int t; public static int n; public static void main(String[] args) { Scanner scanner=new Scanner(System.in); t = scanner.nextInt(); n=scanner.nextInt(); int[][] ints=new int[n][2]; while (t>0){ for (int i = 0; i < n; i++) { ints[i][0]=scanner.nextInt(); ints[i][1]=scanner.nextInt(); } System.out.println(); isInt(ints); t--; } } public static void isInt(int[][] ints) { int fm=1,fz=0; for (int i = 0; i < n; i++) { if (fm%ints[i][1]!=0){ fm*=ints[i][1]; fz=(fz*ints[i][1])+((fm/ints[i][1])*ints[i][0]); }else { fz+=(fm/ints[i][1])*ints[i][0]; } } if (fz==fm) { System.out.print("YES"); } else { System.out.print("NO"); } }