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

在贡献了一次 WA 之后,小看了一下,原来是递推

Posted by bupt_chen at 2008-06-30 17:09:07 on Problem 2033
count[n+1]=count[n]+count[n-1] (1<=count[n]<=26)
count[n+1]=count[n-1] (count[n]==0)
count[n+1]=count[n] (count[n]>26)

突然想起离散老师上课讲的东西了,很有用的,好好学习离散阿

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