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

这道题O(N)的算法怎么写? 我现在只能想出O(N*logP(N))的,但超时.谁能给指点一下呀

Posted by wanghexiang221 at 2006-12-09 14:11:58 on Problem 3146

Followed by:

Re:这道题O(N)的算法怎么写? 我现在只能想出O(N*logP(N))的,但超时.谁能给指点一下呀 (15) Vi_King 2006-12-09 14:20:32
明显O(N)的也要超时~~ O(logP(N))的才可以... (0) zouyu9631 2006-12-09 14:39:32
- 那这道题该怎么想啊?有什么递推公式没 (0) wanghexiang221 2006-12-09 14:46:14
  - 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
画个(n,p)的表格就能看出规律了 (0) sunmoonstar 2006-12-09 16:48:28
- n和p的问题,简称np问题 (0) tdzl2003 2006-12-09 18:24:53
- 画画看 (0) sunmoonstar 2006-12-09 19:04:40
- 是不是做表格T[n][p],元素为相应情况下的个数,也得出"将n转成p进制..."类似的结论? (0) wanghexiang221 2006-12-10 13:52:14

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