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

Re:怎么都用时这么少过了,是高精度算法比较优秀吗?还是公式比较高效?

Posted by vk at 2005-08-01 20:59:47 on Problem 2515
In Reply To:怎么都用时这么少过了,是高精度算法比较优秀吗?还是公式比较高效? Posted by:vk at 2005-08-01 20:32:32
> 我的公式:
> TN[k] = (n+1)^k;
> c(k+1,i)是从k+1里选i个的组合数
> T[k] = TN[k+1] - sigma(c(k+1,i)*T[i];i=0,…,k-1)-1;
> T[m]即为所求

等式左边是 (k+1)*T[k]

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