¥æ¡¼¥¶ÄêµÁÈ¡¿ô

¥æ¡¼¥¶¤Ë¤è¤ëÈ¡¿ô¤ÎÄêµÁ¤Ï `def' ʸ¤Ç¹Ô¤¦. ʸˡ¥¨¥é¡¼¤ÏÆɤ߹þ¤ß»þ¤Ë ¤¢¤ëÄøÅÙ¥Á¥§¥Ã¥¯¤µ¤ì, ¤ª¤ª¤è¤½¤Î¾ì½ê¤¬É½¼¨¤µ¤ì¤ë. ´û¤Ë(°ú¿ô¤Î¸Ä¿ô¤Ë´Ø·¸¤Ê¤¯)Ʊ̾¤ÎÈ¡¿ô¤¬ÄêµÁ¤µ¤ì¤Æ¤¤¤ë¾ì¹ç¤Ë¤Ï, ¤½¤ÎÈ¡¿ô¤ÏºÆÄêµÁ¤µ¤ì¤ë. ctrl() È¡¿ô¤Ë¤è¤ê verbose ¥Õ¥é¥° ¤¬ on ¤Ë¤Ê¤Ã¤Æ¤¤¤ë¾ì¹ç,

afo() redefined.

¤È¤¤¤¦¥á¥Ã¥»¡¼¥¸¤¬É½¼¨¤µ¤ì¤ë. ¤¢¤ëÈ¡¿ô¤ÎÄêµÁ¤Ë¤ª¤¤¤Æ, ¤Þ¤À̤ÄêµÁ¤ÎÈ¡¿ô ¤ò¸Æ¤Ó½Ð¤·¤Æ¤¤¤Æ¤â, ÄêµÁ»þ¤Ë¤Ï¥¨¥é¡¼¤Ë¤Ê¤é¤Ê¤¤. ¼Â¹Ô»þ¤Ë̤ÄêµÁ¤ÎÈ¡¿ô ¤ò¸Æ¤Ó½Ð¤½¤¦¤È¤·¤¿¾ì¹ç¤Ë¥¨¥é¡¼¤È¤Ê¤ë.

def f(X) { 
    if ( !X )
        return 1;
    else 
        return X * f(X-1);
}

def c(N)
{
    A = newvect(N+1); A[0] = B = newvect(1); B[0] = 1;
    for ( K = 1; K <= N; K++ ) {
        A[K] = B = newvect(K+1); B[0] = B[K] = 1;
        for ( P = A[K-1], J = 1; J < K; J++ ) 
            B[J] = P[J-1]+P[J];
        }
    return A;
}

2 ¤ÄÌܤÎÎã¤Ç¤Ï, Ťµ N+1 ¤Î¥Ù¥¯¥È¥ë (A¤È¤¹¤ë) ¤¬ÊÖ¤µ¤ì¤ë. A[I] ¤ÏŤµ I+1 ¤ÎÇÛÎó¤Ç¤¢¤ê, ¤½¤Î¤½¤ì¤¾¤ì¤ÎÍ×ÁǤ¬ ¤òÍ×ÁǤȤ¹¤ëÇÛÎó¤Ç¤¢¤ë.

°Ê²¼¤Ç¤Ï, C ¤Ë¤è¤ë¥×¥í¥°¥é¥ß¥ó¥°¤Î·Ð¸³¤¬¤Ê¤¤¿Í¤Î¤¿¤á¤Ë, Asir ¸À¸ì ¤Ë¤è¤ë¥×¥í¥°¥é¥à¤Î½ñ¤­Êý¤ò²òÀ⤹¤ë.

Go to the first, previous, next, last section, table of contents.