Detail of message

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:ciphercode[i]==27,那么题目是不是说plaincode[k*i mod n]-i等于27或-1？？？？？？？？？？？？？？？

Posted by Vidic15 at 2009-04-25 16:50:15 on Problem 1317
In Reply To:ciphercode[i]==27,那么题目是不是说plaincode[k*i mod n]-i等于27或-1？？？？？？？？？？？？？？？ Posted by:Vidic15 at 2009-04-25 16:19:58

终于过了！！其实当ciphercode[i]==27,plaincode[k*i mod n]-i的确是等于27或-1，但只要对公式研究一下就会发觉其实等于27或-1结果是一样的，所以不用考虑负数了，只需要
plaincode[(k*i)%n]=(ciphercode[i]+i)%28;就可以了...

Followed by:

Post your reply here:

Home Page Go Back To top