HDOJ1001
来源:互联网 发布:mac怎么截gif 编辑:程序博客网 时间:2024/05/17 02:15
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.
Sample Input
2
1 2
112233445566778899 998877665544332211
Sample Output
Case 1:
1 + 2 = 3
Case 2:
112233445566778899 + 998877665544332211 = 1111111111111111110
import java.util.Scanner;class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); while(sc.hasNext()){ int n = sc.nextInt(); int sum = 0; for(int i = 1 ; i<=n ; i++){ sum += i; } System.out.println(sum); System.out.println(); } }}
- hdoj1001
- HDOJ1001
- HDOJ1001
- hdoj1001
- hdoj1001
- hdoj1001
- HDOJ1001
- hdoj1001-java
- HDOJ1001 Sum Problem
- hdoj1001简单题、大数
- HDOJ1001:Sum Problem
- hdoj1001解题报告
- hdoj1001【智障了。。。】
- HDOJ1001 Sum Problem
- 从零开始刷HDOJ(2)【HDOJ1001
- hdoj1001 Sum Problem(细心点)
- python应用
- JS面向对象详解
- IO,异常
- Windows延迟删除、重命名
- Maven tomcat插件debug项目时 ,出现source not found的解决办法
- HDOJ1001
- 基于Dubbo的分布式系统架构(二):搭建一个简单的分布式架构
- ssh--applicationContext.xml
- 图片通过javaCV转RTMP流
- Privilegelnterceptor
- sizeof特点
- Ngx中的红黑树描述
- ssh--struts.xml
- Eclipse快捷键大全