Codeforces898A-Rounding

最新推荐文章于 2023-07-15 16:00:54 发布

JackflyDC

最新推荐文章于 2023-07-15 16:00:54 发布

阅读量222

点赞数 2

分类专栏： OI 文章标签： codeforces 898 A

本文链接：https://blog.csdn.net/qq_34531807/article/details/78846559

版权

OI 专栏收录该内容

222 篇文章 0 订阅

订阅专栏

A. Rounding

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Vasya has a non-negative integer n. He wants to round it to nearest integer, which ends up with 0. If n already ends up with 0, Vasya considers it already rounded.

For example, if n = 4722 answer is 4720. If n = 5 Vasya can round it to 0 or to 10. Both ways are correct.

For given n find out to which integer will Vasya round it.

Input

The first line contains single integer n (0 ≤ n ≤ 109) — number that Vasya has.

Output

Print result of rounding n. Pay attention that in some cases answer isn't unique. In that case print any correct answer.

   Examples 
 
     input 
   
5

     output 
   
0

     input 
   
113

     output 
   
110

     input 
   
1000000000

     output 
   
1000000000

     input 
   
5432359

     output 
   
5432360

Note

In the first example n = 5. Nearest integers, that ends up with zero are 0 and 10. Any of these answers is correct, so you can print 0 or10.

题解:四舍五入，直接求解。

Code：

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int n;
	scanf("%d",&n);
	int k=n%10;
	if(k<=5)printf("%d",n-k);
		else printf("%d",n+10-k);
	return 0;
}