Partition function by amat

p[101][101],k;main(n){for(;n<101;printf("p(%d)=%d\n",n++,p[1][n]))for(k=100;k;)p[k--][n]=k>=n?k==n:p[k+1][n]+p[k][n-k];}

Note that non-ascii characters in the above source code will be escaped (such as \x9f).

download

return to the top page