Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

Web Board
Home Page
F.A.Qs
Statistical Charts

Current Contest
Past Contests
Scheduled Contests
Award Contest

那这道题该怎么想啊?有什么递推公式没

Posted by wanghexiang221 at 2006-12-09 14:46:14 on Problem 3146
In Reply To:明显O(N)的也要超时~~ O(logP(N))的才可以... Posted by:zouyu9631 at 2006-12-09 14:39:32

Followed by:

ReZhuCheng老大的Blog上有这题的证明，n转化成p进制就可以了…… (0) byron 2006-12-09 14:50:44
- 求ZhuCheng老大的Blog地址...... (0) zouyu9631 2006-12-09 15:00:39
- 谢谢啦 (0) wanghexiang221 2006-12-09 15:52:47
  - 看了以后仍然不是完全懂做法，基础太差，好好看书去了。 (0) acsaga 2006-12-09 16:15:45

Post your reply here:

Home Page Go Back To top

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