2012年9月6日

HDU 4099 Revenge of Fibonacci（字典树）

摘要： Revenge of FibonacciTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 204800/204800 K (Java/Others)Total Submission(s): 914Accepted Submission(s): 197Problem DescriptionThe well-known Fibonacci sequence is defined as following:Here we regard n as the index of the Fibonacci number F(n).This sequen 阅读全文

posted @ 2012-09-06 17:36 kuangbin 阅读(2178) 评论(1) 推荐(0)

HDU 3501 Calculation 2(欧拉函数的引申）

摘要： Calculation 2Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1264Accepted Submission(s): 530Problem DescriptionGiven a positive integer N, your task is to calculate the sum of the positive integers less than N which are not coprime to N. A is said 阅读全文

posted @ 2012-09-06 16:38 kuangbin 阅读(399) 评论(0) 推荐(0)

HDU 2802 F(N)（简单题，找循环解）

摘要： F(N)Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2037Accepted Submission(s): 677Problem DescriptionGiving the N, can you tell me the answer of F(N)?InputEach test case contains a single integer N(1<=N<=10^9). The input is terminated by a s 阅读全文

posted @ 2012-09-06 15:20 kuangbin 阅读(1122) 评论(0) 推荐(0)

导航

JAVASCRIPT: