首页 > 其他 > 详细

HDUOJ--4565 So Easy!

时间:2014-03-28 08:17:32      阅读:556      评论:0      收藏:0      [点我收藏+]

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:
bubuko.com,布布扣

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! 
bubuko.com,布布扣
 

 

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
 
 
此题的思路在于这儿....看图...
bubuko.com,布布扣

HDUOJ--4565 So Easy!,布布扣,bubuko.com

HDUOJ--4565 So Easy!

原文:http://www.cnblogs.com/gongxijun/p/3628670.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!