ArrayJava


留言

張貼留言

這個網誌中的熱門文章

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 ++ ...
閱讀完整內容

MASM --- chapter7 binary multiplication

Include Irvine32 . inc .data . code main proc mov   eax ,   123 mov   ebx ,   eax shl   eax ,   5                ;  multiply by 2^5 shl   ebx ,   2                ;  multiply by 2^2 add   eax ,   ebx call  writedec call  crlf exit main endp end main eax * 36 = eax * ( 32 + 4 )
閱讀完整內容

MASM --- loop basic

圖片
Include Irvine32 . inc .data     MSG0  byte   "enter your number: " , 0dh , 0ah , 0     MSG1  byte   "how many digits: " , 0dh , 0ah , 0     MSG2  byte   "enter sth to halt: " , 0dh , 0ah , 0     number  dword   0     count  dword   0 . code     main proc     L0 :      mov   edx ,  offset MSG0         ; display string      call  writestring      call  readint      mov  number ,   eax      . if  ( eax  <=  0 )      jmp  L3      . endif      mov   ecx ,   eax          ; do exact same time as number      mov   ebx ,   10           ; d...
閱讀完整內容