暂无测试数据。

Background

改编自CLRS（算法导论） 练习2. 1-3

Description

考虑以下查找问题

输入：\(n\)个数的一个序列\(A = <a_1, a_2, \cdots, a_n>\)和\(v\)

输出：找出下标\(i\)使得\(v=A[i]\)。若\(v\notin A\)，输出"NIL"

Format

Input

Two integers x and y, satisfying 0 <= x, y <= 32767.

Output

One integer, the sum of x and y.

Sample 1

Input

123 500

Output

623

Limitation

对于所有测试点，提供256MB的内存和2s的时限
对于所有的数据，有\(n \leqslant 5 \times 10^6\)

Hint

Free Pascal Code

var a,b:longint;
begin
    readln(a,b);
    writeln(a+b);
end.

C Code

#include <stdio.h>
int main(void)
{
    int a, b;
    scanf("%d%d", &a, &b);
    printf("%d\n", a + b);
    return 0;
}

C++ Code

#include <iostream>
using namespace std;
int main()
{
    int a, b;
    cin >> a >> b;
    cout << a + b << endl;
    return 0;
}

Python Code

a, b = [int(i) for i in raw_input().split()]
print(a + b)

Java Code

import java.io.*;
import java.util.Scanner;

public class Main {

    /**
     * @param args
     * @throws IOException 
     */
    public static void main(String[] args) throws IOException {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        System.out.println(a + b);
    }
}

Source

Vijos Original