摘要: Huge Fibonacci Numbers时间限制: 1 Sec 内存限制: 128 MB题目描述A Fibonacci sequence is calculated by adding the previous two membersof the sequence, with the first two members being both 1. f(1) = 1, f(2) = 1, f(n > 2) = f(n - 1) + f(n - 2)Your task is to take a number as input, and print that Fibonacci numbe 阅读全文
posted @ 2013-05-27 01:41 女孩不哭 阅读(2485) 评论(0) 推荐(0) 编辑
摘要: Substitution CypherTime Limit: 1.0 Seconds Memory Limit: 65536K Multiple test files Substitution cyphers are the simplest of cyphers where the letters of one alphabet are substituted for the letters of another alphabet. In one form or another, they've been in use for over 2000 years. Input A lin 阅读全文
posted @ 2013-05-27 00:49 女孩不哭 阅读(1751) 评论(0) 推荐(0) 编辑