vj1117 数的划分


Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
//±ÉÈ˵ķ½·¨ //µÝÍÆ //Éè f [ i , j ] Ϊ i ¸öÊý»®·Ö³É j ²¿·ÖµÄ×ÜÊý //f[ i , j ] = f [ i-1 , j-1 ] + f[ i-j , j ] ·Ö±ð¶ÔÓ¦ÓÐ 1 ºÍÎÞ 1 ³õÖµ f[0,0]=1 f const maxk=6; maxn=200; var n,k:integer; f:array[0. .maxn,0. .maxk] of longint; procedure init;
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/21/2011 for the course CS 001 taught by Professor 001 during the Spring '11 term at Shandong University.

Ask a homework question - tutors are online