随笔分类 - 快速幂算法
摘要:DescriptionAn important topic nowadays in computer science is cryptography. Some people even think that cryptography is the only important fie...
阅读全文
摘要: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...
阅读全文
摘要: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...
阅读全文

浙公网安备 33010602011771号