 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| 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 | |||||||||
做法In Reply To:求今天上海D题做法 大牛来看看哈~~~ Posted by:silentsky at 2009-10-25 20:59:28 是一个很简单的离散对数的问题，解完以后转化成时间输出即可 x^k = a(mod p) 先求出一个原根G,然后计算I(a) (a的指标),这里需要用到Baby-step来做 最后解模方程k*I(x) = I(a) (mod p-1) 解出来的I(x)就是解集 ans[i]=G^Ii(x) (mod p) 之后排个顺序就可以了. Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
