import java.util.Scanner;
class LU{
public static void main(String[] args){
CT317_LU t=new CT317_LU();
t.LU_Factorize();
}
}

class CT317_LU{
private int i,j,k,n,size=15;
private double[][] A=new double[size][size];
private double[][] L=new double[size][size];
private double[][] U=new double[size][size];
private double[] B=new double[size];
private double[] X=new double[size];
private double[] Y=new double[size];
double sum=0;
Scanner sc=new Scanner(System.in);
public void LU_Factorize(){
System.out.print(“Dimension of matrix A (n) = “);
n=sc.nextInt();

//get matrix A from user.
System.out.println(“\nEnter elements of matrix A (coefficient of x) :”);
for (i = 0; i < n; i++){
for (j = 0; j < n; j++){
System.out.print(“A” + i + j + ” = “);
A[i][j]=sc.nextDouble();
} //end for j.
} //end for i.
//get matrix B from user.
System.out.println(“\nEnter elements of matrix B (result of the right hand side) :”);
for (i = 0; i < n; i++)
{
System.out.print(“B” + i + ” = “);
B[i]=sc.nextDouble();
} //end for i.

//matrix A = LU.
//set known elements of matrix L,U.
for (i = 0; i < n; i++)
{
for (j = 0; j j)
U[i][j] = 0;
else
{
if (i < j)
L[i][j] = 0;
else //case i = j
L[i][j] = 1;
} //end if.
} //end for j.
} //end for i.

//compute other elements of matrix L,U.
for (i = 0; i < n; i++)
{
for (j = 0; j < n; j++)
{
if (j < i)
{
if (U[j][j] == 0)
{
System.out.println(“\nCannot find solutions becuase cannot devide by 0.” );
return;
} //end if.
sum = 0.0;
for (k = 0; k = i.
{
sum = 0.0;
for (k = 0; k < i; k++)
sum = sum + (L[i][k]*U[k][j]);
U[i][j] = A[i][j] – sum;
} //end else.
} //end for j.
} //end for i.

//display matrix L.
System.out.println(“\nMatrix L :”);
for (i = 0; i < n; i++)
{
for (j = 0; j < n; j++)
System.out.print(L[i][j]+”\t”);
System.out.print(“\n”);
}
//display matrix U.
System.out.println(“\nMatrix U :” );
for (i = 0; i < n; i++)
{
for (j = 0; j < n; j++)
System.out.print(U[i][j]+”\t”);
System.out.print(“\n”);
}
//matrix AX = B
//matrix (LU)X = B
//matrix L(UX) = B
//matrix L(Y) = B
//compute y[i] from L(Y)= B by forward substitution.
Y[0] = B[0];
for (i = 1; i < n; i++)
{
sum = 0.0;
for (j = 0; j = 0; i–)
{
sum = 0.0;
for (j = i; j < n; j++)
sum = sum + (U[i][j]*X[j]);
X[i] = (Y[i] – sum)/U[i][i];
}

//display result(y).
System.out.println(“\nResult(y) :”);
for (i = 0; i < n; i++)
System.out.println(“Y” + i + ” = ” + Y[i]);

//display solutions(x).
System.out.println(“\nSolution(x) :”);
for (i = 0; i < n; i++)
System.out.println(“X” + i + ” = ” + X[i]);
}

}

call ReadInt

mov ebx, eax

call ReadInt

IMUL ebx

call WriteInt

ซึ่งเหมือนกันเลยครับ ส่วนตกแต่งใครจะทำอย่างไรก็ได้ ผมว่านะ

+++Spore+++

TITLE (Multipli.asm)
Include Irvine32.inc
.stack 64
.data
txt1 byte “MULTIPLICAND : “,0
txt2 byte “Program Multiply Two Integers”,0
txt3 byte “MULTIPLIER : “,0
txt4 byte “PRODUCT :”,0
txt5 byte “RUN AGAIN (y/n):”,0

.code
PRINT MACRO TXT
LEA EDX,TXT
CALL WriteString
ENDM
SETCUR MACRO ROW,COL
MOV DH,ROW
MOV DL,COL
CALL gotoXY
ENDM

main PROC
Start: call Clrscr
SETCUR 10,20
PRINT txt2
CALL CRLF
SETCUR 11,20
PRINT txt1
CALL ReadInt
mov ebx, eax

SETCUR 12,20
PRINT txt3
CALL ReadInt
IMUL ebx

SETCUR 13,20
PRINT txt4
call WriteInt

SETCUR 15,20
PRINT TXT5
call ReadChar
cmp al,’y’
je Start
exit
main ENDP
END main