assembly cipher text

  1. Include Irvine32.inc
  2. KEY = 215
  3. BUFMAX = 128
  4. .data
  5.     sPrompt byte "Enter origin text : ",0
  6.     sEncrypt byte "Cipher text : ",0
  7.     sDecrypt byte "Decrypted : ",0
  8.     buffer byte BUFMAX + 1 DUP(0)
  9.     bufSize dword ?
  10. .code
  11. main proc
  12.     mov edx, offset sPrompt
  13.     call writestring
  14.     call InputString
  15.     mov edx, offset sEncrypt
  16.     call writestring
  17.     call TranBuffer
  18.     call DisplayMsg
  19.     mov edx, offset sDecrypt
  20.     call writestring
  21.     call TranBuffer
  22.     call DisplayMsg
  23.     exit
  24. main endp
  25. ;---------------------
  26. InputString proc
  27. pushad
  28. mov ecx, BUFMAX
  29. mov edx, offset buffer          ; point to buffer
  30. call readstring
  31. mov bufSize, eax
  32. popad
  33. ret
  34. InputString endp
  35. ;---------------------
  36. DisplayMsg proc
  37. pushad
  38. mov edx, offset buffer
  39. call writestring
  40. call crlf
  41. popad
  42. ret
  43. DIsplayMsg endp
  44. ;---------------------
  45. TranBuffer proc
  46. pushad
  47. mov ecx, bufSize
  48. mov esi, 0
  49. L1:
  50.     xor buffer[esi], KEY
  51.     inc esi
  52.     loop L1
  53. popad
  54. ret
  55. TranBuffer endp
  56. end main
😺😺😺😺😸

留言

張貼留言

這個網誌中的熱門文章

Codeforces --- string task

Petya started to attend programming lessons. On the first lesson his task was to write a simple program. The program was supposed to do the following: in the given string, consisting if uppercase and lowercase Latin letters, it: deletes all the vowels, inserts a character " . " before each consonant, replaces all uppercase consonants with corresponding lowercase ones. Vowels are letters "A", "O", "Y", "E", "U", "I", and the rest are consonants. The program's input is exactly one string, it should return the output as a single string, resulting after the program's processing the initial string. Help Petya cope with this easy task. Input The first line represents input string of Petya's program. This string only consists of uppercase and lowercase Latin letters and its length is from  1  to  100 , inclusive. Output Print the resulting string. It is guaranteed that this string is
閱讀完整內容

Uva 674 ---- coin change

圖片
// coin change #include <iostream> using   namespace  std ; int  main ( ) { int  iCoin [ 7490 ] [ 5 ] ; int  iMoney [ 5 ]   =   {   1 ,  5 ,  10  ,  25 ,  50   } ; int  iAmount, i ,j, iMax ; while   (   cin   >>  iAmount  )      {     iMax  =   - 1 ;        for   (  i = 0   ;  i <= iAmount  ;  i ++   )           iCoin [ i ] [ 0 ]   =   1 ;      for   (  j = 0   ;  j < 5   ;  j ++   )         iCoin [ 0 ] [ j ]   =   1 ;      for   (  i = 1   ;  i <= iAmount  ;  i ++   )                for   (  j = 1   ;  j < 5   ;  j ++   )              {              if   (  i - iMoney [ j ]   >=   0   )                 iCoin [ i ] [ j ]   =   (  iCoin [ i ] [ j - 1 ]   +  iCoin [ i - iMoney [ j ] ] [ j ]   ) ;                  else                 iCoin [ i ] [ j ]   =  iCoin [ i ] [ j - 1 ] ;                                  }      /*          for ( i=0 ; i<iAmount ; i++ )               {
閱讀完整內容

codeforces 271A --- beautiful year

BEAUTIFUL YEAR It seems like the year of 2013 came only yesterday. Do you know a curious fact? The year of 2013 is the first year after the old 1987 with only distinct digits. Now you are suggested to solve the following problem: given a year number, find the minimum year number which is strictly larger than the given one and has only distinct digits. Input The single line contains integer  y   (1000 ≤  y  ≤ 9000)  — the year number. Output Print a single integer — the minimum year number that is strictly larger than  y  and all it's digits are distinct. It is guaranteed that the answer exists. Examples input 1987 output 2013 input 2013 output 2014 #include <iostream> using   namespace  std ; int  iFind  (   int  iIn  ) { int  iFlag ;   int  iBucket [ 10 ] ; for   (   int  i = 0   ;  i < 10   ;  i ++   )     iBucket [ i ]   =   0 ; iFlag  =   0 ; while   (  iIn  )      {      if   (  iBucket [
閱讀完整內容