HDUOJ--4565 So Easy!
时间：2014-03-28 08:17:32
收藏：0
阅读：558
So Easy!
Time
Limit: 2000/1000 MS (Java/Others) Memory Limit:
32768/32768 K (Java/Others)
Total Submission(s):
1729 Accepted Submission(s):
556
Problem Description
A sequence Sn is
defined as:
Where a, b, n, m are positive integers.┌x┐is the ceil of x. For example, ┌3.14┐=4. You are to calculate Sn.
You, a top coder, say: So easy!
Where a, b, n, m are positive integers.┌x┐is the ceil of x. For example, ┌3.14┐=4. You are to calculate Sn.
You, a top coder, say: So easy!
Input
There are several test cases, each test case in one line
contains four positive integers: a, b, n, m. Where 0< a, m <
215, (a-1)2< b < a2, 0 < b, n <
231.The input will finish with the end of file.
Output
For each the case, output an integer
Sn.
Sample Input
2 3 1 2013 2 3 2
2013 2 2 1 2013
Sample Output
4 14 4
Source
此题的思路在于这儿....看图...
HDUOJ--4565 So Easy!,布布扣,bubuko.com
原文：http://www.cnblogs.com/gongxijun/p/3628670.html
评论（0）