int [][]MULTIPLICATION_TABLE = new int [10][10];
int n=1;
while (n<11) {
int k =1;
MULTIPLICATION_TABLE[0][1]=k;
while (k<11){
int z=n;
z=z*k;
MULTIPLICATION_TABLE[1][0]=z;
System.out.print(MULTIPLICATION_TABLE[1][0]+" ");
k++;
}
System.out.println();
n++;
}
package en.javarush.task.pro.task05.task0509;
/*
Multiplication table
*/
public class Solution {
public static int[][] MULTIPLICATION_TABLE;
public static void main(String[] args) {
int [][]MULTIPLICATION_TABLE = new int [10][10]; //create 2 dim.array MULTIPLICATION_TABLE
int n=1; //nomer dlea verticali
while (n<11) { // n=1 , n=2, n=3, ... verticali
int k =1; //nomer dlea gorizontali
MULTIPLICATION_TABLE[0][1]=k;
while (k<11){ // k=1, k=2, k=3 , ... gorizontali
int z=n; //z=nomer dlea umnojeniia
z=z*k; //vivotisa sled. number z=1*1, z=1*2, z=1*3, ...
MULTIPLICATION_TABLE[1][0]=z;
System.out.print(MULTIPLICATION_TABLE[1][0]+" "); // vivodit gorizontali
k++; //sled.gorizontalinaia stroka ++
}
System.out.println(); //perehodit na sled. stroku
n++; //sled. verticalinaia stroka ++
}
}
}