摘要: Problem Description RSA is one of the most powerful methods to encrypt data. The RSA algorithm is described as follow:> choose two large prime integer 阅读全文
posted @ 2016-05-14 22:58 邻家那小孩儿 阅读(156) 评论(0) 推荐(0) 编辑
摘要: Problem Description Eddy是个ACMer,他不仅喜欢做ACM题,而且对于纸牌也有一定的研究,他在无聊时研究发现,如果他有2N张牌,编号为1,2,3..n,n+1,..2n。这也是最初的牌的顺序。通过一次洗牌可以把牌的序列变为n+1,1,n+2,2,n+3,3,n+4,4..2n 阅读全文
posted @ 2016-05-14 21:52 邻家那小孩儿 阅读(304) 评论(0) 推荐(0) 编辑