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

就是dp,直到%m==0退出构造解,可以保证是最短的解

Posted by ArXoR at 2005-04-12 17:51:57 on Problem 1426
In Reply To:我觉得是判定性DP,记录10^x % n,然后f[i][j]表示后i位能否组成mod n为j的数 Posted by:TN at 2005-04-12 15:52:52


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