ACM,再见！

http://acm.hdu.edu.cn/showproblem.php?pid=1715Problem DescriptionFibonacci数列，定义如下：f(1)=f(2)=1f(n)=f(n-1)+f(n-2) n>=3。计算第n项Fibonacci数值。 Input输入第一行为一个整数N，接下来N行为整数Pi（1

http://acm.nefu.edu.cn/JudgeOnline/problemshow.php?problem_id=590description给出一些整数对，一个为可能接近100位的大数，另一个为1位数，求这些数对的乘积。 input输入数据有多组,每组2个数. outpu

http://acm.nefu.edu.cn/JudgeOnline/problemshow.php?problem_id=591description求n个数相加的和。 input输入数据包含多个测试实例，每个测试实例的输入第一行包含一个正整数n（1 output

http://acm.hdu.edu.cn/showproblem.php?pid=1250Hat's FibonacciTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7245    Accepted Submissi

http://acm.hdu.edu.cn/showproblem.php?pid=1316

http://codeforces.com/problemset/problem/18/DLast year Bob earned by selling memory sticks. During each of n days of his work one of the two following events took place:A customer came t