zoukankan      html  css  js  c++  java
  • 王爽汇编 实验13

    1.

    assume cs:code
    
    data segment
     db 'welcome to masm! ',0
    data ends
    
    code segment
    start:
        mov ax,cs
        mov ds,ax
        mov si,offset capital
        mov ax,0
        mov es,ax
        mov di,200h
        mov cx,offset capitalend-offset capital
        cld
        rep movsb
    
        mov ax,0
        mov es,ax
        mov word ptr es:[7ch*4],200h
        mov word ptr es:[7ch*4+2],0
    
        mov dh,10
        mov dl,    10
        mov cl,2
        mov ax,data
        mov ds,ax
        mov si,0
        int 7ch
    
        
        mov ax,4c00h
        int 21h
    
    capital:
        push ax
        push es
        push di
        push si
    
        mov ax,0b800h
        mov es,ax
    
        mov al,0a0h
        mul dh
        mov di,ax
    
        mov al,2
        mul dl
        add di,ax
    
        mov ah,cl
    s:
        mov al,[si]
        cmp al,0
        je ok
    
        mov word ptr es:[di],ax
        add di,2
        inc si
        jmp short s
    ok:
        pop si
        pop di
        pop es
        pop ax
        iret
    
    capitalend:
        nop
    
    code ends
    end start

     2.

    assume cs:code
    code segment
    start:
        mov ax,cs
        mov ds,ax
        mov si,offset capital
    
        mov ax,0
        mov es,ax
        mov di,200h
        mov cx,offset capitalend-offset capital
        cld
        rep movsb
    
        mov ax,0
        mov es,ax
        mov word ptr es:[7ch*4],200h
        mov word ptr es:[7ch*4+2],0
    
    
        mov ax,0b800h
        mov es,ax
        mov di,12*160
        mov bx,offset s-offset se
        mov cx,80
    
    
    s:
        mov byte ptr es:[di],'!'
        add di,2
        int 7ch
    se:
        nop
        mov ax,4c00h
        int 21h
    
    
    capital:
        push bp
        mov bp,sp
        dec cx
        jcxz ok
        add [bp+2],bx
    ok:
        pop bp
        iret
    capitalend:
        nop
    code ends
    end start
  • 相关阅读:
    CH4302 Interval GCD
    20201017 模拟赛总结
    LOJ#2610. 「NOIP2013」货车运输
    POJ3696 The Luckiest number
    20200925 小练习总结
    更新一波状态
    AFO
    【扩展lucas定理】
    【LCT维护子树信息】uoj207 共价大爷游长沙
    [bzoj4589]Hard Nim(FWT快速沃尔什变化+快速幂)
  • 原文地址:https://www.cnblogs.com/hellow0rd/p/6933076.html
Copyright © 2011-2022 走看看