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:矩阵的特点是可以把乘法复杂度降到O(N^2)的

Posted by a024014 at 2007-03-24 11:46:37 on Problem 3150
In Reply To:矩阵的特点是可以把乘法复杂度降到O(N^2)的 Posted by:YUMEN19850720 at 2007-03-23 09:25:46
哦,谢谢前辈.我再想想。

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