-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
[Bronze V] Title: A+B - 9, Time: 40 ms, Memory: 31120 KB, Score: 100 …
…point -BaekjoonHub
- Loading branch information
Showing
2 changed files
with
33 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,5 @@ | ||
import sys | ||
input = sys.stdin.readline | ||
|
||
a, b = map(int, input().split()) | ||
print(a+b) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,28 @@ | ||
# [Bronze V] A+B - 9 - 15740 | ||
|
||
[문제 링크](https://www.acmicpc.net/problem/15740) | ||
|
||
### 성능 요약 | ||
|
||
메모리: 31120 KB, 시간: 40 ms | ||
|
||
### 분류 | ||
|
||
임의 정밀도 / 큰 수 연산, 사칙연산, 수학 | ||
|
||
### 제출 일자 | ||
|
||
2024년 10월 2일 13:17:34 | ||
|
||
### 문제 설명 | ||
|
||
<p>두 정수 <em>A</em>와 <em>B</em>를 입력받은 다음, <em>A</em>+<em>B</em>를 출력하는 프로그램을 작성하시오.</p> | ||
|
||
### 입력 | ||
|
||
<p>첫째 줄에 <em>A</em>와 <em>B</em> (-10<sup>10000</sup> ≤ <em>A</em>, <em>B</em> ≤ 10<sup>10000</sup>)가 주어진다.</p> | ||
|
||
### 출력 | ||
|
||
<p>첫째 줄에 <em>A</em>+<em>B</em>를 출력한다.</p> | ||
|