浙江大学PAT_甲级_1065. A+B and C (64bit) (20)
2015-06-20 17:45
369 查看
题目链接:点击打开链接
Given three integers A, B and C in [-263, 263], you are supposed to tell whether A+B > C.
Input Specification:
The first line of the input gives the positive number of test cases, T (<=10). Then T test cases follow, each consists of a single line containing three integers A, B and C, separated by single spaces.
Output Specification:
For each test case, output in one line "Case #X: true" if A+B>C, or "Case #X: false" otherwise, where X is the case number (starting from 1).
Sample Input:
Sample Output:
我的python2程序:
![](http://img.blog.csdn.net/20150620174649932?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQvcHl0aG9udG9qYXZh/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center)
=======
2015.7.13
java
Given three integers A, B and C in [-263, 263], you are supposed to tell whether A+B > C.
Input Specification:
The first line of the input gives the positive number of test cases, T (<=10). Then T test cases follow, each consists of a single line containing three integers A, B and C, separated by single spaces.
Output Specification:
For each test case, output in one line "Case #X: true" if A+B>C, or "Case #X: false" otherwise, where X is the case number (starting from 1).
Sample Input:
3 1 2 3 2 3 4 9223372036854775807 -9223372036854775808 0
Sample Output:
Case #1: false Case #2: true Case #3: false
我的python2程序:
n=int(raw_input()) num=[] for i in range(1,n+1): num=[int(j) for j in raw_input().split()] if num[0]+num[1]>num[2]: print "Case #%d: true"%(i) else: print "Case #%d: false"%(i)
=======
2015.7.13
java
import java.util.*; import static java.lang.System.*; import java.math.*; public class Main { public static void main(String[] args) { Scanner cin=new Scanner(System.in); BigInteger a=BigInteger.valueOf(1); BigInteger b=BigInteger.valueOf(1); BigInteger c=BigInteger.valueOf(1); int n=0; n=cin.nextInt(); for(int i=0;i<n;i++) { a=cin.nextBigInteger();//输入大数字a b=cin.nextBigInteger();//输入大数字b c=cin.nextBigInteger();//输入大数字c a=a.add(b);//a=a+b; if(a.compareTo(c)>0) { out.println("Case #"+(i+1)+": true"); } else { out.println("Case #"+(i+1)+": false");; } } } }
相关文章推荐
- iOS开发使用.ttf或.otf外部字体库
- Struts2不进action就跳到Input配置的页面
- [BZOJ 1787 & 1832] [Ahoi2008] Meet 紧急集合
- 多行文本超出 JS省略号...
- java中多线程的基本理解以及运行机制
- 多语言协作与二进制交互【转】
- C语言下不使用日期函数输入任意日期计算周几的程序
- CSS3多行显示省略号...
- 创建具有透明背景的OS X应用程序
- 【练习题】读取一个字符串,计算每个字母出现的个数
- Median of Two Sorted Arrays - LeetCode 4
- 动漫人物之七大罪 伊丽莎白·里昂妮丝 Elizabeth Liones エリザベス・リオ ネス CV 雨宫天
- 练习代码(三)复用类
- 脚本无阻塞加载
- 第2章 算法入门
- 键盘过滤驱动程序
- 测试与调试
- 常驻内存(Redis) ,界哥说 redis里面保存了很多的用户手机,万一宕机了呢
- Ubuntu通过使用PyCharm 执行调试 Odoo 8.0 可能的问题
- 广告轮播的实现,也适用于引导页-AdCycle