• [1303] A + B

  • 时间限制: 1000 ms 内存限制: 65535 K
  • 问题描述
  • 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.
  • 输入
  • 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.
  • 输出
  • For each case, you should estimate whether the sum is beyond the range. If exceeded, print “Yes”, otherwise “I love nbut”.
  • 样例输入
  • 64 
    1000 1000
  • 样例输出
  • I love nbut
  • 提示
  • 来源
  • 加多宝凉茶
  • 操作