32260번 - A + B 서브태스크다국어언어 제한함수 구현

문제

Given two non-negative integers $A$ and $B,ドル compute $A + B$.

구현 상세

You should implement the following procedure:

int sum(int A, int B)

• $A,ドル $B$: two non-negative integers.
• The procedure should return $A + B$.
• The procedure is called exactly once.

입력

출력

제한

• 0ドル ≤ A ≤ 100$
• 0ドル ≤ B ≤ 100$

서브태스크

힌트

예제 1

Consider the following call:

sum(1, 1)

In this case $A = B = 1$. Hence, the procedure should return 1ドル + 1 = 2$.

예제 2

Consider the following call:

sum(2, 3)

In this case $A = 2$ and $B = 3$. The correct return value is 5ドル$.

샘플 그레이더

Input format:

A B

Output format:

R

Here, $R$ is the value returned by sum.

첨부

• aplusb.zip