Memory regions are located in an array of X and Y. X arrays are X1, X2, ..., X10 Y array with Y1, Y2, ..., Y10, programmed to achieve the following calculation: Z1 = X1-Y1, Z2 = X2+ Y2, Z3 = X3-Y3, Z4 = X4+ Y4, Z5 = X5+ Y5, Z6 = X6-Y6, Z7 = X7-Y7, Z8 = X8+ Y8, Z9 = X9-Y9, Z10 = X10+ Y10. The results stored in an array Z in Z. In order to facilitate the inspection results, set the contents of the array X as db 22,11,22,11,11,22,22,11,22,11,0,0,0,0,0,0 stored in ds: 0 Memory , in order to facilitate the calculation, the number of array X in the complement of 16 array Y stored in the ds: 16 of 16 starting in memory, says 11,88,11,88,88,11,11,88,11, 88,0,0,0,0,0,0, and stored in the array Z ds: 32 of the memory space, and the array value is initialized to 0. Array X, Y, Z are continuous storage!

数组运算.doc

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．