《汇编语言》王爽 实验7
自己想的,比较弱智的方法,供大家一笑
方法1:
按种类写入
assume cs:code, ds:data, ss:table
data segment
db '1975','1976','1977','1978'
dd 16,22,382,1356
dw 3,7,9,13
data ends
table segment
db 4 dup ('year summ ne ?? ')
table ends
code segment
start: mov ax,data
mov ds,ax
mov ax,table
mov ss,ax
mov bx,0 ;ds列
mov si,0 ;ds行
mov bp,0 ;ss列
mov di,0 ;ss行
mov cx,4 ;循环次数
s:
mov ax,ds:[bx+si] ;年份
mov ss:[bp+di],ax
mov ax,ds:[bx+si+2]
mov ss:[bp+di+2],ax
add bx,4
add di,16
loop s
mov bx,0 ;ds列
mov si,16 ;ds行
mov bp,5 ;ss列
mov di,0 ;ss行
mov cx,4 ;循环次数
s0: mov ax,ds:[bx+si] ;总收入
mov ss:[bp+di],ax
mov ax,ds:[bx+si+2]
mov ss:[bp+di+2],ax
add bx,4
add di,16
loop s0
mov bx,0 ;ds列
mov si,32 ;ds行
mov bp,10 ;ss列
mov di,0 ;ss行
mov cx,4 ;循环次数
s1: mov ax,ds:[bx+si] ;雇员人数
mov ss:[bp+di],ax
add bx,2
add di,16
loop s1
mov bp,5 ;ss列
mov di,0 ;ss行
mov cx,4 ;循环次数
s2: mov ax,ss:[bp+di]
mov dx,ss:[bp+di+2]
mov bx,ss:[bp+di+5]
div word ptr bx
mov ss:[bp+di+8],ax
add di,16
loop s2
mov ax,4c00h
int 21h
code ends
end start
方法2:
按行写入
assume cs:codesg,ds:datasg
datasg segment
db '1975','1976','1977','1978','1979','1980','1981','1982','1983'
db '1984','1985','1986','1987','1988','1989','1990','1991','1992'
db '1993','1994','1995'
;年份:4*21=84byte,00h-53h
dd 16,22,382,1356,2390,8000,16000,24486,50065,97479,140417,197514
dd 345980,590827,803530,1183000,1843000,2759000,3753000,4649000,5937000
;收入:4*21=84byte,54h-a7h
dw 3,7,9,13,28,38,130,220,476,778,1001,1442,2258,2793,4037,5635,8226
dw 11542,14430,15257,17800
;人数:2*21=42byte,a8h-d1h
datasg ends
table segment
db 21 dup('year summ ne ?? ')
table ends
codesg segment
start: mov ax,datasg
mov ds,ax
mov ax,table
mov es,ax
mov bx,0 ;ds列
mov si,0 ;ds行
mov bp,0 ;es列
mov di,0 ;es行
mov cx,21
s: mov ax,ds:[bx+si+0] ;年份
mov es:[bp+di+0],ax
mov ax,ds:[bx+si+2]
mov es:[bp+di+2],ax
add si,84
add bp,5
mov ax,ds:[bx+si+0] ;收入
mov es:[bp+di+0],ax
mov ax,ds:[bx+si+2]
mov es:[bp+di+2],ax
add si,84
add bp,5
mov ax,ds:[bx+si+0] ;人数
mov es:[bp+di+0],ax
add di,16
add bx,4
mov si,0
mov bp,0
loop s
mov bp,6 ;计算
mov di,0
mov cx,21
s1: mov ax,es:[bp+di]
mov dx,es:[bp+di+2]
mov bx,es:[bp+di+6]
div word ptr bx
mov es:[bp+di+7],ax
add di,16
loop s1
mov ax,4c00h
int 21h
codesg ends
end start
很多数据自己简化了,开始纠结寄存器不够用,所以栈寄存器也用了,看了别人答案发现是自己脑子不够用