【NOJ】[1000] A+B Problem
来源:互联网 发布:数控车g76编程实例 编辑:程序博客网 时间:2024/06/05 09:55
[1000] A+B Problem
- 时间限制: 1000 ms 内存限制: 1024 K
- 问题描述
Calculate a + b
note: a and b may bigger than INT_MAX
- 输入
- The input will consist of a series of pairs of integers a and b,separated by a space, one pair of integers per line, 0 0 means the end of the input, and do not need to output.
- 输出
- For each pair of input integers a and b you should output the sum of a and b in one line,and with one line of output for each line in input.
- 样例输入
1 50 0
- 样例输出
6
#include <stdio.h>int main() {long long a,b,c; while(~scanf("%I64d %I64d",&a,&b)){ if(a==0&&b==0) break; else printf("%I64d\n",a+b); }return 0;}
阅读全文
0 0
- 【NOJ】[1000] A+B Problem
- problem 1000: A+B problem
- Problem 1000 A+B Problem
- Problem - 1000 A + B Problem
- 1000 A+B Problem
- 1000 A+B Problem
- 1000 A + B Problem
- 1000 A+B Problem
- 1000 A + B Problem
- 1000:A+B problem
- 1000 A + B Problem
- 1000 A+B Problem
- 1000 . A+B Problem
- 1000 A + B Problem
- 1000 A + B Problem
- 1000 -- A+B Problem
- 1000 ( A + B Problem )
- [1000]:A + B Problem
- [蓝书/Ch5] The K-League UVALive
- 打印机管理网站(Java Web+Bootstrap)
- HDU2767 Proving Equivalences 解题报告【tarjan缩点】
- 几种保持登录状态的方式
- Linux中安装配置arm-2009q3方法
- 【NOJ】[1000] A+B Problem
- 安卓Context介绍
- Myeclipse优化building时间
- ubuntu-利用pdnsd-TCP方式获取IP-拒绝DNS污染
- jsp Request获取url信息的各种方法比较
- Struts2框架(二)Action
- selenium练习三:百度搜索自动化脚本
- 滑动窗口最大值
- 《移动Web前端高效开发实战》笔记4--打造单页应用SPA