Skip to content

Commit 8f198b1

Browse files
committed
[Bronze V] Title: Just Round Down, Time: 8 ms, Memory: 69096 KB -BaekjoonHub
1 parent 6b0bbbf commit 8f198b1

2 files changed

Lines changed: 33 additions & 0 deletions

File tree

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1 @@
1+
print(Int(Double(readLine()!)!))
Lines changed: 32 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,32 @@
1+
# [Bronze V] Just Round Down - 32458
2+
3+
[문제 링크](https://www.acmicpc.net/problem/32458)
4+
5+
### 성능 요약
6+
7+
메모리: 69096 KB, 시간: 8 ms
8+
9+
### 분류
10+
11+
구현
12+
13+
### 제출 일자
14+
15+
2025년 2월 25일 16:43:19
16+
17+
### 문제 설명
18+
19+
<p>The Taiwan Online Programming Contest is a prestigious event that attracts talented programmers from all over the world. Known for its challenging problems and competitive environment, the contest has become a platform where only the best can prove their skills. However, there is one problem setter who has gained a notorious reputation among participants. This problem setter, known only by their pseudonym “<code>truckski</code>,” has an unusual fascination with numbers – particularly big numbers, floating-point numbers, and any kind of mathematical challenge that involves precise calculations. <code>truckski</code> has a unique style of creating problems that often requires competitors to think carefully about the properties of numbers and how they can be manipulated.</p>
20+
21+
<p>In this year’s edition of the Taiwan Online Programming Contest, <code>truckski</code> has come up with a seemingly simple yet tricky problem. The problem revolves around a fundamental concept in mathematics: rounding down a floating-point number to its nearest integer. While this task might appear straightforward at first glance, <code>truckski</code>’s twist lies in the precision required and the ability to handle a variety of foating-point values accurately.</p>
22+
23+
<p>Your task is to help the participants solve this problem by writing a program that takes a positive foating-point number as input and outputs the result of rounding it down to the nearest integer. This process is often referred to as taking the “floor” of a number. The floor of a number is the greatest integer that is less than or equal to the number itself.</p>
24+
25+
### 입력
26+
27+
<p>The input consists of a single line containing one positive floating-point number <mjx-container class="MathJax" jax="CHTML" style="font-size: 109%; position: relative;"><mjx-math class="MJX-TEX" aria-hidden="true"><mjx-mi class="mjx-i"><mjx-c class="mjx-c1D465 TEX-I"></mjx-c></mjx-mi></mjx-math><mjx-assistive-mml unselectable="on" display="inline"><math xmlns="http://www.w3.org/1998/Math/MathML"><mi>x</mi></math></mjx-assistive-mml><span aria-hidden="true" class="no-mathjax mjx-copytext">$x$</span></mjx-container>.</p>
28+
29+
### 출력
30+
31+
<p>The output should be a single integer, which is the floor of the input number <mjx-container class="MathJax" jax="CHTML" style="font-size: 109%; position: relative;"><mjx-math class="MJX-TEX" aria-hidden="true"><mjx-mi class="mjx-i"><mjx-c class="mjx-c1D465 TEX-I"></mjx-c></mjx-mi></mjx-math><mjx-assistive-mml unselectable="on" display="inline"><math xmlns="http://www.w3.org/1998/Math/MathML"><mi>x</mi></math></mjx-assistive-mml><span aria-hidden="true" class="no-mathjax mjx-copytext">$x$</span></mjx-container>. Please do not output decimal points.</p>
32+

0 commit comments

Comments
 (0)