 |
| ||||
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 | |||||||||
Re:道理其实很简单，终于有一题一次AC了In Reply To:道理其实很简单，终于有一题一次AC了 Posted by:HenrySnoopy at 2008-08-05 16:17:16 在余数k不为0时，在2，3，4...N的序列中找到最小的i满足（i+k）〉N，然后用i+k替换掉i就可以了，和逐项加1是一个效果 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
