判断数列是否达到最大和的算法,怎么利用C程序的语言设计技术来编写

Problem Description
As we all know, in the computer science, an integer A is in the range of 32-signed integer, which means the integer A is between -2^31 and (2^31)-1 (inclusive), and A is a 64-signed integer, which means A is between -2^63 and (2^63)-1(inclusive). Now we give the K-signed range, and two K-signed integers A and B, you should check whether the sum of A and B is beyond the range of K-signed integer or not.

Input
There will be many cases to calculate. In each case, there comes the integer K (2<=K<=64) first in a single line. Then following the line, there is another single line which has two K-signed integers A and B.

Output
For each case, you should estimate whether the sum is beyond the range. If exceeded, print “Yes”, otherwise “WaHaHa”.

Sample Input
32
100 100

Sample Output
WaHaHa

查看全部
shunfurh
编程介的小学生
2019/04/01 21:24
  • Golang
  • r语言
  • erlang
  • 点赞
  • 收藏
  • 回答
    私信

0个回复