Codeforces 898 A. Rounding

 
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 or 10.

 

代码：

 1 #include<iostream>
 2 #include<cstring>
 3 #include<cstdio>
 4 #include<cmath>
 5 #include<algorithm>
 6 using namespace std;
 7 typedef long long ll;
 8 int main(){
 9     ll n;
10     while(~scanf("%lld",&n)){
11     ll temp=n%10;
12     if(temp>5)n=n-temp+10;
13     else n=n-temp;
14     printf("%lld\n",n);
15     }
16     return 0;

 

 

 

 
 
 

 

posted @ 2017-12-17 21:29  ZERO-  阅读(440)  评论(0)  编辑  收藏  举报