FILCO Majestouch

我這輩子第一次打的 Cherry 茶軸鍵盤,就是 FILCO Majestouch ,是在 Emil 家裡面打的,從此之後,我被這種機械式的鍵盤慣壞了,陸續買了 三隻 Taclick 回來,一隻給我弟用,另外的就單純收藏。

就在擁有 Taclick 不久之後,我又看到有個團購的機會讓我可以擁有 FILCO Majestouch ,所以,我又毫不猶豫的訂購了一把 FILCO Majestouch 。

鍵盤的 Layout 設計:
FILCO Majestouch

原廠網址:FILCO Majestouch

昨天,負責團購的 qazplo 通知我貨已經到了,於是今天我就到光華商場的迪拉斯 (EIZO顯示器專賣店) 領貨啦。

嘿嘿,終於有機會可以好好把玩一下這把鍵盤…


相當精緻的盒子,我很喜歡。


盒子的背面,印刷很有質感。


盒子裡面裝有說明書、鍵盤本體以及一個USB->PS/2轉接頭。


精緻的束線設計令人愛不釋手


三個藍光的 LED 更添科技質感


薄邊框的設計,簡約時尚。


鍵盤採用標準 104 鍵配置。


拆掉鍵帽,是貨真價實的 Cherry 茶色的機械鍵盤軸心。

目前這個鍵盤的售價,不含運費是日幣 9,450 元,由於國內沒有代理商,所以只能直接和日本購買。

至於我,這次是以參加網路團購的方式購買,花費為新台幣 3000 元整(如果外縣市要運送,則需多負擔宅配費用160元)。

一個 C 的小問題..

在 lang.program 的全國連線板,有個叫做 huaiying 的傢伙發表了一篇文章,
內容如下:

各位大大
可以幫我解決下列的題目嗎?
謝謝!!(4/28)明天就要交ㄌ~
因為我們是教C++ 所以可以用C++的答案給我嗎?
『使用一個一維陣列來解決以下問題,讀進20個10~100的整數可以重複,
當每個數讀進來時,如果之前沒有輸入過這個數,
便將他印出來。請使用『最壞的情況』,(即20個都不一樣)來測試。
盡你所能的以最小的陣列來解決這個問題』

所以我一時興起,就寫了一段程式回給他

當然這個寫法還滿醜的…

不過,十幾分鐘後,有位叫做 yoco 的前輩回了一篇用 C++ 寫的

真妙 😛

麻煩的事情

WHATUP 發表了一篇文章叫做 如何實做一個 Widget ,滿實用的一篇教學文章;

現在翠谷的 LifeType + BBS 就使用了 WHATUP 的 PATCH ,真的很謝謝他。

WHATUP 曾在他的網誌的 comment 裡面提到她想弄一個 lyceum + BBS 連結,當時我超級高興的,不過似乎因為他回應系統的問題,我沒辦法送出回應,所以當時就沒在他的 blog 講。

很期待可以早日看到 lyceum + BBS 認證,因為我始終很不習慣 LifeType 的程式,尤其是 LifeType 寫作方法,讓我讀起來很吃力 (當然,一個大型系統,這樣寫法是相當正確的,因為才能將樣版、核心、抽離開來分開來維護。)

嗯..嗯..唉呀,說了這麼多,沒個頭緒,真混亂 orz

C Primer Plus 第十三章第十三題

13. Digital images, particularly those radioed back from spacecraft, may have glitches. Add a de-glitching function to programming exercise 12. It should compare each value to its immediate neighbors to the left and right, above and below. If the value differs by more than 1 from each of its neighbors, replace the value with the average of the neighboring values. You should round the average to the nearest integer value. Note that the points along the boundaries have fewer than four neighbors, so they require special handling

C Primer Plus 第十三章第十二題

12. Create a text file consisting of rows of 30 integers. The integers should be in the range 0-9 and be separated by spaces. The file is a digital representation of a picture with the value 0 through 9 representing increasing level of darkness. Write a program that reads the contents of the file into a 20 by 30 array of int… In a crude approach toward converting this digital representation to a picture, have the program use the values in this array to initialize a 20 by 31 array of char, with a 0 value corresponding to a space character, a 1 value to the period character and so on, which each larger number represented by a character that occupies more space. For example, you might use # to represent 9. The last character (the 31st) in each row should be a null character, making in an array of 20 strings. Have the program display the resulting picture (that is, print the strings) and also store the result in a text file. For example, suppose you start with data:

0 0 9 0 0 0 0 0 0 0 0 0 5 8 9 9 8 5 2 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 9 0 0 0 0 0 0 0 5 8 9 9 8 5 5 2 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 5 8 1 9 8 5 4 5 2 0 0 0 0 0 0 0 0 0
0 0 0 0 9 0 0 0 0 0 0 0 5 8 9 9 8 5 0 4 5 2 0 0 0 0 0 0 0 0
0 0 9 0 0 0 0 0 0 0 0 0 5 8 9 9 8 5 0 0 4 5 2 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 5 8 9 1 8 5 0 0 0 4 5 2 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 5 8 9 9 8 5 0 0 0 0 4 5 2 0 0 0 0 0
5 5 5 5 5 5 5 5 5 5 5 5 5 8 9 9 8 5 5 5 5 5 5 5 5 5 5 5 5 5
8 8 8 8 8 8 8 8 8 8 8 8 5 8 9 9 8 5 8 8 8 8 8 8 8 8 8 8 8 8
9 9 9 9 0 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 3 9 9 9 9 9 9 9
8 8 8 8 8 8 8 8 8 8 8 8 5 8 9 9 8 5 8 8 8 8 8 8 8 8 8 8 8 8
5 5 5 5 5 5 5 5 5 5 5 5 5 8 9 9 8 5 5 5 5 5 5 5 5 5 5 5 5 5
0 0 0 0 0 0 0 0 0 0 0 0 5 8 9 9 8 5 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 5 8 9 9 8 5 0 0 0 0 6 6 0 0 0 0 0 0
0 0 0 0 2 2 0 0 0 0 0 0 5 8 9 9 8 5 0 0 5 6 0 0 6 5 0 0 0 0
0 0 0 0 3 3 0 0 0 0 0 0 5 8 9 9 8 5 0 5 6 1 1 1 1 6 5 0 0 0
0 0 0 0 4 4 0 0 0 0 0 0 5 8 9 9 8 5 0 0 5 6 0 0 6 5 0 0 0 0
0 0 0 0 5 5 0 0 0 0 0 0 5 8 9 9 8 5 0 0 0 0 6 6 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 5 8 9 9 8 5 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 5 8 9 9 8 5 0 0 0 0 0 0 0 0 0 0 0 0

  #         *%##%*'
    #       *%##%**'
            *%.#%*~*'
    #       *%##%* ~*'
  #         *%##%*  ~*'
            *%#.%*   ~*'
            *%##%*    ~*'
*************%##%*************
%%%%%%%%%%%%*%##%*%%%%%%%%%%%%
#### #################:#######
%%%%%%%%%%%%*%##%*%%%%%%%%%%%%
*************%##%*************
            *%##%*
            *%##%*    ==
    ''      *%##%*  *=  =*
    ::      *%##%* *=....=*
    ~~      *%##%*  *=  =*
    **      *%##%*    ==
            *%##%*
            *%##%*

C Primer Plus 第十二章第八題

8. Here’s a part of program.

Complete the program by providing function definitions for make_array() and show_array(). The make_array() function takes two arguments. The first is the number of element of an int array, the second is a value that is to be assigned to each element. The function uses malloc() to create an array of a suitable size, set each element to indicated value, and return a pointer to the array. The show_array() function displays the contents, eight numbers to a line.

C Primer Plus 第十二章第六題

6. Write a program that generates 1,000 random numbers in the range 1-10. Don’t save or print the numbers, but do print how many times each number was produced. Have the program do this for ten different seed values. Do the numbers appear in equal amounts? You can use the functions from this chapter or ANSI C rand() and srand() functions, which follow the same format that our function do. This is one way to test randomness of a particular random-number generator.

補充:

C Primer Plus 第十一章第七題

7.Write a function string_in() that takes two string pointers as arguments. If the second string is contained in the first string, have the function return the address at witch the address of the a in hats. Otherwise, have the function return the null pointer. Test the function in a complete program that uses a loop to provide input values for feeding to the function.

C Primer Plus 第十一章第六題

6.The strncpy(s1, s2, n) function copies exactly n characters from s2 to s1, truncating s2 or padding it with extra null characters as necessary. The target string may not be null-terminated if the length of s2 is n or more. The function returns s1. Write your own version of this function. Test the function in a complete program that uses a loop to provide input values for feeding to the function.