大整数
方品
fangpin.github.io
展开
-
EOJ1850 大整数 卡特兰数
题目: HowMany Trees? TimeLimit:1000MS Memory Limit:30000KB TotalSubmit:376 Accepted:160 Description Abinary search tree is a binary tree with root k such that any node v reachablefrom its原创 2014-12-06 22:51:44 · 678 阅读 · 0 评论 -
EOJ2136 大整数
题目: The good old fibonacci. Time Limit:1000MS Memory Limit:65536KB Total Submit:30 Accepted:10 Description Recall the definition of the Fibonacci numbers: f1 := 1 f2原创 2014-12-06 22:55:33 · 676 阅读 · 0 评论