hrbust 1000 A + B Problem【600篇原创纪念】
来源:互联网 发布:json查看工具 编辑:程序博客网 时间:2024/06/05 14:56
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
思路:
经典的题做一道少一道。
前方的路走一步少一步。
ACM的日子过一天少一天。
迷茫的道路怕越走越偏。
菊菊们说了,即使抄题解,咱也应该越抄越难的。
自己选的路,跪着也要走完。
AC代码:
#include<stdio.h>int main(){ int a,b; while(~scanf("%d%d",&a,&b)) { printf("%d\n",a+b); }}
- hrbust 1000 A + B Problem【600篇原创纪念】
- hrbust 1000 A+B Problem【明天尽力】
- hrbust 1663 水果【状压dp】【原创1000篇纪念!!!】
- hrbust 1000 A+B Problem【不忘初心、尽力而为】
- 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
- C++拷贝构造函数详解
- poj3352 Road Construction
- GIT——乱乱的理解
- DIR(5), dirent(5) 目录文件格式
- 派生类的构造函数
- hrbust 1000 A + B Problem【600篇原创纪念】
- 二叉搜索树(Binary Search Tree)
- RaspberryPi 3B 之初体验笔记(续二,python篇)
- KMP
- 1A. Theatre Square
- C++设计模式浅识解释器模式
- WebService三大基本元素 SOAP WSDL UDDI
- Rolling Variance
- java关键字、标识符