杭电ACM1000,1001,1002 java解答
来源:互联网 发布:数据库的优化方法 编辑:程序博客网 时间:2024/05/24 04:08
1000 .
Problem Description
Calculate A + B.
Input
Each line will contain two integers A and B. Process to end of file.
Output
For each case, output A + B in one line.
注意Process to end of file.
import java.util.Scanner;public class Main { public static void main(String args[]){ int a,b; Scanner s=new Scanner(System.in); while(s.hasNextInt()){ a=s.nextInt(); b=s.nextInt(); System.out.println((a+b)); } }}
1001 .
Problem Description
Hey, welcome to HDOJ(Hangzhou Dianzi University Online Judge).
In this problem, your task is to calculate SUM(n) = 1 + 2 + 3 + … + n.
Input
The input will consist of a series of integers n, one integer per line.
Output
For each case, output SUM(n) in one line, followed by a blank line. You may assume the result will be in the range of 32-bit signed integer.
注意计算n*(n-1)会产生溢出。
import java.util.Scanner;public class Main { public static void main(String args[]){ Scanner s=new Scanner(System.in); while(s.hasNextInt()){ int n=s.nextInt(); if((n<<31)>>31==0){ int sum=n/2; sum=sum*(n+1); System.out.println(sum); System.out.println(); } else{ int sum=(n+1)/2; sum=sum*n; System.out.println(sum); System.out.println(); } } }}
1002.
Problem Description
I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.
Input
The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line consists of two positive integers, A and B. Notice that the integers are very large, that means you should not process them by using 32-bit integer. You may assume the length of each integer will not exceed 1000.
Output
For each test case, you should output two lines. The first line is “Case #:”, # means the number of the test case. The second line is the an equation “A + B = Sum”, Sum means the result of A + B. Note there are some spaces int the equation. Output a blank line between two test cases.
注意最后一个输出之后不需要再换行了。
import java.math.BigInteger;import java.util.Scanner;public class Main { public static void main(String args[]){ Scanner s=new Scanner(System.in); int T=s.nextInt(); for(int i=0;i<T;i++){ BigInteger a=s.nextBigInteger(); BigInteger b=s.nextBigInteger(); BigInteger c=a.add(b); System.out.println("Case "+(i+1)+":"); System.out.println(a.toString()+" + "+b.toString()+" = "+c.toString()); if(i!=T-1) System.out.println(); } }}
- 杭电ACM1000,1001,1002 java解答
- 杭电ACM1000题------java语言
- 杭电acm1000
- 杭电ACM1000题
- 杭电ACM1000
- 杭电ACM1000
- 杭电ACM1000
- 杭电ACM1000
- 杭电acm1000 A + B Problem
- 杭电ACM1000题------C语言
- 杭电ACM1000题------C语言
- 杭电ACM1003,1004,1005 java解答
- ACM1000
- acm1000
- 杭电1717解答
- 杭电1038题目解答
- hdu 杭电新手 2000 解答
- 杭电1002解答疑问求解(附对和错的C++代码)
- 放麦子 valueof substring
- Java transient关键字
- Oracle Linux: Error "Missing Or Invalid IPv4 Prefix '0' On Linux Server" (文档 ID 1522095.1)
- [亲测]ThinkPHP中where方法中变量不解析的解决方法
- 爬爬爬之路:UI(七) UIScrollView,UIScrollViewDelegate UIPageControl 方法总结
- 杭电ACM1000,1001,1002 java解答
- 拓展开源库PullZoomView适配瀑布流
- 重写构造方法init与自定义构造方法的详解
- 工厂方法模式
- Linux基础
- 最新的CocoaPods安装教程
- hdu1213 How Many Tables (裸并查集)
- hibernate缓存
- UITextField的键盘的回收