Java算法---华为oj矩阵乘法

import java.util.Scanner;
/**
 * Created by Administrator on 2015/01/18.
 */
public class Main{
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
         while (sc.hasNext()){
            int Marx1hang=sc.nextInt();
             int Marx1lie2hang=sc.nextInt();
             int Marx2lie=sc.nextInt();
             int[][] Marx1=new int[Marx1hang][Marx1lie2hang];
             int[][] Marx2=new int[Marx1lie2hang][Marx2lie];
             for(int i=0;i