Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

这题的递推式是什么?

Posted by ecjtuwf at 2008-08-05 14:14:06 on Problem 3132
In Reply To:这题的递推式是什么? Posted by:butter at 2006-12-10 16:27:11
	opt[0][0]=1;
	for(i=1; i<=prime[0]; ++i)
		for(j=1120-prime[i]; j>=0; --j)
			for(k=14; k>=1; --k)
				opt[j+prime[i]][k] += opt[j][k-1];

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator