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 longpo at 2008-06-30 11:30:25 on Problem 3604
In Reply To:Re:这题有解题报告没 Posted by:frkstyc at 2008-06-30 08:51:50 
> 
> Let the prime factorization of $N$ be
> 
> N=\prod_{i=1}^mp_i^{k_i},
> 
> the answer is
> 
> \left(\prod_{i=1}^m\binom{k_i+2}{2}\right)^2.

 frkstyc 大大是管理员啊， 能否告诉小弟 为什么开5000000的数组，
for(i=2;i<N;i++){
  for(j=i;j<N;j+=i){
   num[j]++; 
   ans[j]+=num[i];
  }
} 我加个t计算循环的次数，才7000万多次，但运行要很长时间， 是不是寻址很费时？
不胜感激~
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