等待戈多 （Java代码）

解题思路:

注意事项:

参考代码:

import java.util.Scanner;

public class Main{

private static int k;

private static int n;

private static double[][] v;

private static int[][] step;

public static void main(String[] args) {

Scanner input=new Scanner(System.in);

       n=input.nextInt();

k=input.nextInt()-1;

  step=new int[n][n]; 

   v=new double[n][n]; 

   for (int i = 0; i < n; i++) {

  for (int j = 0; j <n; j++) {

  step[i][j]=input.nextInt();

}

}

  for (int i = 0; i < n; i++) {

  for (int j = 0; j <n; j++) {

  int t=input.nextInt();

  if(t==0){

  v[i][j]=Double.MAX_VALUE;

  continue;

  }else

  v[i][j]=step[i][j]*1.0/t;

  }

}

  System.out.printf("%.2f",v[0][k]);

}

}