随笔分类 -  快速幂算法

摘要:DescriptionAn important topic nowadays in computer science is cryptography. Some people even think that cryptography is the only important fie... 阅读全文
posted @ 2017-09-22 18:01 passwd.d 阅读(665) 评论(0) 推荐(0)
摘要:DescriptionGiven a n × n matrix A and a positive integer k, find the sum S=A+A2+A3+…+Ak.InputThe input contains exactly one test case. The fir... 阅读全文
posted @ 2017-09-22 18:01 passwd.d 阅读(88) 评论(0) 推荐(0)
摘要:DescriptionIn the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 2 for n ≥ 2. For example, the first ten terms of the Fibo... 阅读全文
posted @ 2017-09-22 18:01 passwd.d 阅读(116) 评论(0) 推荐(0)