10 2007 檔案
Trace Iamge
摘要: Given a picture composed entirely of horizontal and vertical line segments, calculate the minimum number of times you must lift your pen to trace every line segment in the picture exactly n times.
Each line segment will be of the form " " (quotes for clarity), representing a segment from (x1,y1) to (x2,y2). Segments may cross each other. Segments may also overlap, in which case you should count the overlapping region as appearing in the drawing only once. For example, say t 閱讀全文
Each line segment will be of the form "
Lottery Again
摘要: In most states, gamblers can choose from a wide variety of different lottery games. The rules of a lottery are defined by two integers (choices and blanks) and two boolean variables (sorted and unique). choices represents the highest valid number that you may use on your lottery ticket. (All integers between 1 and choices, inclusive, are valid and can appear on your ticket.) blanks represents the number of spots on your ticket where numbers can be written. 閱讀全文
A Q of Encrypting String
摘要:
Let's say you have a binary string such as the following:
011100011
One way to encrypt this string is to add to each digit the sum of its adjacent digits. For example, the above string would become:
123210122 閱讀全文
Let's say you have a binary string such as the following:
011100011
One way to encrypt this string is to add to each digit the sum of its adjacent digits. For example, the above string would become:
123210122 閱讀全文
Maze Problem
摘要: People enjoy mazes, but they also get them dirty. Arrows, graffiti, and chewing gum are just a few of the souvenirs people leave on the walls. You, the maze keeper, are assigned to whiten the maze walls. Each face of the wall requires one liter of paint, but you are only required to paint visible faces. You are given a map of the maze, and you must determine the amount of paint needed for the job. 閱讀全文
TopCoder_2
摘要: In written languages, some symbols may appear more often than others. Expected frequency tables have been defined for many languages. For each symbol in a language, a frequency table will contain its expected percentage in a typical passage written in that language. For example, if the symbol "a" has an expected percentage of 5, then 5% of the letters in a typical passage will be "a". If a passage contains 350 letters, then 'a' has an expected count of 17.5 for that passage (17.5 = 350 * 5%). Pl 閱讀全文
TopCoder_1
摘要: A speed radar is installed in a highway zone where the maximum speed limit is maxLimit mph, and the minimum speed limit is minLimit mph. 閱讀全文
Struts Review
摘要: 好長時間沒寫程序了感覺,忘了很多東西,呵呵,今天打開Eclipse寫了一個Struts的小應用,也回顧了一遍它的主要內容,這篇隨筆就把整理的一些東西貼出來吧。 閱讀全文
| |||||||||
日 | 一 | 二 | 三 | 四 | 五 | 六 | |||
---|---|---|---|---|---|---|---|---|---|
30 | 1 | 2 | 3 | 4 | 5 | 6 | |||
7 | 8 | 9 | 10 | 11 | 12 | 13 | |||
14 | 15 | 16 | 17 | 18 | 19 | 20 | |||
21 | 22 | 23 | 24 | 25 | 26 | 27 | |||
28 | 29 | 30 | 31 | 1 | 2 | 3 | |||
4 | 5 | 6 | 7 | 8 | 9 | 10 |
常用鏈接
留言簿(10)
隨筆分類(95)
- Data Structure && Algorithm (14)
- IBM Tech(8)
- No Category(11)
- Personal Comments(12)
- python(2)
- Simple Java(31)
- SUN Tech(17)
隨筆檔案(97)
- 2009年9月 (1)
- 2008年8月 (1)
- 2008年7月 (2)
- 2008年4月 (3)
- 2008年2月 (2)
- 2008年1月 (1)
- 2007年12月 (3)
- 2007年11月 (3)
- 2007年10月 (7)
- 2007年8月 (2)
- 2007年7月 (5)
- 2007年6月 (1)
- 2007年5月 (8)
- 2007年4月 (15)
- 2007年3月 (9)
- 2007年2月 (2)
- 2007年1月 (3)
- 2006年12月 (6)
- 2006年11月 (2)
- 2006年10月 (5)
- 2006年8月 (2)
- 2006年7月 (5)
- 2006年5月 (9)
文章檔案(10)
相冊
J2ME技術網站
java技術相關
mess
搜索
最新評論

- 1.?re: SWT JFACE .TreeViewer Expand事件及其節點處理方法[未登錄]
-
@求助
非常感謝 解決了問題 - --huhu
- 2.?re: The Fifth Discipline Peter M. Senge(彼得·圣潔)
-
@Scott
- --bc05002@gmail.com
- 3.?re: Java6 MUstang新特性總結(摘錄)
- Thanks for your sharing.I like it very much, thanks!
- --ed hardy
- 4.?re: F3(轉http://blogs.sun.com/chrisoliver/entry/f3)
- 評論內容較長,點擊標題查看
- --runescape gold
- 5.?re: ideas are just a multiplier of execution(copied)
- 評論內容較長,點擊標題查看
- --James07