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

assembly cipher text

圖片
Include Irvine32 . inc KEY =  215 BUFMAX =  128 .data     sPrompt  byte   "Enter origin text : " , 0     sEncrypt  byte   "Cipher text : " , 0     sDecrypt  byte   "Decrypted : " , 0     buffer  byte  BUFMAX  +   1  DUP ( 0 )     bufSize  dword  ? . code main proc      mov   edx ,  offset sPrompt      call  writestring      call  InputString      mov   edx ,  offset sEncrypt      call  writestring      call  TranBuffer      call  DisplayMsg      mov   edx ,  offset sDecrypt      call  writestring      call  TranBuffer      call  DisplayMsg     exit main ...
閱讀完整內容