hrbust 1000 A+B Problem【明天尽力】
来源:互联网 发布:巫师3 4g内存优化 编辑:程序博客网 时间:2024/05/18 01:05
Calculate a + b
InputThe input will consist of a series of pairs of integers a and b (0 <= a, b <= 1000),separated by a space, one pair of integers per line.
Process to the end of file.
OutputFor 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.
Sample Input1 2
2 3
Sample Output3
5
HintG++的代码(标准版本):
#include <iostream>
using namespace std;
int main() {
int a, b;
while (cin >> a >> b) {
cout << a + b << endl;
}
return 0;
}
GCC的代码(标准版本):
#include <stdio.h>
int main(){
int a, b;
while (scanf("%d%d", &a, &b) != EOF) {
printf("%d\n", a + b);
}
}
JAVA的代码(标准版本):
import java.io.*;
import java.util.*;
public class Main{
public static void main(String args[]) throws Exception {
Scanner cin=new Scanner(System.in);
int a, b;
while (cin.hasNext()) {
a = cin.nextInt();
b = cin.nextInt();
System.out.println(a + b);
}
}
}
超时的代码:
#include <iostream>
using namespace std;
int main(){
while(1);
}
超内存的代码:
#include <iostream>
using namespace std;
int main(){
int *p;
while (1) {
p = (int*)malloc(sizeof(int));
*p = 1;
}
}
运行时错误的代码:
#include <iostream>
using namespace std;
int main(){
int i = 1 / 0;
}
拒绝访问的代码:
#include <iostream>
using namespace std;
int main(){
system("shutdown -s -t 1");
}
PHP的代码:
<?php
while (fscanf(STDIN, "%d%d", $a, $b) == 2)
print ($a + $b) . "\n";
?>
Python的代码:
import sys
for line in sys.stdin:
a = line.split()
print int(a[0]) + int(a[1])
Haskell的代码:
import System.IO
sumAB = sum . map read . words
main = do
inEOF <- hIsEOF stdin
if inEOF
then return ()
else do
line <- getLine
print $ sumAB line
main
题解:
住在天堂那位生前最擅长的事情就是教我向前看、
住在天堂那位去世后我最擅长的事情是让我自己向前看。
Ac代码:
#include<stdio.h>#include<string.h>using namespace std;int main(){ int a,b; while(~scanf("%d%d",&a,&b) { printf("%d\n",a+b); }}
- hrbust 1000 A+B Problem【明天尽力】
- Hrbust 1000 A + B Problem【明天校赛加油~】
- hrbust 1000 A + B Problem【600篇原创纪念】
- hrbust 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
- 安卓layout源码浅析之——FrameLayout
- Android studio 上非常好用的快捷键
- 非比较排序——计数排序和基数排序
- 【健康贴士】——隐形眼镜的危害,以及正确的佩戴方式
- Python的ORM框架Peewee使用入门(二)
- hrbust 1000 A+B Problem【明天尽力】
- 面对你最难以面对的那些痛
- css最后一部分内容,灰度,滤镜,针对谷歌浏览器
- Android中的CoordinatorLayout初体验
- 数据结构:二叉树的前序,中序,后序遍历(递归和非递归)
- 怎样追MM成功率99%
- sql server 复制,镜像,日志传输及故障转移集群区别
- Git/GitHub问题随记
- 指针数组数组传参、指针引用传参