April 2006 – roga's blog

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元)。

Extended Live Archives

我很喜歡一個 plugin 叫做 Extended Live Archives因為某些需求，我同時使用 Internet Explorer 7 beta 2 以及 Firefox 1.5 兩個瀏覽器。我發現在 Internet Explorer 7 beta 2 ，沒辦法處理 E.L.A. 的 Ajax Request (XMLHTTPRequest)

Continue reading “Extended Live Archives”

一個 C 的小問題..

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

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

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


#include<stdio.h>

int main(void)
{
    int arr[20];
    int input;
    int i,j = 0;
    for(i = 0 ; i < 20 ; i++)
    {
        printf("\n Input the number:");
        scanf("%d", &input);
        arr[i] = input;
        printf(" Input: %d ", arr[i]);
        for( j = 0 ; j < i ; j++ )
            if( input == arr[j] )
                printf(".....EXIST.");
    }
    return 0;
}

#include<stdio.h>

int main(void)

{

int arr[20];

int input;

int i,j = 0;

for(i = 0 ; i < 20 ; i++)

{

printf("\n Input the number:");

scanf("%d", &input);

arr[i] = input;

printf(" Input: %d ", arr[i]);

for( j = 0 ; j < i ; j++ )

if( input == arr[j] )

printf(".....EXIST.");

}

return 0;

}

當然這個寫法還滿醜的…

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


int main ( int argc, char * argv [] )
{
    set<int> s ;
    for ( int i=0; i<20; ++i ) {
        int n ; cin >> n ;
        if ( s.find(n) == s.end() ) {
            cout << n << endl ; s.insert ( n ) ;
        }
    }
}

int main ( int argc, char * argv [] )

{

set<int> s ;

for ( int i=0; i<20; ++i ) {

int n ; cin >> n ;

if ( s.find(n) == s.end() ) {

cout << n << endl ; s.insert ( n ) ;

}

真妙 😛

麻煩的事情

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

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

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

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

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

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


#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define ROWS    20                            /* 原始檔案有 20 行    */
#define COLS    30                            /* 原始檔案有 20 欄位  */
#define SELF    picIn[i][j]
#define LEFT    picIn[i][j-1]
#define RIGHT   picIn[i][j+1]
#define UP      picIn[i-1][j]
#define DOWN    picIn[i+1][j]

void deglitch(int picIn[][COLS]) /* de-glitching 用 */
{
    int i, j, k = 0, l = 0, m = 0, n = 0, o=0;  /* i,j 走訪陣列用，其餘計算修正次數*/

    for (i = 0; i < ROWS; i++)
    {
        for (j = 0; j < COLS; j++)
        {
            if(i == 0 && j ==0)                       /* 最左上角的 */
            {
                if ( abs(RIGHT - SELF) > 1 && abs(DOWN - SELF) > 1)
                {
                    SELF = RIGHT + LEFT / 2;
                    printf("De-glitched the upper-left element.\n");
                }
            }
            else if (i == ROWS - 1   && j == 0)       /* 最左下角的 */
            {
                if ( abs(RIGHT - SELF) > 1 && abs(UP - SELF) > 1)
                {
                    SELF = RIGHT + UP / 2;
                    printf("De-glitched the bottom-left element.\n");
                }
            }
            else if (i == 0 && j == COLS - 1)         /* 最右上角的 */
            {
                if ( abs(LEFT - SELF) > 1 && abs(DOWN - SELF) > 1)
                {
                    SELF = LEFT + DOWN / 2;
                    printf("De-glitched the upper-right element.\n\n");
                }
            }
            else if (i == ROWS - 1 && j == COLS - 1)  /* 最右下角的 */
            {
                if ( abs(LEFT - SELF) > 1 && abs(UP - SELF) > 1)
                {
                    SELF = LEFT + UP / 2;
                    printf("De-glitched the bottom-right element.\n\n");
                }
            }
            else if (i == 0)                          /* 最上面的 ROW */
            {
                if ( abs(LEFT - SELF) > 1 && abs(RIGHT - SELF) > 1)
                {
                    SELF = LEFT + RIGHT / 2;
                    k++;
                }
            }
            else if (i == ROWS - 1)                   /* 最下面的 ROW */
            {
                if ( abs(LEFT - SELF) > 1 && abs(RIGHT - SELF) > 1)
                {
                    SELF = LEFT + UP / 2;
                    l++;
                }
            }
            else if ( j == 0 )                        /* 最左邊的 COLUNM */
            {
                if ( abs(RIGHT - SELF) > 1 && abs(UP - SELF) > 1 && abs(DOWN - SELF) > 1)
                {
                    SELF = LEFT + UP + DOWN / 3;
                    m++;
                }
            }
            else if ( j == COLS - 1)                  /* 最右邊的 COLUNM */
            {
                if ( abs(LEFT - SELF) > 1 && abs(UP - SELF) > 1 && abs(DOWN - SELF) > 1)
                {
                    SELF = LEFT + UP + DOWN / 3;
                    n++;
                }
            }
            else                                      /* 正常比對 */
            {
                if( abs(UP - SELF) > 1 && abs(DOWN - SELF) >1 && abs(LEFT - SELF) > 1 && abs(RIGHT - SELF) > 1)
                {
                    SELF = ( UP + DOWN + LEFT + RIGHT ) / 4 ;
                    o++;
                }
            }
        }
    }

    printf("The elements of the up row de-glitched %d times.\n", k);
    printf("The elements of the bottom row de-glitched %d times.\n", l);
    printf("The elements of the leftest colunm de-glitched %d times.\n", m);
    printf("The elements of the rightest colunm de-glitched %d times.\n", n);
    printf("others de-glitched %d times.\n", o);
    printf("The following message has been de-glitched:\n");

    for (i = 0; i < ROWS; i++)
    {
        for (j = 0; j < COLS; j++)
            printf("%2d", picIn[i][j]);
        printf("\n");
    }

    /* 在螢幕上列印結果 */

}

int main(void)
{
    int row, col;              /* 走訪陣列用的 row 和 colunm */
    int picIn[ROWS][COLS];     /* 讀入的整數陣列 */
    char fileName[40];         /* 檔案名稱最大 39 個字 */

    FILE * infile;             /* 輸入的檔案指標 */

    printf("Enter name of file: ");
    scanf("%s", fileName);

    if ((infile = fopen(fileName, "r")) == NULL)
    {
        fprintf(stderr, "Open file error.\n");
        exit(EXIT_FAILURE);
    }

    /* 讓使用者輸入要讀入的檔案名稱，錯誤則回傳錯誤訊息 */

    for (row = 0; row < ROWS; row++)
        for (col = 0; col < COLS; col++)
            fscanf(infile, "%d",  &picIn[row][col]);

    /* 以巢狀迴圈依序讀入檔案至 picIn 這個陣列*/

    if (ferror(infile))
    {
        fprintf(stderr, "Error getting data from file.\n");
        exit(EXIT_FAILURE);
    }

    /* 假設讀取或寫入有錯誤時，ferror()回傳非零，否則傳回零，用以判斷讀取是否正確 */

    deglitch(picIn);

    /* */

    return 0;
}

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

#include <stdio.h>

#include <stdlib.h>

#include <math.h>

#define ROWS 20 /* 原始檔案有 20 行 */

#define COLS 30 /* 原始檔案有 20 欄位 */

#define SELF picIn[i][j]

#define LEFT picIn[i][j-1]

#define RIGHT picIn[i][j+1]

#define UP picIn[i-1][j]

#define DOWN picIn[i+1][j]

void deglitch(int picIn[][COLS]) /* de-glitching 用 */

{

int i, j, k = 0, l = 0, m = 0, n = 0, o=0; /* i,j 走訪陣列用，其餘計算修正次數*/

for (i = 0; i < ROWS; i++)

{

for (j = 0; j < COLS; j++)

{

if(i == 0 && j ==0) /* 最左上角的 */

{

if ( abs(RIGHT - SELF) > 1 && abs(DOWN - SELF) > 1)

{

SELF = RIGHT + LEFT / 2;

printf("De-glitched the upper-left element.\n");

}

else if (i == ROWS - 1 && j == 0) /* 最左下角的 */

{

if ( abs(RIGHT - SELF) > 1 && abs(UP - SELF) > 1)

{

SELF = RIGHT + UP / 2;

printf("De-glitched the bottom-left element.\n");

}

else if (i == 0 && j == COLS - 1) /* 最右上角的 */

{

if ( abs(LEFT - SELF) > 1 && abs(DOWN - SELF) > 1)

{

SELF = LEFT + DOWN / 2;

printf("De-glitched the upper-right element.\n\n");

}

else if (i == ROWS - 1 && j == COLS - 1) /* 最右下角的 */

{

if ( abs(LEFT - SELF) > 1 && abs(UP - SELF) > 1)

{

SELF = LEFT + UP / 2;

printf("De-glitched the bottom-right element.\n\n");

}

else if (i == 0) /* 最上面的 ROW */

{

if ( abs(LEFT - SELF) > 1 && abs(RIGHT - SELF) > 1)

{

SELF = LEFT + RIGHT / 2;

k++;

}

else if (i == ROWS - 1) /* 最下面的 ROW */

{

if ( abs(LEFT - SELF) > 1 && abs(RIGHT - SELF) > 1)

{

SELF = LEFT + UP / 2;

l++;

}

else if ( j == 0 ) /* 最左邊的 COLUNM */

{

if ( abs(RIGHT - SELF) > 1 && abs(UP - SELF) > 1 && abs(DOWN - SELF) > 1)

{

SELF = LEFT + UP + DOWN / 3;

m++;

}

else if ( j == COLS - 1) /* 最右邊的 COLUNM */

{

if ( abs(LEFT - SELF) > 1 && abs(UP - SELF) > 1 && abs(DOWN - SELF) > 1)

{

SELF = LEFT + UP + DOWN / 3;

n++;

}

else /* 正常比對 */

{

if( abs(UP - SELF) > 1 && abs(DOWN - SELF) >1 && abs(LEFT - SELF) > 1 && abs(RIGHT - SELF) > 1)

{

SELF = ( UP + DOWN + LEFT + RIGHT ) / 4 ;

o++;

}

printf("The elements of the up row de-glitched %d times.\n", k);

printf("The elements of the bottom row de-glitched %d times.\n", l);

printf("The elements of the leftest colunm de-glitched %d times.\n", m);

printf("The elements of the rightest colunm de-glitched %d times.\n", n);

printf("others de-glitched %d times.\n", o);

printf("The following message has been de-glitched:\n");

for (i = 0; i < ROWS; i++)

{

for (j = 0; j < COLS; j++)

printf("%2d", picIn[i][j]);

printf("\n");

}

/* 在螢幕上列印結果 */

}

int main(void)

{

int row, col; /* 走訪陣列用的 row 和 colunm */

int picIn[ROWS][COLS]; /* 讀入的整數陣列 */

char fileName[40]; /* 檔案名稱最大 39 個字 */

FILE * infile; /* 輸入的檔案指標 */

printf("Enter name of file: ");

scanf("%s", fileName);

if ((infile = fopen(fileName, "r")) == NULL)

{

fprintf(stderr, "Open file error.\n");

exit(EXIT_FAILURE);

}

/* 讓使用者輸入要讀入的檔案名稱，錯誤則回傳錯誤訊息 */

for (row = 0; row < ROWS; row++)

for (col = 0; col < COLS; col++)

fscanf(infile, "%d", &picIn[row][col]);

/* 以巢狀迴圈依序讀入檔案至 picIn 這個陣列*/

if (ferror(infile))

{

fprintf(stderr, "Error getting data from file.\n");

exit(EXIT_FAILURE);

}

/* 假設讀取或寫入有錯誤時，ferror()回傳非零，否則傳回零，用以判斷讀取是否正確 */

deglitch(picIn);

/* */

return 0;

}

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

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


#include <stdio.h>
#include <stdlib.h>
#define ROWS    20                            /* 原始檔案有 20 行    */
#define COLS    30                            /* 原始檔案有 20 欄位  */
#define LEVELS  10                            /* 有十個元素要替代    */
const char trans[LEVELS + 1] = " .':~*=&%@";  /* 把要替代的字串存入陣列，再多加一個 NULL */

void MakePic(int data[][COLS], char pic[][COLS], int rows) /* 產生新圖片用 */
{
    int row, col;
    for (row = 0; row < ROWS; row++)
        for (col = 0; col < COLS; col++)
            pic[row][col] = trans[data[row][col]];

    /* pic 陣列用以儲存 tran陣列裡面的 .':~*=&%@ 字元。data[row][col]的值代表當時讀入的 0 ~ 9 */
    /* 把檔案內容讀到 data 陣列後，以本題輸入為例， data[0][0] 的值是 0 ， 則代表 trans[0]    */
    /* 再把 trans[0] 的值(定義為空格) assign 到 pic[0][0] 這個元素，以此類推。                */
}

int main(void)
{
    int row, col;             /* 走訪陣列用的 row 和 colunm */
    int picIn[ROWS][COLS];    /* 讀入的整數陣列 */
    char picOut[ROWS][COLS];  /* 輸出的字元陣列 */
    char fileName[40];        /* 檔案名稱最大 39 個字 */

    FILE * infile;            /* 輸入的檔案指標 */
    FILE * outfile;           /* 輸出的檔案指標 */

    outfile = fopen("output.txt","w"); /* 指定輸出檔案叫做 output.txt */

    printf("Enter name of file: ");
    scanf("%s", fileName);

    if ((infile = fopen(fileName, "r")) == NULL)
    {
        fprintf(stderr, "Could not open data file.\n");
        exit(EXIT_FAILURE);
    }

    /* 讓使用者輸入要讀入的檔案名稱，錯誤則回傳錯誤訊息 */

    for (row = 0; row < ROWS; row++)
        for (col = 0; col < COLS; col++)
            fscanf(infile, "%d",  &picIn[row][col]);

    /* 以巢狀迴圈依序讀入檔案至 picIn 這個整數陣列 */

    if (ferror(infile))
    {
        fprintf(stderr, "Error getting data from file.\n");
        exit(EXIT_FAILURE);
    }

    /* 假設讀取或寫入有錯誤時，ferror()回傳非零，否則傳回零，用以判斷讀取是否正確 */

    MakePic(picIn, picOut, ROWS);

    /* 執行轉換用的 function */

    for (row = 0; row < ROWS; row++)
    {
        for (col = 0; col < COLS; col++)
        {
	    fprintf(outfile,"%c", picOut[row][col]);
            printf("%c",picOut[row][col]);
        }
        fprintf(outfile,"\n");
        printf("\n");
    }

    /* 以巢狀迴圈列印出陣列，順便寫入檔案 */

    return 0;
}

#include <stdio.h>

#include <stdlib.h>

#define ROWS 20 /* 原始檔案有 20 行 */

#define COLS 30 /* 原始檔案有 20 欄位 */

#define LEVELS 10 /* 有十個元素要替代 */

const char trans[LEVELS + 1] = " .':~*=&%@"; /* 把要替代的字串存入陣列，再多加一個 NULL */

void MakePic(int data[][COLS], char pic[][COLS], int rows) /* 產生新圖片用 */

{

int row, col;

for (row = 0; row < ROWS; row++)

for (col = 0; col < COLS; col++)

pic[row][col] = trans[data[row][col]];

/* pic 陣列用以儲存 tran陣列裡面的 .':~*=&%@ 字元。data[row][col]的值代表當時讀入的 0 ~ 9 */

/* 把檔案內容讀到 data 陣列後，以本題輸入為例， data[0][0] 的值是 0 ，則代表 trans[0] */

/* 再把 trans[0] 的值(定義為空格) assign 到 pic[0][0] 這個元素，以此類推。 */

}

int main(void)

{

int row, col; /* 走訪陣列用的 row 和 colunm */

int picIn[ROWS][COLS]; /* 讀入的整數陣列 */

char picOut[ROWS][COLS]; /* 輸出的字元陣列 */

char fileName[40]; /* 檔案名稱最大 39 個字 */

FILE * infile; /* 輸入的檔案指標 */

FILE * outfile; /* 輸出的檔案指標 */

outfile = fopen("output.txt","w"); /* 指定輸出檔案叫做 output.txt */

printf("Enter name of file: ");

scanf("%s", fileName);

if ((infile = fopen(fileName, "r")) == NULL)

{

fprintf(stderr, "Could not open data file.\n");

exit(EXIT_FAILURE);

}

/* 讓使用者輸入要讀入的檔案名稱，錯誤則回傳錯誤訊息 */

for (row = 0; row < ROWS; row++)

for (col = 0; col < COLS; col++)

fscanf(infile, "%d", &picIn[row][col]);

/* 以巢狀迴圈依序讀入檔案至 picIn 這個整數陣列 */

if (ferror(infile))

{

fprintf(stderr, "Error getting data from file.\n");

exit(EXIT_FAILURE);

}

/* 假設讀取或寫入有錯誤時，ferror()回傳非零，否則傳回零，用以判斷讀取是否正確 */

MakePic(picIn, picOut, ROWS);

/* 執行轉換用的 function */

for (row = 0; row < ROWS; row++)

{

for (col = 0; col < COLS; col++)

{

fprintf(outfile,"%c", picOut[row][col]);

printf("%c",picOut[row][col]);

}

fprintf(outfile,"\n");

printf("\n");

}

/* 以巢狀迴圈列印出陣列，順便寫入檔案 */

return 0;

}

C Primer Plus 第十二章第八題

8. Here’s a part of program.


#include <stdio.h>
int * make_array(int elem, int val);
void show_array(const int ar[], int n);
int main(void)
{
    int * pa;
    int size;
    int value;

    printf("Enter the number of elements:");
    scanf("%d",&size);
    while(size>0)
    {
        printf("enter the initialization value:");
        scanf("%d",&value);
        pa = make_array(size, value);
        if(pa)
        {
            show_array(pa, size);
                free(pa);
        }
        printf("Enter the number of elements(<1 to quit):");
       scanf("%d",&size);
    }
    printf("Done!\n");
    return 0;
}

#include <stdio.h>

int * make_array(int elem, int val);

void show_array(const int ar[], int n);

int main(void)

{

int * pa;

int size;

int value;

printf("Enter the number of elements:");

scanf("%d",&size);

while(size>0)

{

printf("enter the initialization value:");

scanf("%d",&value);

pa = make_array(size, value);

if(pa)

{

show_array(pa, size);

free(pa);

}

printf("Enter the number of elements(<1 to quit):");

scanf("%d",&size);

}

printf("Done!\n");

return 0;

}

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.


#include <stdio.h>
#include <stdlib.h>

int * make_array(int elem, int val) /*  elem = 元素個數 val = 元素的值 */
{
    int * ptd;
    ptd = (int *) malloc( elem *sizeof(int));

    for (int i = 0; i < elem ; i++)
        ptd[i]=val;

    return ptd;
}

void show_array(const int ar[], int n) /* ar[] = 新陣列 n = 元素個數 */
{
    for (int i=0 ; i<n ; i++ )
    {        printf("ar[%2d] = %2d  ", i, ar[i]);
        if (i % 8 == 0)
            printf("\n");              /* 秀出陣列元素，每八個元素換行*/
    }
}

int main(void)
{
    int * pa;
    int size;
    int value;

    printf("Enter the number of elements:");
    scanf("%d",&size);
    while(size>0)
    {
        printf("enter the initialization value:");
        scanf("%d",&value);
        pa = make_array(size, value);
        if(pa)
        {
            show_array(pa, size);
                free(pa);
        }
       printf("Enter the number of elements(<1 to quit):");
       scanf("%d",&size);
    }
    printf("Done!\n");
    return 0;
}

#include <stdio.h>

#include <stdlib.h>

int * make_array(int elem, int val) /* elem = 元素個數 val = 元素的值 */

{

int * ptd;

ptd = (int *) malloc( elem *sizeof(int));

for (int i = 0; i < elem ; i++)

ptd[i]=val;

return ptd;

}

void show_array(const int ar[], int n) /* ar[] = 新陣列 n = 元素個數 */

{

for (int i=0 ; i<n ; i++ )

{ printf("ar[%2d] = %2d ", i, ar[i]);

if (i % 8 == 0)

printf("\n"); /* 秀出陣列元素，每八個元素換行*/

}

int main(void)

{

int * pa;

int size;

int value;

printf("Enter the number of elements:");

scanf("%d",&size);

while(size>0)

{

printf("enter the initialization value:");

scanf("%d",&value);

pa = make_array(size, value);

if(pa)

{

show_array(pa, size);

free(pa);

}

printf("Enter the number of elements(<1 to quit):");

scanf("%d",&size);

}

printf("Done!\n");

return 0;

}

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.


#include<time.h>
#include<stdlib.h>
#include<stdio.h>

int main(void)
{
    int i;
    int array[10];
    srand(time(NULL));
    for( i = 0 ; i < 10 ; i++)
        array[i] = 0;
    for( i = 0 ; i < 1000 ; i++)
        array[rand()%10]++;
    for( i = 0 ; i < 10 ; i++)
        printf("%4d = %4d \n",i+1,array[i]);
    return 0;
}

#include<time.h>

#include<stdlib.h>

#include<stdio.h>

int main(void)

{

int i;

int array[10];

srand(time(NULL));

for( i = 0 ; i < 10 ; i++)

array[i] = 0;

for( i = 0 ; i < 1000 ; i++)

array[rand()%10]++;

for( i = 0 ; i < 10 ; i++)

printf("%4d = %4d \n",i+1,array[i]);

return 0;

}

補充：


#include <stdio.h>
#include <stdlib.h>
#include <time.h>
int main(void)
{
    int x, y;
    int random[1000];
    int count[10] = {0,0,0,0,0,0,0,0,0,0};
    unsigned seed;

    puts("Please enter the seed:(q to quit)");

    while(scanf("%u", &seed) == 1)
    {
        srand(seed); // 這邊要種 seed

        for (x = 0; x <= 999; x++)
            random[x] = rand()%10 ; // 這樣就指定完一千個亂數了

        for (x = 0; x < 10; x++)
            for (y = 0 ; y <= 999; y++)
               if(random[y] == x)
                   count[x]++;

        for (x = 0; x < 10; x++)
                printf("The element: %d , has been counted for %d times\n",x+1 , count[x] );
    }

    system("pause");
    return 0;
}

#include <stdio.h>

#include <stdlib.h>

#include <time.h>

int main(void)

{

int x, y;

int random[1000];

int count[10] = {0,0,0,0,0,0,0,0,0,0};

unsigned seed;

puts("Please enter the seed:(q to quit)");

while(scanf("%u", &seed) == 1)

{

srand(seed); // 這邊要種 seed

for (x = 0; x <= 999; x++)

random[x] = rand()%10 ; // 這樣就指定完一千個亂數了

for (x = 0; x < 10; x++)

for (y = 0 ; y <= 999; y++)

if(random[y] == x)

count[x]++;

for (x = 0; x < 10; x++)

printf("The element: %d , has been counted for %d times\n",x+1 , count[x] );

}

system("pause");

return 0;

}

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.


#include <stdio.h>
#include <string.h>

char * string_cmp(char * str1, char * str2)
{
    int l2 = strlen(str2);
    int tries;
    int nomatch = 1;

    tries = strlen(str1) + 1 - l2;
    if (tries > 0)
        while (( nomatch = strncmp(str1, str2, l2)) && tries--)
            str1++;
    if (nomatch)
        return NULL;
    else
        return str1;
}

int main(void)
{
    char source[10] = "microsoft";
    char * find;

    find = string_cmp(source, "soft");
    if (find)
        puts(find);
    else
        puts("No Match");

    find = string_cmp(source, "hard");

    if (find)
        puts(find);
    else
        puts("No Match");

    return 0;
}

#include <stdio.h>

#include <string.h>

char * string_cmp(char * str1, char * str2)

{

int l2 = strlen(str2);

int tries;

int nomatch = 1;

tries = strlen(str1) + 1 - l2;

if (tries > 0)

while (( nomatch = strncmp(str1, str2, l2)) && tries--)

str1++;

if (nomatch)

return NULL;

else

return str1;

}

int main(void)

{

char source[10] = "microsoft";

char * find;

find = string_cmp(source, "soft");

if (find)

puts(find);

else

puts("No Match");

find = string_cmp(source, "hard");

if (find)

puts(find);

else

puts("No Match");

return 0;

}

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.


#include<stdio.h>
#include<string.h>

char * strncpy_2(char *target, char *source, int n) /* 傳入字串)，寫入字串，以及字數 n */
{
        if (n > strlen(source))
           n = strlen(source);

        for(int i = 0; i < n; i++)
           target[i] = source[i];

        if (target[i] != '\0')
           target[n] = '\0';

        return target;
}

int main(void)
{
       char source[101];                           /* 最多輸入100 個字 */
       char target[101];                           /* 事先宣到告好，因為 C 必須先定義陣列大小，除非用 malloc() */

       gets(source);                               /* get 要測試的字串 */
       printf("有 %d 個字\n",strlen(source));

       strncpy_2(target, source, 3);               /* 呼叫函式，只 copy 三個字 */

       puts(target);                               /* 把結果 put 出來 */
       return 0;
}

#include<stdio.h>

#include<string.h>

char * strncpy_2(char *target, char *source, int n) /* 傳入字串)，寫入字串，以及字數 n */

{

if (n > strlen(source))

n = strlen(source);

for(int i = 0; i < n; i++)

target[i] = source[i];

if (target[i] != '\0')

target[n] = '\0';

return target;

}

int main(void)

{

char source[101]; /* 最多輸入100 個字 */

char target[101]; /* 事先宣到告好，因為 C 必須先定義陣列大小，除非用 malloc() */

gets(source); /* get 要測試的字串 */

printf("有 %d 個字\n",strlen(source));

strncpy_2(target, source, 3); /* 呼叫函式，只 copy 三個字 */

puts(target); /* 把結果 put 出來 */

return 0;

}

介紹言簡意賅，閱讀起來舒服又條理分明，對... by ferny
哇，我沒注意到，非常感謝你！重新... by roga
名字還是沒擋到承租人姓名那邊 ~~... by johnpupu
哈哈，我可是 roga 哥的忠實讀者ww... by Ferrari
好久不見，法拉利哥！！... by roga
車友（握） ;) 真的騎了會上癮，... by Ferrari
[…] Series 是比較... by Gogoro 介紹 & 推坑文 – roga's blog
感謝 :D... by roga
賀~... by siuon
[…] 而我也在同年的六月初... by Gogoro S1 開箱文 – roga's blog

Month: April 2006

FILCO Majestouch

Extended Live Archives

一個 C 的小問題..

麻煩的事情

C Primer Plus 第十三章第十三題

C Primer Plus 第十三章第十二題

C Primer Plus 第十二章第八題

C Primer Plus 第十二章第六題

C Primer Plus 第十一章第七題

C Primer Plus 第十一章第六題