摘要：
D. Alyona and a tree time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Alyona has a tree w 阅读全文
posted @ 2017-02-20 18:27
jhz033
阅读(158)
评论(0)
推荐(0)
摘要：
M斐波那契数列 Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Problem Description M斐波那契数列F[n]是一种整数数列，它的定义如下：F[0] = aF[1] = 阅读全文
posted @ 2017-02-20 10:59
jhz033
阅读(262)
评论(0)
推荐(0)
浙公网安备 33010602011771号